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-171683761700730.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 ShieldRVs-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700730
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 24K 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 ShieldRVs-PT-002B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717032574138

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:29:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:29:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:29:35] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-30 01:29:35] [INFO ] Transformed 83 places.
[2024-05-30 01:29:35] [INFO ] Transformed 93 transitions.
[2024-05-30 01:29:35] [INFO ] Found NUPN structural information;
[2024-05-30 01:29:35] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 69 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 89
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 89
Applied a total of 8 rules in 19 ms. Remains 79 /83 variables (removed 4) and now considering 89/93 (removed 4) transitions.
// Phase 1: matrix 89 rows 79 cols
[2024-05-30 01:29:35] [INFO ] Computed 9 invariants in 7 ms
[2024-05-30 01:29:35] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-30 01:29:35] [INFO ] Invariant cache hit.
[2024-05-30 01:29:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2024-05-30 01:29:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 12 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 2 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 2 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 6 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:38] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 15/106 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:29:40] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 13 (OVERLAPS) 89/168 variables, 79/196 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:42] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:29:42] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:42] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:29:42] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:29:43] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/168 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/168 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:46] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:29:46] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/168 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/168 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 25 (OVERLAPS) 0/168 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 219 constraints, problems are : Problem set: 0 solved, 88 unsolved in 11715 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 131/131 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 131/140 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:48] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 89/168 variables, 79/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 88/308 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:50] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:50] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/168 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:51] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:29:51] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:52] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:52] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 5/315 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:54] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:29:58] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/168 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/168 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-30 01:30:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:01] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/168 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 17 (OVERLAPS) 0/168 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 320 constraints, problems are : Problem set: 0 solved, 88 unsolved in 18702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 144/144 constraints]
After SMT, in 30488ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 30507ms
Starting structural reductions in LTL mode, iteration 1 : 79/83 places, 89/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30827 ms. Remains : 79/83 places, 89/93 transitions.
Support contains 69 out of 79 places after structural reductions.
[2024-05-30 01:30:06] [INFO ] Flatten gal took : 26 ms
[2024-05-30 01:30:06] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:30:06] [INFO ] Input system was already deterministic with 89 transitions.
RANDOM walk for 40000 steps (365 resets) in 1641 ms. (24 steps per ms) remains 6/68 properties
BEST_FIRST walk for 40002 steps (112 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (91 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 343 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (84 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (130 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
[2024-05-30 01:30:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/79 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Problem AtomicPropp51 is UNSAT
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 7/16 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 89/168 variables, 79/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 97 constraints, problems are : Problem set: 4 solved, 2 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 4 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 37/43 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/79 variables, 4/9 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 9/18 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 89/168 variables, 79/98 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/100 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 100 constraints, problems are : Problem set: 4 solved, 2 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 10/10 constraints]
After SMT, in 574ms problems are : Problem set: 4 solved, 2 unsolved
Parikh walk visited 0 properties in 210 ms.
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 89/89 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 79 transition count 83
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 72 transition count 82
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 14 place count 72 transition count 71
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 36 place count 61 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 45 place count 52 transition count 62
Iterating global reduction 3 with 9 rules applied. Total rules applied 54 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 54 place count 52 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 60 place count 49 transition count 59
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 84 place count 37 transition count 47
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 37 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 36 transition count 46
Applied a total of 89 rules in 27 ms. Remains 36 /79 variables (removed 43) and now considering 46/89 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 36/79 places, 46/89 transitions.
RANDOM walk for 40000 steps (755 resets) in 393 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (236 resets) in 336 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (291 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
Probably explored full state space saw : 30411 states, properties seen :0
Probabilistic random walk after 159062 steps, saw 30411 distinct states, run finished after 426 ms. (steps per millisecond=373 ) properties seen :0
Explored full state space saw : 30411 states, properties seen :0
Exhaustive walk after 159062 steps, saw 30411 distinct states, run finished after 366 ms. (steps per millisecond=434 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-30 01:30:09] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:30:09] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:30:09] [INFO ] Input system was already deterministic with 89 transitions.
Support contains 63 out of 79 places (down from 64) after GAL structural reductions.
Computed a total of 23 stabilizing places and 23 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 78 transition count 83
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 73 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 10 place count 73 transition count 74
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 28 place count 64 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 54 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 54 transition count 64
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 48 place count 54 transition count 61
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 51 transition count 61
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 74 place count 41 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 40 transition count 50
Applied a total of 75 rules in 14 ms. Remains 40 /79 variables (removed 39) and now considering 50/89 (removed 39) transitions.
// Phase 1: matrix 50 rows 40 cols
[2024-05-30 01:30:09] [INFO ] Computed 9 invariants in 4 ms
[2024-05-30 01:30:09] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-30 01:30:09] [INFO ] Invariant cache hit.
[2024-05-30 01:30:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-30 01:30:09] [INFO ] Redundant transitions in 14 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-30 01:30:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 3/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 7/33 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 50/90 variables, 40/76 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/90 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/90 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 16 (OVERLAPS) 0/90 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 85 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2400 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 3/40 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 50/90 variables, 40/85 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 46/131 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 131 constraints, problems are : Problem set: 0 solved, 46 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 36/36 constraints]
After SMT, in 3249ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3251ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/79 places, 50/89 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3364 ms. Remains : 40/79 places, 50/89 transitions.
[2024-05-30 01:30:12] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:30:12] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:12] [INFO ] Input system was already deterministic with 50 transitions.
[2024-05-30 01:30:12] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:30:12] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:30:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11602832401396551545.gal : 2 ms
[2024-05-30 01:30:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4296195591593286054.ctl : 3 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11602832401396551545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4296195591593286054.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,184420,0.05419,5332,2,693,5,7377,6,0,212,12317,0


Converting to forward existential form...Done !
original formula: AF(E((EF(((p2==1)&&(p25==1))) * (((p3==1)||(p56==1))||((p17==1)||(((p30==1)&&(p38==1))&&(p64==1))))) U ((p61==1)&&(p74==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E((E(TRUE U ((p2==1)&&(p25==1))) * (((p3==1)||(p56==1))||((p17==1)||(((p30==1)&&(p38==1))&&(p64==1)...194
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t18, t35, t36, t37, t39, t40, t41...290
(forward)formula 0,1,1.58599,58032,1,0,384,264837,132,201,1610,455298,335
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 71 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 5 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
// Phase 1: matrix 81 rows 71 cols
[2024-05-30 01:30:14] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 01:30:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 01:30:14] [INFO ] Invariant cache hit.
[2024-05-30 01:30:14] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 01:30:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:16] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 81/152 variables, 71/142 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:18] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/152 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 19 (OVERLAPS) 0/152 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 167 constraints, problems are : Problem set: 0 solved, 80 unsolved in 7734 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 87/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/152 variables, 71/170 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 80/250 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 5/255 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:30:24] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:24] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 257 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5413 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 97/97 constraints]
After SMT, in 13161ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 13163ms
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 81/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13274 ms. Remains : 71/79 places, 81/89 transitions.
[2024-05-30 01:30:27] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:30:27] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:27] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 01:30:27] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:30:27] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16894799104842080904.gal : 1 ms
[2024-05-30 01:30:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12436398584380142608.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16894799104842080904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12436398584380142608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.68192e+06,0.17402,11064,2,2555,5,22654,6,0,367,49778,0


Converting to forward existential form...Done !
original formula: A(!((!((EG((p27==1)) * A((p56==1) U (p71==1)))) + AX((((p62==1)&&(p58==1))||(p54!=1))))) U EF((AF((EX(((p61==1)&&(p74==1))) * (p36!=1))) ...231
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EG(!((EX(((p61==1)&&(p74==1))) * (p36!=1))))) * E(EG((((p30==1)&&(p41==1))&&(p64==1...655
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t21, t27, t29...300
Using saturation style SCC detection
(forward)formula 0,0,23.5476,716416,1,0,1823,3.55603e+06,218,927,2505,6.22955e+06,1926
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 83
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 83
Applied a total of 12 rules in 2 ms. Remains 73 /79 variables (removed 6) and now considering 83/89 (removed 6) transitions.
// Phase 1: matrix 83 rows 73 cols
[2024-05-30 01:30:51] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:30:51] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:30:51] [INFO ] Invariant cache hit.
[2024-05-30 01:30:51] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-30 01:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 17/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 83/156 variables, 73/161 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:56] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:30:56] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:56] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:56] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:57] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:57] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:57] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/156 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 18 (OVERLAPS) 0/156 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 170 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7097 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 88/88 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 88/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (OVERLAPS) 83/156 variables, 73/170 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 82/252 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:30:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:31:00] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-05-30 01:31:00] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:31:01] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:31:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:31:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:02] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 4/259 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:31:03] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 260 constraints, problems are : Problem set: 0 solved, 82 unsolved in 7731 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 96/96 constraints]
After SMT, in 14843ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 14844ms
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 83/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14937 ms. Remains : 73/79 places, 83/89 transitions.
[2024-05-30 01:31:06] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:31:06] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:31:06] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-30 01:31:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:06] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:06] [INFO ] Time to serialize gal into /tmp/CTLFireability16526736651609131346.gal : 2 ms
[2024-05-30 01:31:06] [INFO ] Time to serialize properties into /tmp/CTLFireability17114835565337857104.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16526736651609131346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17114835565337857104.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.89641e+06,0.151202,10300,2,2554,5,20412,6,0,377,44192,0


