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-171683761700729.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700729
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVs-PT-002B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717032562159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-30 01:29:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:29:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:29:23] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-30 01:29:23] [INFO ] Transformed 83 places.
[2024-05-30 01:29:23] [INFO ] Transformed 93 transitions.
[2024-05-30 01:29:23] [INFO ] Found NUPN structural information;
[2024-05-30 01:29:23] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 81 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 91
Applied a total of 4 rules in 26 ms. Remains 81 /83 variables (removed 2) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 81 cols
[2024-05-30 01:29:23] [INFO ] Computed 9 invariants in 7 ms
[2024-05-30 01:29:23] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 01:29:23] [INFO ] Invariant cache hit.
[2024-05-30 01:29:23] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-05-30 01:29:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 16 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:29:24] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 3 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 8 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 3 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:25] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:29:26] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 2 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:27] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:29:28] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:29:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 91/172 variables, 81/191 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 28 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:29:30] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:29:31] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:29:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:31] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:31] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:31] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:29:31] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/172 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (OVERLAPS) 0/172 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 205 constraints, problems are : Problem set: 0 solved, 90 unsolved in 8726 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:33] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:33] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 91/172 variables, 81/208 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 90/298 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:34] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:36] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:37] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/306 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:39] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 22 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 36 ms of which 1 ms to minimize.
[2024-05-30 01:29:44] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/172 variables, 4/312 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:46] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:29:46] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/172 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:49] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/172 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:29:51] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:29:51] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:29:51] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/172 variables, 4/319 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 2 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:29:53] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/172 variables, 8/327 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:54] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:29:54] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:29:57] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:29:57] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:29:57] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:29:57] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:29:57] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-30 01:30:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/172 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 172/172 variables, and 335 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 155/155 constraints]
After SMT, in 38784ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 38801ms
Starting structural reductions in LTL mode, iteration 1 : 81/83 places, 91/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39145 ms. Remains : 81/83 places, 91/93 transitions.
Support contains 53 out of 81 places after structural reductions.
[2024-05-30 01:30:02] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-30 01:30:02] [INFO ] Flatten gal took : 29 ms
FORMULA ShieldRVs-PT-002B-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:30:02] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:30:02] [INFO ] Input system was already deterministic with 91 transitions.
Support contains 43 out of 81 places (down from 53) after GAL structural reductions.
RANDOM walk for 40000 steps (362 resets) in 1560 ms. (25 steps per ms) remains 3/39 properties
BEST_FIRST walk for 40002 steps (97 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (102 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
[2024-05-30 01:30:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/71 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/81 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/172 variables, 81/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/172 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 90 constraints, problems are : Problem set: 1 solved, 2 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/71 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/81 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/172 variables, 81/102 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 2/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/172 variables, 3/107 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/172 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/172 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 110 constraints, problems are : Problem set: 1 solved, 2 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 18/18 constraints]
After SMT, in 839ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 218 ms.
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 91/91 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 81 transition count 85
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 75 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 74 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 14 place count 74 transition count 77
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 28 place count 67 transition count 77
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 37 place count 58 transition count 68
Iterating global reduction 3 with 9 rules applied. Total rules applied 46 place count 58 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 58 transition count 65
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 55 transition count 65
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 80 place count 41 transition count 51
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 84 place count 41 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 40 transition count 50
Applied a total of 85 rules in 42 ms. Remains 40 /81 variables (removed 41) and now considering 50/91 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 40/81 places, 50/91 transitions.
RANDOM walk for 40000 steps (551 resets) in 254 ms. (156 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (145 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
// Phase 1: matrix 50 rows 40 cols
[2024-05-30 01:30:04] [INFO ] Computed 9 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/68 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 17/85 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/89 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/90 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/90 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 49 constraints, problems are : Problem set: 0 solved, 1 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/27 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/68 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 17/85 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/89 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/90 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/90 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/90 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 54 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 50/50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 49
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 39 transition count 46
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 8 place count 36 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 14 place count 33 transition count 43
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 33 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 32 transition count 42
Applied a total of 17 rules in 8 ms. Remains 32 /40 variables (removed 8) and now considering 42/50 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 32/40 places, 42/50 transitions.
RANDOM walk for 40000 steps (774 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (196 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Probably explored full state space saw : 14665 states, properties seen :0
Probabilistic random walk after 71215 steps, saw 14665 distinct states, run finished after 80 ms. (steps per millisecond=890 ) properties seen :0
Explored full state space saw : 14665 states, properties seen :0
Exhaustive walk after 71215 steps, saw 14665 distinct states, run finished after 37 ms. (steps per millisecond=1924 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-05-30 01:30:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:30:05] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:30:05] [INFO ] Input system was already deterministic with 91 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 83
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 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 14 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 32 place count 64 transition count 74
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 44 place count 52 transition count 62
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 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 2 with 6 rules applied. Total rules applied 62 place count 49 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 90 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 33 transition count 43
Applied a total of 92 rules in 13 ms. Remains 33 /81 variables (removed 48) and now considering 43/91 (removed 48) transitions.
// Phase 1: matrix 43 rows 33 cols
[2024-05-30 01:30:05] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:30:05] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:30:05] [INFO ] Invariant cache hit.
[2024-05-30 01:30:05] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-30 01:30:05] [INFO ] Redundant transitions in 22 ms returned [42]
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 40 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 33 cols
[2024-05-30 01:30:05] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:05] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 42/75 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:06] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/75 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 0/75 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 70 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 42/75 variables, 33/72 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 40/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:30:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/75 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/75 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 0/75 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 113 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 31/31 constraints]
After SMT, in 2637ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2638ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/81 places, 42/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 2761 ms. Remains : 33/81 places, 42/91 transitions.
[2024-05-30 01:30:08] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:30:08] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-30 01:30:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:30:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:30:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13880872075037843094.gal : 2 ms
[2024-05-30 01:30:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality10974037259894655434.ctl : 9 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/CTLCardinality13880872075037843094.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10974037259894655434.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,26819,0.039577,4488,2,444,5,4086,6,0,177,7054,0


Converting to forward existential form...Done !
original formula: EF(EG(A((p17==1) U ((p66==0)||(p81==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((E(!(((p66==0)||(p81==1))) U (!((p17==1)) * !(((p66==0)||(p81==1))))) + EG(!(((p66==0)||...179
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t25, t26, t27, t28, t29, t30, t31, t32, t33...290
(forward)formula 0,1,0.262803,13452,1,0,275,52641,115,105,1356,73183,278
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-01 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 : 81/81 places, 91/91 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 71 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 70 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 70 transition count 80
Applied a total of 22 rules in 12 ms. Remains 70 /81 variables (removed 11) and now considering 80/91 (removed 11) transitions.
// Phase 1: matrix 80 rows 70 cols
[2024-05-30 01:30:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:30:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 01:30:08] [INFO ] Invariant cache hit.
[2024-05-30 01:30:08] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-05-30 01:30:08] [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:30:08] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:08] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:30:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 80/150 variables, 70/107 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:10] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 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:11] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:11] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 9/129 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:30:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:12] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/150 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:13] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 16 (OVERLAPS) 0/150 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 133 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5390 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 54/54 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, 54/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:14] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:14] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:30:14] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/150 variables, 70/136 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 79/215 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:14] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:14] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[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 19 places in 24 ms of which 1 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 24 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:17] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/150 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 225 constraints, problems are : Problem set: 0 solved, 79 unsolved in 6006 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 67/67 constraints]
After SMT, in 11410ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 11411ms
Starting structural reductions in LTL mode, iteration 1 : 70/81 places, 80/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11533 ms. Remains : 70/81 places, 80/91 transitions.
[2024-05-30 01:30:19] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:30:19] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:30:19] [INFO ] Input system was already deterministic with 80 transitions.
[2024-05-30 01:30:19] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:19] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:30:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality11711360987887466393.gal : 2 ms
[2024-05-30 01:30:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality2292941493266625660.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/CTLCardinality11711360987887466393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2292941493266625660.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.68962e+06,0.151306,10264,2,2058,5,21222,6,0,362,44151,0


Converting to forward existential form...Done !
original formula: AG((EF(((AX(((p12==0)&&(p3==1))) * (p63==0)) * (p46==1))) + AG(EF((p79==0)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(E(TRUE U ((!(EX(!(((p12==0)&&(p3==1))))) * (p63==0)) * (p46==1))))),TRUE) * !(E(TRUE...178
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...285
(forward)formula 0,1,0.525346,22316,1,0,190,87996,181,85,2333,110937,173
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-02 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 : 81/81 places, 91/91 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 80 transition count 81
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 71 transition count 81
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 71 transition count 71
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 61 transition count 71
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 49 place count 50 transition count 60
Iterating global reduction 2 with 11 rules applied. Total rules applied 60 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 60 place count 50 transition count 56
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 46 transition count 56
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 96 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 98 place count 30 transition count 40
Applied a total of 98 rules in 14 ms. Remains 30 /81 variables (removed 51) and now considering 40/91 (removed 51) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-05-30 01:30:20] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:30:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:30:20] [INFO ] Invariant cache hit.
[2024-05-30 01:30:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-30 01:30:20] [INFO ] Redundant transitions in 16 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:30:20] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:20] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/69 variables, 30/54 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 59 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:21] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:22] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 105 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 28/28 constraints]
After SMT, in 2163ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2164ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/81 places, 39/91 transitions.
Applied a total of 0 rules in 4 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 2276 ms. Remains : 30/81 places, 39/91 transitions.
[2024-05-30 01:30:22] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:22] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:22] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 741 steps (18 resets) in 8 ms. (82 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 01:30:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:30:22] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:30:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality150708490370445082.gal : 1 ms
[2024-05-30 01:30:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8221680061476642521.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality150708490370445082.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8221680061476642521.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 4 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
// Phase 1: matrix 78 rows 68 cols
[2024-05-30 01:30:22] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:30:22] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 01:30:22] [INFO ] Invariant cache hit.
[2024-05-30 01:30:22] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:30:22] [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:30:23] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 3 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 12 places in 28 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:30:23] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:23] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:24] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:24] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:24] [INFO ] Deduced a trap composed of 25 places in 27 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:30:24] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 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:30:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:30:25] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:30:25] [INFO ] Deduced a trap composed of 15 places in 25 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:30:25] [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:30:25] [INFO ] Deduced a trap composed of 20 places in 20 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:30:26] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:26] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:26] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:26] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:26] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 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:30:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:30:26] [INFO ] Deduced a trap composed of 29 places in 29 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:30:26] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:26] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:27] [INFO ] Deduced a trap composed of 22 places in 32 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:30:27] [INFO ] Deduced a trap composed of 21 places in 35 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:30:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:27] [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 5368 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:30:28] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 15 places in 29 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:30:28] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:28] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:29] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 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:30:29] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:30:29] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 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:30:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:30] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 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 4164 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 9545ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9546ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 78/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9631 ms. Remains : 68/81 places, 78/91 transitions.
[2024-05-30 01:30:32] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:30:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:30:32] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-30 01:30:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:32] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15408473200144130946.gal : 2 ms
[2024-05-30 01:30:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16922118290037749784.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/CTLCardinality15408473200144130946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16922118290037749784.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.54279e+06,0.140416,9988,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: AX(EG((p16==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((p16==0))))] = FALSE
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,0,8.01474,280032,1,0,999,1.32459e+06,178,412,2299,2.45991e+06,1089
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 14 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
[2024-05-30 01:30:40] [INFO ] Invariant cache hit.
[2024-05-30 01:30:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:30:40] [INFO ] Invariant cache hit.
[2024-05-30 01:30:40] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:30:40] [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:30:40] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:40] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 12 places in 32 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:30:41] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:41] [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:30:42] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 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:30:42] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:30:42] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:42] [INFO ] Deduced a trap composed of 15 places in 22 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:30:43] [INFO ] Deduced a trap composed of 22 places in 22 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:30:43] [INFO ] Deduced a trap composed of 20 places in 30 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:30:43] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:30:43] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:43] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:43] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 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:30:44] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:44] [INFO ] Deduced a trap composed of 29 places in 29 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:30:44] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:30:44] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:44] [INFO ] Deduced a trap composed of 22 places in 30 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:30:44] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 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:30:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:45] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 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 5203 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:30:46] [INFO ] Deduced a trap composed of 31 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 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:30:46] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 25 places in 26 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:30:46] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:46] [INFO ] Deduced a trap composed of 23 places in 26 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:30:48] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:48] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 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 4244 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 9459ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9460ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 78/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9554 ms. Remains : 68/81 places, 78/91 transitions.
[2024-05-30 01:30:50] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:30:50] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:50] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-30 01:30:50] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:50] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:30:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality11567700458327764970.gal : 2 ms
[2024-05-30 01:30:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11163835785887309962.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/CTLCardinality11567700458327764970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11163835785887309962.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.54279e+06,0.137556,9988,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: EF(EG(AX((p0==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!((p0==0)))))] != FALSE
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.709452,31196,1,0,263,123056,177,82,2416,170315,253
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 73 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 73 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 72 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 72 transition count 82
Applied a total of 18 rules in 18 ms. Remains 72 /81 variables (removed 9) and now considering 82/91 (removed 9) transitions.
// Phase 1: matrix 82 rows 72 cols
[2024-05-30 01:30:50] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:30:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:30:50] [INFO ] Invariant cache hit.
[2024-05-30 01:30:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-30 01:30:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 3 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 19 places in 31 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 6 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 20 places in 35 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 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:30:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 82/154 variables, 72/125 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:30:53] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:54] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/154 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 136 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3924 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 55/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 82/154 variables, 72/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 81/224 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:56] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:30:56] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:30:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/154 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 228 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5534 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 66/66 constraints]
After SMT, in 9470ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 9471ms
Starting structural reductions in LTL mode, iteration 1 : 72/81 places, 82/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9578 ms. Remains : 72/81 places, 82/91 transitions.
[2024-05-30 01:31:00] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:31:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:31:00] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-30 01:31:00] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:00] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:31:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality9426761174359554194.gal : 2 ms
[2024-05-30 01:31:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality6191475905325663447.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/CTLCardinality9426761174359554194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6191475905325663447.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,3.23792e+06,0.183138,11856,2,2587,5,24568,6,0,372,55292,0


Converting to forward existential form...Done !
original formula: A(E(EF((((AF((p51==1)) + (p75==0)) + ((p6==1)||(p58==0))) + ((p31==1)||(!((p58==0)||(p39==1)))))) U (!(AF((p1==1))) * ((p13==0) + A(!(((p...256
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((E(!(!(EX(!(!(E(TRUE U !(((p2==0)||(p58==1))))))))) U (!(!(EG(!(EX(((p28==0)||(p22==1)))))...953
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, t19, t20...300
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 01:31:30] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:31:30] [INFO ] Applying decomposition
[2024-05-30 01:31:30] [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/graph8371904815830487360.txt' '-o' '/tmp/graph8371904815830487360.bin' '-w' '/tmp/graph8371904815830487360.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8371904815830487360.bin' '-l' '-1' '-v' '-w' '/tmp/graph8371904815830487360.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:31:30] [INFO ] Decomposing Gal with order
[2024-05-30 01:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:31:30] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-30 01:31:30] [INFO ] Flatten gal took : 31 ms
[2024-05-30 01:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 01:31:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9859892118789494260.gal : 2 ms
[2024-05-30 01:31:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality18155560895595634654.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/CTLCardinality9859892118789494260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18155560895595634654.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 -...263
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,3.23792e+06,0.138165,9676,513,58,11205,341,253,23817,57,1233,0


Converting to forward existential form...Done !
original formula: A(E(EF((((AF((i5.i1.u16.p51==1)) + (i7.u23.p75==0)) + ((i2.u2.p6==1)||(i5.i0.u18.p58==0))) + ((i4.u10.p31==1)||(!((i5.i0.u18.p58==0)||(u1...379
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((E(!(!(EX(!(!(E(TRUE U !(((i0.u1.p2==0)||(i5.i0.u18.p58==1))))))))) U (!(!(EG(!(EX(((i4.u9...1246
Reverse transition relation is NOT exact ! Due to transitions u12.t7, u12.t8, u12.t9, u12.t10, i0.u1.t54, i2.u11.t41, i3.i1.u4.t51, i3.i1.u5.t0, i3.i1.u5.t...514
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
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,5.12552,197908,1,0,329137,776,1570,684746,304,2824,378391
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 71 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 71 transition count 81
Applied a total of 20 rules in 7 ms. Remains 71 /81 variables (removed 10) and now considering 81/91 (removed 10) transitions.
// Phase 1: matrix 81 rows 71 cols
[2024-05-30 01:31:35] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:31:35] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-30 01:31:35] [INFO ] Invariant cache hit.
[2024-05-30 01:31:35] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-05-30 01:31:35] [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:36] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 19 places in 22 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:31:36] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:31:36] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:31:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 30 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:31:38] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:31:39] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 81/152 variables, 71/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:40] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:31:40] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:31:40] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/152 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:40] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 16 (OVERLAPS) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 152 constraints, problems are : Problem set: 0 solved, 80 unsolved in 5623 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 72/72 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, 72/81 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:41] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:31:41] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:31:42] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:43] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:31:43] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:31:43] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:31:43] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:31:43] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:31:43] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 81/152 variables, 71/172 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 80/252 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:31:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/152 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/152 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:31:48] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/152 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-30 01:31:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/152 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 19 (OVERLAPS) 0/152 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 258 constraints, problems are : Problem set: 0 solved, 80 unsolved in 10856 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 98/98 constraints]
After SMT, in 16490ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 16491ms
Starting structural reductions in LTL mode, iteration 1 : 71/81 places, 81/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16594 ms. Remains : 71/81 places, 81/91 transitions.
[2024-05-30 01:31:52] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:31:52] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:31:52] [INFO ] Input system was already deterministic with 81 transitions.
[2024-05-30 01:31:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:31:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:31:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11576897796603124218.gal : 1 ms
[2024-05-30 01:31:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4646369622070396590.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/CTLCardinality11576897796603124218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4646369622070396590.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,3.07676e+06,0.177348,11088,2,2445,5,22864,6,0,367,51521,0


Converting to forward existential form...Done !
original formula: EG(AX((!(A(A((p22==0) U (p39==0)) U !(((p20==0)||(p76==1))))) + EF(EG((p6==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(!((E(!(!(((p20==0)||(p76==1)))) U (!(!((E(!((p39==0)) U (!((p22==0)) * !((p39==0)))) + EG(!...275
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, t19, t23...295
Detected timeout of ITS tools.
[2024-05-30 01:32:22] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:32:22] [INFO ] Applying decomposition
[2024-05-30 01:32:22] [INFO ] Flatten gal took : 8 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/graph5232690340819984311.txt' '-o' '/tmp/graph5232690340819984311.bin' '-w' '/tmp/graph5232690340819984311.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5232690340819984311.bin' '-l' '-1' '-v' '-w' '/tmp/graph5232690340819984311.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:32:22] [INFO ] Decomposing Gal with order
[2024-05-30 01:32:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:32:22] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-30 01:32:22] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:32:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:32:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5931385447170475766.gal : 2 ms
[2024-05-30 01:32:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality3569475825800460286.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/CTLCardinality5931385447170475766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3569475825800460286.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,3.07676e+06,0.103783,8340,529,48,9243,293,239,17797,53,989,0


Converting to forward existential form...Done !
original formula: EG(AX((!(A(A((i1.u7.p22==0) U (u12.p39==0)) U !(((i1.u7.p20==0)||(u23.p76==1))))) + EF(EG((i2.i1.u2.p6==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(!((E(!(!(((i1.u7.p20==0)||(u23.p76==1)))) U (!(!((E(!((u12.p39==0)) U (!((i1.u7.p22==0)) * ...332
Reverse transition relation is NOT exact ! Due to transitions u12.t6, u12.t7, u12.t8, u12.t9, u23.t16, u23.t17, u23.t18, u23.t19, i0.u4.t50, i0.u5.t0, i0.u...465
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
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,1,4.66663,204492,1,0,425072,615,1382,629709,277,2234,478277
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 72 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 72 transition count 82
Applied a total of 18 rules in 1 ms. Remains 72 /81 variables (removed 9) and now considering 82/91 (removed 9) transitions.
// Phase 1: matrix 82 rows 72 cols
[2024-05-30 01:32:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:32:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 01:32:27] [INFO ] Invariant cache hit.
[2024-05-30 01:32:27] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-30 01:32:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:27] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 16/25 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:28] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:29] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:30] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 82/154 variables, 72/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/154 variables, 7/149 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:31] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:32] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/154 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:32] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:32:33] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:33] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:33] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/154 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/154 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 20 (OVERLAPS) 0/154 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 156 constraints, problems are : Problem set: 0 solved, 81 unsolved in 6794 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 82/154 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 81/237 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-30 01:32:35] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:35] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:35] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/154 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 240 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 78/78 constraints]
After SMT, in 10471ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10472ms
Starting structural reductions in LTL mode, iteration 1 : 72/81 places, 82/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10562 ms. Remains : 72/81 places, 82/91 transitions.
[2024-05-30 01:32:37] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:32:37] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:32:37] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-30 01:32:37] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:32:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13404691293824526563.gal : 1 ms
[2024-05-30 01:32:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11703768844870189819.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/CTLCardinality13404691293824526563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11703768844870189819.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.76337e+06,0.166247,10832,2,2422,5,22701,6,0,372,47454,0


Converting to forward existential form...Done !
original formula: !(E(((p10==0)||(p42==1)) U ((AF((p14==0)) * (EX((((p12==0)||(p57==1))&&((p60==0)||(p56==1)))) + !(EG((p40==0))))) + (!(AF((p41==0))) * EF...169
=> equivalent forward existential formula: (([(EY((FwdU(Init,((p10==0)||(p42==1))) * !(EG(!((p14==0)))))) * (((p12==0)||(p57==1))&&((p60==0)||(p56==1))))] ...345
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...290
Hit Full ! (commute/partial/dont) 75/0/7
(forward)formula 0,0,4.30048,159972,1,0,761,755664,196,304,2622,1.19219e+06,809
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 81/81 places, 91/91 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 80 transition count 82
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 72 transition count 82
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 72 transition count 72
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 62 transition count 72
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 52 transition count 62
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 56 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 2 with 6 rules applied. Total rules applied 62 place count 49 transition count 59
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 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 94 place count 32 transition count 42
Applied a total of 94 rules in 10 ms. Remains 32 /81 variables (removed 49) and now considering 42/91 (removed 49) transitions.
// Phase 1: matrix 42 rows 32 cols
[2024-05-30 01:32:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:32:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 01:32:42] [INFO ] Invariant cache hit.
[2024-05-30 01:32:42] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-30 01:32:42] [INFO ] Redundant transitions in 13 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 40 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 32 cols
[2024-05-30 01:32:42] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 41/73 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 64 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 23/23 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, 23/31 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 1/32 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/73 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 40/104 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:43] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:44] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 01:32:44] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 112 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 31/31 constraints]
After SMT, in 2335ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 2336ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/81 places, 41/91 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 2423 ms. Remains : 32/81 places, 41/91 transitions.
[2024-05-30 01:32:44] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:32:44] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:44] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-30 01:32:44] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:32:44] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:32:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9760594990766196608.gal : 1 ms
[2024-05-30 01:32:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality8169635865256985304.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/CTLCardinality9760594990766196608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8169635865256985304.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,14972,0.022821,4584,2,467,5,3877,6,0,171,5841,0


Converting to forward existential form...Done !
original formula: EG(((p53==0)||(p71==1)))
=> equivalent forward existential formula: [FwdG(Init,((p53==0)||(p71==1)))] != FALSE
Hit Full ! (commute/partial/dont) 36/0/5
(forward)formula 0,1,0.074047,6432,1,0,23,13675,19,4,1022,13670,22
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 70 transition count 80
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 70 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 69 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 69 transition count 79
Applied a total of 24 rules in 5 ms. Remains 69 /81 variables (removed 12) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 69 cols
[2024-05-30 01:32:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:32:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 01:32:44] [INFO ] Invariant cache hit.
[2024-05-30 01:32:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-30 01:32:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:45] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 19 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 22 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 24 places in 32 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 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:32:46] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:32:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 79/148 variables, 69/128 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:48] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 132 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/148 variables, 69/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 78/214 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/148 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-30 01:32:51] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 0/148 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 218 constraints, problems are : Problem set: 0 solved, 78 unsolved in 5621 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 62/62 constraints]
After SMT, in 9676ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 9676ms
Starting structural reductions in LTL mode, iteration 1 : 69/81 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9756 ms. Remains : 69/81 places, 79/91 transitions.
[2024-05-30 01:32:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:32:54] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:32:54] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-30 01:32:54] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:32:54] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:32:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6842228771019414837.gal : 1 ms
[2024-05-30 01:32:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15450711336350568880.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/CTLCardinality6842228771019414837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15450711336350568880.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.7186e+06,0.155759,10548,2,2097,5,21948,6,0,357,46685,0


Converting to forward existential form...Done !
original formula: AX((EX(AF(((p39==0)||(p41==1)))) * (p1==0)))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(EG(!(((p39==0)||(p41==1))))))))] = FALSE * [(EY(Init) * !((p1==0)))] = FALSE)
(forward)formula 0,0,0.158314,10812,1,0,8,21948,9,2,452,46685,2
FORMULA ShieldRVs-PT-002B-CTLCardinality-2024-11 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 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 2 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
// Phase 1: matrix 78 rows 68 cols
[2024-05-30 01:32:54] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:32:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:32:54] [INFO ] Invariant cache hit.
[2024-05-30 01:32:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:32:54] [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:32:55] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 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:32:55] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:32:55] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 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:32:56] [INFO ] Deduced a trap composed of 10 places in 25 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:32:56] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:32:56] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:56] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:57] [INFO ] Deduced a trap composed of 15 places in 26 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:32:57] [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:32:57] [INFO ] Deduced a trap composed of 20 places in 30 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:32:57] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:32:57] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:32:58] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:32:58] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:32:58] [INFO ] Deduced a trap composed of 18 places in 26 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:32:58] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:32:58] [INFO ] Deduced a trap composed of 29 places in 33 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:32:58] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:32:58] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:32:58] [INFO ] Deduced a trap composed of 22 places in 32 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:32:59] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 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:32:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:32:59] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 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 5260 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:00] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 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 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:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 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 4 (INCLUDED_ONLY) 0/68 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:00] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 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:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:02] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 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 4305 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 9575ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9576ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 78/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9684 ms. Remains : 68/81 places, 78/91 transitions.
[2024-05-30 01:33:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:33:04] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:33:04] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-30 01:33:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1325652177762175167.gal : 1 ms
[2024-05-30 01:33:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7063041587888847196.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/CTLCardinality1325652177762175167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7063041587888847196.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.54279e+06,0.135771,10020,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: EF((EX((p66==1)) + ((p40==0)&&(p35==1))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * (p66==1))] != FALSE + [(FwdU(Init,TRUE) * ((p40==0)&&(p35==1)))] != FALSE)
(forward)formula 0,1,0.153703,10284,1,0,8,20599,8,1,613,42685,2
FORMULA ShieldRVs-PT-002B-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 1 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
[2024-05-30 01:33:04] [INFO ] Invariant cache hit.
[2024-05-30 01:33:04] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 01:33:04] [INFO ] Invariant cache hit.
[2024-05-30 01:33:04] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:33:04] [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:05] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 12 places in 28 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:05] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:05] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 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:06] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 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:06] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:33:07] [INFO ] Deduced a trap composed of 15 places in 27 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:07] [INFO ] Deduced a trap composed of 22 places in 26 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:07] [INFO ] Deduced a trap composed of 20 places in 29 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:07] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:07] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:07] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:33:08] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:08] [INFO ] Deduced a trap composed of 18 places in 25 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:08] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:33:08] [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:08] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:33:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:08] [INFO ] Deduced a trap composed of 22 places in 33 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:08] [INFO ] Deduced a trap composed of 21 places in 23 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:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:33:09] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 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 5331 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:10] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 15 places in 25 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:10] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:10] [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:10] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 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:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:12] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 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 4209 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 9552ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9553ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 78/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9755 ms. Remains : 68/81 places, 78/91 transitions.
[2024-05-30 01:33:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:33:14] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:33:14] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-30 01:33:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:14] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality9285152556463914908.gal : 0 ms
[2024-05-30 01:33:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11217525744732521613.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/CTLCardinality9285152556463914908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11217525744732521613.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.143368,10020,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: EF(AX(EG(AF((p54==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!(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, t13, t14, t15, t16, t17, t21, t26, t29...275
(forward)formula 0,1,4.68408,169936,1,0,735,793626,185,298,2364,1.25714e+06,807
FORMULA ShieldRVs-PT-002B-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 91/91 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 69 transition count 79
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 69 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 68 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 68 transition count 78
Applied a total of 26 rules in 2 ms. Remains 68 /81 variables (removed 13) and now considering 78/91 (removed 13) transitions.
[2024-05-30 01:33:19] [INFO ] Invariant cache hit.
[2024-05-30 01:33:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 01:33:19] [INFO ] Invariant cache hit.
[2024-05-30 01:33:19] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-30 01:33:19] [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:19] [INFO ] Deduced a trap composed of 15 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 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 4 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:33:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 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:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 5 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:33:20] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 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 35 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:21] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:33:21] [INFO ] Deduced a trap composed of 15 places in 29 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 0 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:22] [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:22] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 18 places in 27 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 33 ms of which 0 ms to minimize.
[2024-05-30 01:33:22] [INFO ] Deduced a trap composed of 29 places in 29 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:23] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:33:23] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:23] [INFO ] Deduced a trap composed of 22 places in 30 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:23] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 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 35 ms of which 1 ms to minimize.
[2024-05-30 01:33:23] [INFO ] Deduced a trap composed of 21 places in 24 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 5251 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 32 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 15 places in 23 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 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:33:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:25] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:33:25] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:33:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:33:25] [INFO ] Deduced a trap composed of 25 places in 25 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:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:33:25] [INFO ] Deduced a trap composed of 23 places in 30 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 33 ms of which 1 ms to minimize.
[2024-05-30 01:33:26] [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 4268 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 9528ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 9529ms
Starting structural reductions in LTL mode, iteration 1 : 68/81 places, 78/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9612 ms. Remains : 68/81 places, 78/91 transitions.
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 2 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 : 2 ms
[2024-05-30 01:33:28] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:33:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1098844316648436566.gal : 1 ms
[2024-05-30 01:33:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality16661326670392908256.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/CTLCardinality1098844316648436566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16661326670392908256.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.146971,10020,2,1963,5,20599,6,0,352,42685,0


Converting to forward existential form...Done !
original formula: AF((!(A(!(((EX((p21==1)) + (p42==0)) + (p29==1))) U (EX(TRUE) * AG((p15==1))))) * (p21==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(!((E(!((EX(TRUE) * !(E(TRUE U !((p15==1)))))) U (!(!(((EX((p21==1)) + (p42==0)) + (p29==1)))) * ...270
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,4.21912,155888,1,0,665,708209,188,341,2372,1.12388e+06,634
FORMULA ShieldRVs-PT-002B-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 01:33:32] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:33:32] [INFO ] Flatten gal took : 3 ms
Total runtime 249672 ms.

BK_STOP 1717032813025

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-171683761700729"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;