Converting to forward existential form...Done !
original formula: A(!((((EX((p23==1)) + (p17==1)) * !(((p17==1)||(p5==1)))) * EG(!(((p73==1)||(((p15==1)&&(p21==1))&&(p30==1))))))) U ((AG((p59!=1)) + (((p...469
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !((p59!=1)))) + (((p40!=1)&&(p11==1))&&((p52==1)&&(p79==1)))) + (((EG((((p16==1)&&...1556
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t23, t26...305
Detected timeout of ITS tools.
[2024-05-30 01:31:36] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:31:36] [INFO ] Applying decomposition
[2024-05-30 01:31:36] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16530955920445560094.txt' '-o' '/tmp/graph16530955920445560094.bin' '-w' '/tmp/graph16530955920445560094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16530955920445560094.bin' '-l' '-1' '-v' '-w' '/tmp/graph16530955920445560094.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:31:36] [INFO ] Decomposing Gal with order
[2024-05-30 01:31:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:31:36] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-30 01:31:36] [INFO ] Flatten gal took : 49 ms
[2024-05-30 01:31:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 01:31:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4141804662880671455.gal : 3 ms
[2024-05-30 01:31:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8490594110263436324.ctl : 4 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4141804662880671455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8490594110263436324.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.89641e+06,0.102212,8112,562,50,8460,258,259,20023,54,807,0


Converting to forward existential form...Done !
original formula: A(!((((EX((i2.i1.u8.p23==1)) + (i1.u6.p17==1)) * !(((i1.u6.p17==1)||(i4.u2.p5==1)))) * EG(!(((i8.u23.p73==1)||(((i1.u5.p15==1)&&(i2.i0.u7...704
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !((i5.i0.u19.p59!=1)))) + (((i0.u12.p40!=1)&&(i1.u5.p11==1))&&((i5.i1.u17.p52==1)&...2203
Reverse transition relation is NOT exact ! Due to transitions u24.t15, u24.t16, u24.t17, u24.t18, i0.u1.t54, i0.u12.t6, i0.u12.t7, i0.u12.t8, i1.u4.t51, i1...522
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,8.90555,339708,1,0,624792,542,1686,1.10687e+06,273,1802,674441
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 3 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
// Phase 1: matrix 81 rows 71 cols
[2024-05-30 01:31:45] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:31:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 01:31:45] [INFO ] Invariant cache hit.
[2024-05-30 01:31:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 01:31:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 17 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:31:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (OVERLAPS) 81/152 variables, 71/134 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:50] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/152 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 22 (OVERLAPS) 0/152 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 137 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6083 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:31:52] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:53] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:31:53] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:53] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:31:53] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 81/152 variables, 71/154 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 80/234 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:53] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:31:54] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 236 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4457 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 76/76 constraints]
After SMT, in 10554ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 10556ms
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 81/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10665 ms. Remains : 71/79 places, 81/89 transitions.
[2024-05-30 01:31:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:56] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 01:31:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14108819908368314647.gal : 1 ms
[2024-05-30 01:31:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14669080569798965164.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14108819908368314647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14669080569798965164.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.59071e+06,0.145546,10300,2,2217,5,21238,6,0,367,43930,0


Converting to forward existential form...Done !
original formula: E((EF((((p54==1)&&(p60==1))&&(p68==1))) + ((EF(AG(((p22==1)&&(p35==1)))) * AG(AX((p42==1)))) * (A(((p82==1)||(p8==1)) U (p49!=1)) + (p46=...173
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (((p54==1)&&(p60==1))&&(p68==1))) + ((E(TRUE U !(E(TRUE U !(((p22==1)&&(p35==1)))))) * !(E...306
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t22, t25, t27...285
(forward)formula 0,1,10.0246,338064,1,0,955,1.44951e+06,205,481,2467,2.80255e+06,1096
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 79
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 69 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 59 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 49 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 49 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 58 place count 49 transition count 56
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 46 transition count 56
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 88 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 32 transition count 42
Applied a total of 90 rules in 11 ms. Remains 32 /79 variables (removed 47) and now considering 42/89 (removed 47) transitions.
// Phase 1: matrix 42 rows 32 cols
[2024-05-30 01:32:06] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:32:06] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:32:06] [INFO ] Invariant cache hit.
[2024-05-30 01:32:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-30 01:32:06] [INFO ] Redundant transitions in 15 ms returned [41]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 39 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 32 cols
[2024-05-30 01:32:06] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:06] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 2/32 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 41/73 variables, 32/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/73 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 68 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/32 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 41/73 variables, 32/68 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 39/107 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 01:32:08] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:08] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/73 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 109 constraints, problems are : Problem set: 0 solved, 39 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 29/29 constraints]
After SMT, in 2111ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2116ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/79 places, 41/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2220 ms. Remains : 32/79 places, 41/89 transitions.
[2024-05-30 01:32:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:32:08] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:32:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:32:08] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:32:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12573090929503702574.gal : 1 ms
[2024-05-30 01:32:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6392510129050835492.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12573090929503702574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6392510129050835492.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,26038,0.029317,4576,2,462,5,4400,6,0,172,7332,0


Converting to forward existential form...Done !
original formula: AG((AF(AG(AF((p54==0)))) + (((p11==1)&&(p55==1))&&(p80==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((p11==1)&&(p55==1))&&(p80==1)))),!(!(E(TRUE U !(!(EG(!((p54==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t26, t27, t28, t29, t30, t31, t32, t34...285
(forward)formula 0,1,0.197107,11704,1,0,247,44659,114,90,1333,58175,245
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 72 transition count 82
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 71 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 8 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
// Phase 1: matrix 81 rows 71 cols
[2024-05-30 01:32:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:32:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 01:32:09] [INFO ] Invariant cache hit.
[2024-05-30 01:32:09] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 01:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:32:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 5 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:10] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:11] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:12] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 81/152 variables, 71/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:13] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:13] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:14] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:14] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/152 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:14] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/152 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (OVERLAPS) 0/152 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 158 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6719 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 78/87 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:16] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:16] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:16] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 81/152 variables, 71/161 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 80/241 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:16] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:18] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:18] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:32:18] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:19] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 247 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6000 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 87/87 constraints]
After SMT, in 12728ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12729ms
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 81/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12839 ms. Remains : 71/79 places, 81/89 transitions.
[2024-05-30 01:32:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:32:21] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:32:21] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 01:32:21] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:21] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4012313307436695849.gal : 0 ms
[2024-05-30 01:32:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13928941883332893715.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4012313307436695849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13928941883332893715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8319e+06,0.148225,9772,2,2098,5,19552,6,0,367,41638,0


Converting to forward existential form...Done !
original formula: A(EX((p63==1)) U EG(((EF((((p69==1)&&(p77==1))||(p5==1))) * E(((p38==1)&&(p76==1)) U !((((p15==1)&&(p21==1))&&(p30==1))))) * EG(!(((p75==...173
=> equivalent forward existential formula: [((Init * !(EG(!(EG(((E(TRUE U (((p69==1)&&(p77==1))||(p5==1))) * E(((p38==1)&&(p76==1)) U !((((p15==1)&&(p21==1...542
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t22, t28...290
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,23.7663,723192,1,0,1671,3.59142e+06,207,881,2541,6.09695e+06,1689
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 70 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 70 transition count 80
Applied a total of 18 rules in 4 ms. Remains 70 /79 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 70 cols
[2024-05-30 01:32:45] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:32:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 01:32:45] [INFO ] Invariant cache hit.
[2024-05-30 01:32:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 01:32:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/150 variables, 70/110 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/150 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/150 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 7/140 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/150 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/150 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:52] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:52] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/150 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 20 (OVERLAPS) 0/150 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 149 constraints, problems are : Problem set: 0 solved, 79 unsolved in 6909 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 70/79 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:53] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:53] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:53] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:53] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 80/150 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 79/233 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:32:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:32:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:54] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/150 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 240 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 82/82 constraints]
After SMT, in 11960ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 11961ms
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 80/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12050 ms. Remains : 70/79 places, 80/89 transitions.
[2024-05-30 01:32:57] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:32:57] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:32:57] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 01:32:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7848691141223432387.gal : 1 ms
[2024-05-30 01:32:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9342975619172156042.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7848691141223432387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9342975619172156042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.61708e+06,0.151803,10816,2,2261,5,22047,6,0,362,47378,0


Converting to forward existential form...Done !
original formula: AF((((p20==1)||(p73==1)) + ((AX((AG((p31==1)) + (p20==1))) * (p4==1)) * ((p13==1)&&(p40==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p20==1)||(p73==1)) + ((!(EX(!((!(E(TRUE U !((p31==1)))) + (p20==1))))) * (p4==1)) * ((p13==1)&&(...176
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t22, t25, t27...290
(forward)formula 0,1,1.29523,56576,1,0,445,240060,192,211,2429,361657,385
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 71 transition count 81
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 71 transition count 81
Applied a total of 16 rules in 6 ms. Remains 71 /79 variables (removed 8) and now considering 81/89 (removed 8) transitions.
// Phase 1: matrix 81 rows 71 cols
[2024-05-30 01:32:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:32:59] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:32:59] [INFO ] Invariant cache hit.
[2024-05-30 01:32:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 01:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 33 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:01] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:03] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:04] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/71 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:04] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/71 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/71 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (OVERLAPS) 81/152 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 23 (OVERLAPS) 0/152 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 162 constraints, problems are : Problem set: 0 solved, 80 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/71 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 82/91 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 81/152 variables, 71/167 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 80/247 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:07] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:33:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:33:08] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/152 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 251 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5562 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 91/91 constraints]
After SMT, in 12689ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12690ms
Starting structural reductions in LTL mode, iteration 1 : 71/79 places, 81/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12779 ms. Remains : 71/79 places, 81/89 transitions.
[2024-05-30 01:33:11] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:33:11] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:33:11] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 01:33:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16014355466127681799.gal : 0 ms
[2024-05-30 01:33:11] [INFO ] Time to serialize properties into /tmp/CTLFireability18217614679743009818.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16014355466127681799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18217614679743009818.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.78059e+06,0.155513,10564,2,2222,5,21964,6,0,367,45699,0


Converting to forward existential form...Done !
original formula: EF(!(A(!((!(AG((p77==1))) + (EX((((p55==1)&&(p60==1))&&(p68==1))) * (p53!=1)))) U EF((EX((p49==1)) + (p48==1))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(TRUE U (EX((p49==1)) + (p48==1))))) * !(!((!(!(E(TRUE U !((p77==1))))) + (EX((((p55...325
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t22, t27...285
(forward)formula 0,1,1.12173,44984,1,0,230,199348,192,110,2459,266007,226
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 70 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 60 transition count 70
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 50 transition count 60
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 50 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 56 place count 50 transition count 56
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 64 place count 46 transition count 56
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 90 place count 33 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 31 transition count 41
Applied a total of 92 rules in 18 ms. Remains 31 /79 variables (removed 48) and now considering 41/89 (removed 48) transitions.
// Phase 1: matrix 41 rows 31 cols
[2024-05-30 01:33:13] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:33:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 01:33:13] [INFO ] Invariant cache hit.
[2024-05-30 01:33:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-30 01:33:13] [INFO ] Redundant transitions in 21 ms returned [40]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 31 cols
[2024-05-30 01:33:13] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 40/71 variables, 31/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:13] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/71 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 62 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1178 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 13/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 40/71 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:14] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:15] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:33:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/71 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/71 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 0/71 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 109 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 31/31 constraints]
After SMT, in 2573ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2573ms
Starting structural reductions in SI_CTL mode, iteration 1 : 31/79 places, 40/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2691 ms. Remains : 31/79 places, 40/89 transitions.
[2024-05-30 01:33:15] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:15] [INFO ] Input system was already deterministic with 40 transitions.
[2024-05-30 01:33:15] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:15] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:33:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11520369123256118116.gal : 1 ms
[2024-05-30 01:33:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6422471771911295134.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11520369123256118116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6422471771911295134.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,17575,0.022723,4308,2,428,5,3812,6,0,167,6240,0


Converting to forward existential form...Done !
original formula: EG(EF((p42==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p42==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t23, t24, t25, t26, t27, t28, t29, t30, t31...290
(forward)formula 0,1,0.41606,22164,1,0,238,85003,107,126,1310,152916,204
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 70 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 60 transition count 70
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 51 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 51 transition count 61
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 54 place count 51 transition count 57
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 62 place count 47 transition count 57
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 88 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 32 transition count 42
Applied a total of 90 rules in 14 ms. Remains 32 /79 variables (removed 47) and now considering 42/89 (removed 47) transitions.
// Phase 1: matrix 42 rows 32 cols
[2024-05-30 01:33:16] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:33:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-30 01:33:16] [INFO ] Invariant cache hit.
[2024-05-30 01:33:16] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-30 01:33:16] [INFO ] Redundant transitions in 15 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-30 01:33:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 10 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 1/32 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:16] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 42/74 variables, 32/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/74 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/74 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (OVERLAPS) 0/74 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 65 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1397 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 42/74 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 40/105 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:33:17] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 0/74 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 106 constraints, problems are : Problem set: 0 solved, 40 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 25/25 constraints]
After SMT, in 2108ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/79 places, 42/89 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2204 ms. Remains : 32/79 places, 42/89 transitions.
[2024-05-30 01:33:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:33:18] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:18] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-30 01:33:18] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:33:18] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17284926824438531338.gal : 1 ms
[2024-05-30 01:33:18] [INFO ] Time to serialize properties into /tmp/CTLFireability449959836325274605.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17284926824438531338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability449959836325274605.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,23286,0.029333,4592,2,475,5,4636,6,0,173,7775,0


Converting to forward existential form...Done !
original formula: EF(AG((((p73==1)&&(p30==1))&&((p38==1)&&(p64==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p73==1)&&(p30==1))&&((p38==1)&&(p64==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t26, t27, t28, t29, t30, t31, t32...295
(forward)formula 0,0,0.077437,6704,1,0,126,18461,106,47,1329,19445,97
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 69 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 68 transition count 78
Applied a total of 22 rules in 4 ms. Remains 68 /79 variables (removed 11) and now considering 78/89 (removed 11) transitions.
// Phase 1: matrix 78 rows 68 cols
[2024-05-30 01:33:18] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:33:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 01:33:18] [INFO ] Invariant cache hit.
[2024-05-30 01:33:18] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:33:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:18] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:18] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:18] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:18] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 78/146 variables, 68/104 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/146 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/146 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:33:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 18 (OVERLAPS) 0/146 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 123 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5376 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/146 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 77/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:26] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/146 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/146 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 215 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4329 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 61/61 constraints]
After SMT, in 9716ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9718ms
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 78/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9823 ms. Remains : 68/79 places, 78/89 transitions.
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:33:28] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:28] [INFO ] Time to serialize gal into /tmp/CTLFireability140710824189235386.gal : 1 ms
[2024-05-30 01:33:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2608409192221434221.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability140710824189235386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2608409192221434221.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54279e+06,0.154615,10024,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.155806,10024,1,0,6,20599,7,1,443,42685,1
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 69 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 68 transition count 78
Applied a total of 22 rules in 4 ms. Remains 68 /79 variables (removed 11) and now considering 78/89 (removed 11) transitions.
[2024-05-30 01:33:28] [INFO ] Invariant cache hit.
[2024-05-30 01:33:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-30 01:33:28] [INFO ] Invariant cache hit.
[2024-05-30 01:33:28] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:33:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:28] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:28] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 3 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:29] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:30] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 78/146 variables, 68/104 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:30] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:30] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:30] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:30] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/146 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/146 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:32] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:32] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:32] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/146 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:32] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/146 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:33] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/146 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 18 (OVERLAPS) 0/146 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 123 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:33:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/146 variables, 68/136 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 77/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:36] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:36] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/146 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (OVERLAPS) 0/146 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 215 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4353 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 61/61 constraints]
After SMT, in 9677ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9678ms
Starting structural reductions in LTL mode, iteration 1 : 68/79 places, 78/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9770 ms. Remains : 68/79 places, 78/89 transitions.
[2024-05-30 01:33:38] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:33:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:38] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-30 01:33:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:38] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4825265313978768713.gal : 0 ms
[2024-05-30 01:33:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12741594946164164456.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4825265313978768713.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12741594946164164456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.54279e+06,0.145152,10020,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: AX(AG((EF((p47==0)) * EF((((p27==0)||(p38==0))||(p64==0))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U (p47==0))))] = FALSE * [(FwdU(EY(Init),TRUE) * !(E(TRUE U (((p27==0)||(p38==...182
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t21, t26, t29...275
(forward)formula 0,1,0.449181,21200,1,0,183,82393,178,83,2271,100851,172
FORMULA ShieldRVs-PT-002B-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 73 transition count 83
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 73 transition count 83
Applied a total of 12 rules in 4 ms. Remains 73 /79 variables (removed 6) and now considering 83/89 (removed 6) transitions.
// Phase 1: matrix 83 rows 73 cols
[2024-05-30 01:33:38] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:33:38] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 01:33:38] [INFO ] Invariant cache hit.
[2024-05-30 01:33:38] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-05-30 01:33:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 18/27 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:39] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:40] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:41] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:42] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:42] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 83/156 variables, 73/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:42] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:42] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:42] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (OVERLAPS) 0/156 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 154 constraints, problems are : Problem set: 0 solved, 82 unsolved in 4806 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 72/81 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:43] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:33:44] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:44] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:44] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:44] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:44] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (OVERLAPS) 83/156 variables, 73/161 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 82/243 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:45] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:33:45] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:45] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 4/247 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:46] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 3/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 250 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 86/86 constraints]
After SMT, in 10520ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 10521ms
Starting structural reductions in LTL mode, iteration 1 : 73/79 places, 83/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10619 ms. Remains : 73/79 places, 83/89 transitions.
[2024-05-30 01:33:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:33:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:33:49] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-30 01:33:49] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13841969410448754012.gal : 1 ms
[2024-05-30 01:33:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15035127109179552836.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13841969410448754012.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15035127109179552836.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.85252e+06,0.172733,11388,2,2524,5,23604,6,0,377,50844,0


Converting to forward existential form...Done !
original formula: (AF(EG((((AG((p1==1)) + E((p77==1) U (p57==1))) + (p72==0)) * (p50==1)))) + EF((((AF((EG((p19==0)) + (p71==1))) * AX((((p54==1)&&(p60==1)...258
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (((!(EG(!((EG((p19==0)) + (p71==1))))) * !(EX(!((((p54==1)&&(p60==1))&&(p68==1)))))) * ...348
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t22, t28...300
Using saturation style SCC detection
(forward)formula 0,0,4.78629,168500,1,0,612,795837,210,292,2693,1.31862e+06,613
FORMULA ShieldRVs-PT-002B-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 80
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 70 transition count 74
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 64 transition count 74
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 38 place count 54 transition count 64
Iterating global reduction 2 with 10 rules applied. Total rules applied 48 place count 54 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 54 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 52 transition count 62
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 76 place count 40 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 38 transition count 48
Applied a total of 78 rules in 18 ms. Remains 38 /79 variables (removed 41) and now considering 48/89 (removed 41) transitions.
// Phase 1: matrix 48 rows 38 cols
[2024-05-30 01:33:54] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:33:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 01:33:54] [INFO ] Invariant cache hit.
[2024-05-30 01:33:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-30 01:33:54] [INFO ] Redundant transitions in 14 ms returned []
Running 42 sub problems to find dead transitions.
[2024-05-30 01:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 6/38 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:54] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 48/86 variables, 38/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 64 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 6/38 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:55] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:56] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 9 (OVERLAPS) 48/86 variables, 38/80 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 42/122 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-30 01:33:56] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 0/86 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 123 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 34/34 constraints]
After SMT, in 2483ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2485ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/79 places, 48/89 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2599 ms. Remains : 38/79 places, 48/89 transitions.
[2024-05-30 01:33:56] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:33:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:56] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-30 01:33:56] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:56] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:33:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15930205753355748791.gal : 0 ms
[2024-05-30 01:33:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9959492138413519956.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15930205753355748791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9959492138413519956.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,118379,0.038153,5148,2,624,5,6481,6,0,203,11029,0


Converting to forward existential form...Done !
original formula: !(E(AG((!(EF(((p22==1)&&(p35==1)))) + A(E(((p69==1)&&(p80==1)) U (((p54==1)&&(p60==1))&&(p68==1))) U E((p68==1) U (((p30==1)&&(p41==1))&&...193
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !((!(E(TRUE U ((p22==1)&&(p35==1)))) + !((E(!(E((p68==1) U (((p30==1)&&(p41==1))&&(p64==1...374
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t32, t33, t34, t35, t36, t37, t38, t39...290
Using saturation style SCC detection
(forward)formula 0,1,3.05255,110528,1,0,698,539696,140,392,1544,923745,660
FORMULA ShieldRVs-PT-002B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 70 transition count 80
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 70 transition count 80
Applied a total of 18 rules in 1 ms. Remains 70 /79 variables (removed 9) and now considering 80/89 (removed 9) transitions.
// Phase 1: matrix 80 rows 70 cols
[2024-05-30 01:33:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:34:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:34:00] [INFO ] Invariant cache hit.
[2024-05-30 01:34:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 01:34:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:00] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:34:01] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:34:02] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 13/81 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 80/150 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:34:03] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:04] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/150 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 159 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4855 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 80/89 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/150 variables, 70/159 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 79/238 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:34:06] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/150 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:08] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/150 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 243 constraints, problems are : Problem set: 0 solved, 79 unsolved in 6287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 85/85 constraints]
After SMT, in 11152ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 11154ms
Starting structural reductions in LTL mode, iteration 1 : 70/79 places, 80/89 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11257 ms. Remains : 70/79 places, 80/89 transitions.
[2024-05-30 01:34:11] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:34:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:34:11] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 01:34:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:11] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:34:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3674397127233080938.gal : 0 ms
[2024-05-30 01:34:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3373883740759514404.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3674397127233080938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3373883740759514404.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.75663e+06,0.145077,10560,2,2178,5,21699,6,0,362,45142,0


Converting to forward existential form...Done !
original formula: EX(!(E(!(((p66==1)&&(p80==1))) U ((!(E((p23==1) U (p48==1))) * AG((((p11==1)&&(p52==1))&&(p79==1)))) * (((p52!=1)||(p51==1))||(p6==1)))))...156
=> equivalent forward existential formula: [(EY(Init) * !(E(!(((p66==1)&&(p80==1))) U ((!(E((p23==1) U (p48==1))) * !(E(TRUE U !((((p11==1)&&(p52==1))&&(p7...213
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t22, t27...285
(forward)formula 0,1,0.530791,24324,1,0,189,97848,190,84,2407,116653,173
FORMULA ShieldRVs-PT-002B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 79/79 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 78 transition count 79
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 69 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 59 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 48 place count 49 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 49 transition count 59
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 58 place count 49 transition count 55
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 66 place count 45 transition count 55
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 92 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 30 transition count 40
Applied a total of 94 rules in 7 ms. Remains 30 /79 variables (removed 49) and now considering 40/89 (removed 49) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-05-30 01:34:11] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:34:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-30 01:34:11] [INFO ] Invariant cache hit.
[2024-05-30 01:34:11] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-30 01:34:11] [INFO ] Redundant transitions in 19 ms returned [39]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2024-05-30 01:34:11] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:11] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:34:11] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 1/30 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 39/69 variables, 30/52 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:12] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/69 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/69 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 0/69 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 68 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1468 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 1/30 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 39/69 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 38/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:34:13] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 108 constraints, problems are : Problem set: 0 solved, 38 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 31/31 constraints]
After SMT, in 2135ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2139ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/79 places, 39/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2229 ms. Remains : 30/79 places, 39/89 transitions.
[2024-05-30 01:34:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:34:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:34:14] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 01:34:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:34:14] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:34:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8537802668737024209.gal : 1 ms
[2024-05-30 01:34:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16528365504761480687.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8537802668737024209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16528365504761480687.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,14554,0.024966,4304,2,406,5,3773,6,0,162,6130,0


Converting to forward existential form...Done !
original formula: EG((((p54==0)||(p60==0))||(p69==0)))
=> equivalent forward existential formula: [FwdG(Init,(((p54==0)||(p60==0))||(p69==0)))] != FALSE
Hit Full ! (commute/partial/dont) 28/0/11
(forward)formula 0,1,0.087477,7208,1,0,24,16044,19,4,942,20947,22
FORMULA ShieldRVs-PT-002B-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-30 01:34:14] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:34:14] [INFO ] Flatten gal took : 2 ms
Total runtime 278831 ms.

BK_STOP 1717032854183

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldRVs-PT-002B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-002B, examination is CTLFireability"
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-171683761700730"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-002B.tgz
mv ShieldRVs-PT-002B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;