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.r092-tall-171624189600609.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 DES-PT-00b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189600609
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 66K May 18 16:42 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 DES-PT-00b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-00b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-00b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-00b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-00b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-00b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334787188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:39:48] [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-21 23:39:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:39:48] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-21 23:39:48] [INFO ] Transformed 271 places.
[2024-05-21 23:39:48] [INFO ] Transformed 230 transitions.
[2024-05-21 23:39:48] [INFO ] Found NUPN structural information;
[2024-05-21 23:39:48] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 97 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 256 transition count 217
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 256 transition count 217
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 251 transition count 212
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 251 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 251 transition count 207
Applied a total of 43 rules in 57 ms. Remains 251 /271 variables (removed 20) and now considering 207/230 (removed 23) transitions.
// Phase 1: matrix 207 rows 251 cols
[2024-05-21 23:39:48] [INFO ] Computed 57 invariants in 22 ms
[2024-05-21 23:39:49] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-21 23:39:49] [INFO ] Invariant cache hit.
[2024-05-21 23:39:49] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
Running 206 sub problems to find dead transitions.
[2024-05-21 23:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 9 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:52] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:39:53] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:39:55] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:39:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:39:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:39:58] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:59] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 10 (OVERLAPS) 207/458 variables, 251/358 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:40:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 6/364 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 3 ms to minimize.
[2024-05-21 23:40:04] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/458 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:12] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/458 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/458 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 458/458 variables, and 373 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/251 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 65/122 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 207/458 variables, 251/373 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 206/579 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 4/583 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/458 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 584 constraints, problems are : Problem set: 0 solved, 206 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 70/70 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 251/271 places, 207/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60936 ms. Remains : 251/271 places, 207/230 transitions.
Support contains 97 out of 251 places after structural reductions.
[2024-05-21 23:40:49] [INFO ] Flatten gal took : 38 ms
[2024-05-21 23:40:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-00b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:40:49] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:40:49] [INFO ] Input system was already deterministic with 207 transitions.
Support contains 87 out of 251 places (down from 97) after GAL structural reductions.
RANDOM walk for 40000 steps (365 resets) in 1441 ms. (27 steps per ms) remains 1/57 properties
BEST_FIRST walk for 40003 steps (74 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
[2024-05-21 23:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/188 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 222/458 variables, and 57 constraints, problems are : Problem set: 1 solved, 0 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/251 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 162ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-21 23:40:50] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:40:50] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:40:50] [INFO ] Input system was already deterministic with 207 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 451 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 240 transition count 196
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 240 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 240 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 235 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 235 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 235 transition count 186
Applied a total of 37 rules in 20 ms. Remains 235 /251 variables (removed 16) and now considering 186/207 (removed 21) transitions.
// Phase 1: matrix 186 rows 235 cols
[2024-05-21 23:40:50] [INFO ] Computed 57 invariants in 5 ms
[2024-05-21 23:40:50] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 23:40:50] [INFO ] Invariant cache hit.
[2024-05-21 23:40:50] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-21 23:40:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 186/421 variables, 235/328 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 6/334 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 3/339 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 15 (OVERLAPS) 0/421 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 339 constraints, problems are : Problem set: 0 solved, 185 unsolved in 18725 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 186/421 variables, 235/344 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 185/529 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:19] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:26] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:41:26] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/421 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-21 23:41:39] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 534 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 57/57 constraints]
After SMT, in 48758ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 48762ms
Starting structural reductions in LTL mode, iteration 1 : 235/251 places, 186/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49071 ms. Remains : 235/251 places, 186/207 transitions.
[2024-05-21 23:41:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:41:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:39] [INFO ] Input system was already deterministic with 186 transitions.
[2024-05-21 23:41:39] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:41:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:41:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality9150103027021707314.gal : 4 ms
[2024-05-21 23:41:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality13154899148603077730.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9150103027021707314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13154899148603077730.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.
Detected timeout of ITS tools.
[2024-05-21 23:42:09] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:42:09] [INFO ] Applying decomposition
[2024-05-21 23:42:09] [INFO ] Flatten gal took : 9 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/graph4117462559878614183.txt' '-o' '/tmp/graph4117462559878614183.bin' '-w' '/tmp/graph4117462559878614183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4117462559878614183.bin' '-l' '-1' '-v' '-w' '/tmp/graph4117462559878614183.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:10] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:10] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-21 23:42:10] [INFO ] Flatten gal took : 47 ms
[2024-05-21 23:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-21 23:42:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14880042082758860415.gal : 8 ms
[2024-05-21 23:42:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16450589528264679725.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/CTLCardinality14880042082758860415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16450589528264679725.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 -...264
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,9.99376e+17,0.841255,29552,2197,69,55580,520,658,79370,82,1493,0


Converting to forward existential form...Done !
original formula: (E(E(!(((i7.u55.p221==0)||(i5.i2.u18.p72==1))) U ((AG(!(((i4.u25.p111==0)||(i1.u7.p36==1)))) * !(((i6.i0.u30.p119==0)||(i7.u39.p140==1)))...586
=> equivalent forward existential formula: ([((((FwdU(Init,E(!(((i7.u55.p221==0)||(i5.i2.u18.p72==1))) U ((!(E(TRUE U !(!(((i4.u25.p111==0)||(i1.u7.p36==1)...995
Reverse transition relation is NOT exact ! Due to transitions t51, t55, t57, t88, t100, t145, t146, t157, i0.t126, i0.u3.t131, i0.u3.t132, i0.u4.t128, i0.u...766
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 237 transition count 193
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 237 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 237 transition count 190
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 228 transition count 181
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 228 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 228 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 227 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 227 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 227 transition count 174
Applied a total of 57 rules in 27 ms. Remains 227 /251 variables (removed 24) and now considering 174/207 (removed 33) transitions.
// Phase 1: matrix 174 rows 227 cols
[2024-05-21 23:42:40] [INFO ] Computed 57 invariants in 5 ms
[2024-05-21 23:42:40] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:42:40] [INFO ] Invariant cache hit.
[2024-05-21 23:42:40] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-21 23:42:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:42:42] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:42:43] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:42:44] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:45] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 174/401 variables, 227/313 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:42:47] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:42:48] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 9/322 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:42:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:42:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (OVERLAPS) 0/401 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 331 constraints, problems are : Problem set: 0 solved, 173 unsolved in 15181 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/401 variables, 227/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 173/504 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:42:58] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:42:59] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:43:02] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:43:03] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 515 constraints, problems are : Problem set: 0 solved, 173 unsolved in 23931 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 58/58 constraints]
After SMT, in 39135ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 39138ms
Starting structural reductions in LTL mode, iteration 1 : 227/251 places, 174/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39439 ms. Remains : 227/251 places, 174/207 transitions.
[2024-05-21 23:43:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:43:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:43:19] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-21 23:43:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:43:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:43:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality1292094815594303976.gal : 2 ms
[2024-05-21 23:43:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17593726530515715337.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/CTLCardinality1292094815594303976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17593726530515715337.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.
Detected timeout of ITS tools.
[2024-05-21 23:43:49] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:43:49] [INFO ] Applying decomposition
[2024-05-21 23:43:49] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3302312378024892804.txt' '-o' '/tmp/graph3302312378024892804.bin' '-w' '/tmp/graph3302312378024892804.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3302312378024892804.bin' '-l' '-1' '-v' '-w' '/tmp/graph3302312378024892804.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:49] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:49] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 23:43:49] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:43:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:43:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality6099580146798278793.gal : 3 ms
[2024-05-21 23:43:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7123643201110693617.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/CTLCardinality6099580146798278793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7123643201110693617.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.34907e+17,5.89181,165116,5967,100,354180,727,637,359690,98,2147,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AX((i3.u22.p86==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((i3.u22.p86==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t56, t85, t98, t118, t135, t136, t168, i0.u4.t120, i0.u4.t121, i0.u8.t111, i0.u10.t108, ...710
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
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Graph (complete) has 451 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 246 transition count 183
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 227 transition count 183
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 227 transition count 172
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 216 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 71 place count 206 transition count 162
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 206 transition count 162
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 206 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 83 place count 206 transition count 159
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 205 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 92 place count 198 transition count 152
Iterating global reduction 3 with 7 rules applied. Total rules applied 99 place count 198 transition count 152
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 105 place count 198 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 106 place count 197 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 106 place count 197 transition count 144
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 110 place count 195 transition count 144
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 5 with 132 rules applied. Total rules applied 242 place count 129 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 243 place count 129 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 244 place count 129 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 127 transition count 75
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 249 place count 125 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 250 place count 124 transition count 74
Applied a total of 250 rules in 116 ms. Remains 124 /251 variables (removed 127) and now considering 74/207 (removed 133) transitions.
// Phase 1: matrix 74 rows 124 cols
[2024-05-21 23:44:20] [INFO ] Computed 55 invariants in 0 ms
[2024-05-21 23:44:20] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-21 23:44:20] [INFO ] Invariant cache hit.
[2024-05-21 23:44:20] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-21 23:44:20] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 23:44:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 5/124 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 74/198 variables, 124/179 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 180 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 5/124 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 74/198 variables, 124/181 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 73/254 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 254 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2409 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 2/2 constraints]
After SMT, in 4124ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 4125ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/251 places, 74/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4540 ms. Remains : 124/251 places, 74/207 transitions.
[2024-05-21 23:44:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:44:24] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:44:24] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-21 23:44:24] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:44:24] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:44:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality17827562603633773043.gal : 1 ms
[2024-05-21 23:44:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality11849847777104584392.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/CTLCardinality17827562603633773043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11849847777104584392.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,1.25836e+11,6.41128,193640,2,36510,5,877388,6,0,571,1.00813e+06,0


Converting to forward existential form...Done !
original formula: AG(EF(((p230==0)||(p27==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p230==0)||(p27==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t10, t19, t34, t35, t43, t46, t51, t70, Intersection with reachable at each ...216
(forward)formula 0,1,25.7565,643136,1,0,163,3.9667e+06,169,73,3484,2.44312e+06,161
FORMULA DES-PT-00b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 237 transition count 193
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 237 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 237 transition count 190
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 40 place count 228 transition count 181
Iterating global reduction 1 with 9 rules applied. Total rules applied 49 place count 228 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 54 place count 228 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 227 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 227 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 227 transition count 174
Applied a total of 57 rules in 14 ms. Remains 227 /251 variables (removed 24) and now considering 174/207 (removed 33) transitions.
// Phase 1: matrix 174 rows 227 cols
[2024-05-21 23:44:50] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:44:50] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-21 23:44:50] [INFO ] Invariant cache hit.
[2024-05-21 23:44:51] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-21 23:44:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:44:53] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:44:54] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:44:55] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:44:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:44:59] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:45:01] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:45:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 13 (OVERLAPS) 174/401 variables, 227/326 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:45:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:45:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:06] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 17 (OVERLAPS) 0/401 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 331 constraints, problems are : Problem set: 0 solved, 173 unsolved in 18929 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 174/401 variables, 227/334 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 173/507 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 9/516 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/401 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 516 constraints, problems are : Problem set: 0 solved, 173 unsolved in 18764 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 59/59 constraints]
After SMT, in 37735ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 37737ms
Starting structural reductions in LTL mode, iteration 1 : 227/251 places, 174/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38386 ms. Remains : 227/251 places, 174/207 transitions.
[2024-05-21 23:45:28] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:45:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:45:28] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-21 23:45:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:45:28] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:45:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2847912191890642990.gal : 2 ms
[2024-05-21 23:45:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4037777231383877280.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/CTLCardinality2847912191890642990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4037777231383877280.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.
Detected timeout of ITS tools.
[2024-05-21 23:45:58] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:45:58] [INFO ] Applying decomposition
[2024-05-21 23:45:58] [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/graph13607101492178197045.txt' '-o' '/tmp/graph13607101492178197045.bin' '-w' '/tmp/graph13607101492178197045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13607101492178197045.bin' '-l' '-1' '-v' '-w' '/tmp/graph13607101492178197045.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:58] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-21 23:45:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:45:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10580674137006991771.gal : 3 ms
[2024-05-21 23:45:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7837504860793027296.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/CTLCardinality10580674137006991771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7837504860793027296.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.33316e+17,2.30744,64576,3446,72,123240,714,603,231344,81,2189,0


Converting to forward existential form...Done !
original formula: AX(EG(EF((i12.u62.p230==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (i12.u62.p230==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t55, t86, t98, t135, i0.u10.t108, i1.t114, i1.u5.t126, i2.t118, i2.u3.t123, i2.u3.t124, ...706
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 236 transition count 192
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 236 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 236 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 227 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 227 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 226 transition count 173
Applied a total of 59 rules in 12 ms. Remains 226 /251 variables (removed 25) and now considering 173/207 (removed 34) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 23:46:29] [INFO ] Computed 57 invariants in 5 ms
[2024-05-21 23:46:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:46:29] [INFO ] Invariant cache hit.
[2024-05-21 23:46:29] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:46:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:46:32] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14807 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:46:51] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:46:57] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:46:58] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:46:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 44838ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 44840ms
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 173/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45141 ms. Remains : 226/251 places, 173/207 transitions.
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:14] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:47:14] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:47:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality12092139725897513791.gal : 1 ms
[2024-05-21 23:47:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3276124904455710822.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/CTLCardinality12092139725897513791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3276124904455710822.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.
Detected timeout of ITS tools.
[2024-05-21 23:47:44] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:44] [INFO ] Applying decomposition
[2024-05-21 23:47:44] [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/graph891328081594518697.txt' '-o' '/tmp/graph891328081594518697.bin' '-w' '/tmp/graph891328081594518697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph891328081594518697.bin' '-l' '-1' '-v' '-w' '/tmp/graph891328081594518697.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:44] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:44] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 23:47:44] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:47:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:47:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9325395697489698752.gal : 2 ms
[2024-05-21 23:47:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality18332582307065370338.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/CTLCardinality9325395697489698752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18332582307065370338.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.22197e+17,9.39364,258868,8185,72,719620,621,618,446265,80,1966,0


Converting to forward existential form...Done !
original formula: (EF(((EF(!(A((i8.u40.p155==1) U ((i10.i1.u47.p172==0)||(i10.i1.u59.p209==1))))) + (i8.u40.p155==1)) + AX(FALSE))) + EX((i10.i1.u47.p174==...159
=> equivalent forward existential formula: (((([(FwdU(FwdU(FwdU(Init,TRUE),TRUE),!(((i10.i1.u47.p172==0)||(i10.i1.u59.p209==1)))) * (!((i8.u40.p155==1)) * ...458
(forward)formula 0,1,10.1248,258868,1,0,719620,621,1340,446265,132,1966,228057
FORMULA DES-PT-00b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 237 transition count 193
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 237 transition count 193
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 237 transition count 191
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 39 place count 228 transition count 182
Iterating global reduction 1 with 9 rules applied. Total rules applied 48 place count 228 transition count 182
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 53 place count 228 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 227 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 227 transition count 175
Applied a total of 56 rules in 9 ms. Remains 227 /251 variables (removed 24) and now considering 175/207 (removed 32) transitions.
// Phase 1: matrix 175 rows 227 cols
[2024-05-21 23:47:54] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:47:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 23:47:54] [INFO ] Invariant cache hit.
[2024-05-21 23:47:54] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-21 23:47:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:47:56] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:47:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:47:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:47:59] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:48:00] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:01] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:02] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:04] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 175/402 variables, 227/330 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:48:08] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 4/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:48:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (OVERLAPS) 0/402 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 336 constraints, problems are : Problem set: 0 solved, 174 unsolved in 18073 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 52/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/402 variables, 227/336 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 174/510 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:48:15] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 0/402 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 512 constraints, problems are : Problem set: 0 solved, 174 unsolved in 16232 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 54/54 constraints]
After SMT, in 34343ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 34345ms
Starting structural reductions in LTL mode, iteration 1 : 227/251 places, 175/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34646 ms. Remains : 227/251 places, 175/207 transitions.
[2024-05-21 23:48:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:48:29] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:48:29] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-21 23:48:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:48:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:48:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16584901653940608848.gal : 2 ms
[2024-05-21 23:48:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality6525684069196764961.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/CTLCardinality16584901653940608848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6525684069196764961.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.
Detected timeout of ITS tools.
[2024-05-21 23:48:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:48:59] [INFO ] Applying decomposition
[2024-05-21 23:48:59] [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/graph17003644951225017306.txt' '-o' '/tmp/graph17003644951225017306.bin' '-w' '/tmp/graph17003644951225017306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17003644951225017306.bin' '-l' '-1' '-v' '-w' '/tmp/graph17003644951225017306.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:59] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:59] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-21 23:48:59] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-21 23:48:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15044768602090446789.gal : 2 ms
[2024-05-21 23:48:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality5255995683831910700.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/CTLCardinality15044768602090446789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5255995683831910700.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.55618e+17,1.84785,52212,2665,71,111718,484,645,139380,84,1212,0


Converting to forward existential form...Done !
original formula: E((AX(FALSE) * E((E(((i4.u25.p94==0)||(i10.i1.u53.p190==1)) U ((i3.i0.u13.p59==0)||(i5.i0.u34.p131==1))) + EX((i6.i0.u32.p126==1))) U (((...255
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(EX(!(FALSE))) * E((E(((i4.u25.p94==0)||(i10.i1.u53.p190==1)) U ((i3.i0.u13.p59==0)||(i5.i0.u...320
Reverse transition relation is NOT exact ! Due to transitions t50, t56, t135, t136, i0.u8.t111, i0.u10.t108, i1.t118, i1.u3.t123, i1.u3.t124, i1.u4.t120, i...736
(forward)formula 0,1,12.9599,308292,1,0,533448,974,3835,1.55645e+06,446,3023,708960
FORMULA DES-PT-00b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 236 transition count 192
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 236 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 236 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 229 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 229 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 51 place count 229 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 228 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 228 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 228 transition count 176
Applied a total of 54 rules in 10 ms. Remains 228 /251 variables (removed 23) and now considering 176/207 (removed 31) transitions.
// Phase 1: matrix 176 rows 228 cols
[2024-05-21 23:49:12] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 23:49:12] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:49:12] [INFO ] Invariant cache hit.
[2024-05-21 23:49:12] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 23:49:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 176/404 variables, 228/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:49:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 5/331 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 5/339 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (OVERLAPS) 0/404 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 340 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19973 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 55/112 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/404 variables, 228/340 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 175/515 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:49:39] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 6/523 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:45] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:49:52] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 525 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 65/65 constraints]
After SMT, in 50019ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 50022ms
Starting structural reductions in LTL mode, iteration 1 : 228/251 places, 176/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50292 ms. Remains : 228/251 places, 176/207 transitions.
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:50:02] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality5277781422582777773.gal : 1 ms
[2024-05-21 23:50:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality4276012030860360525.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/CTLCardinality5277781422582777773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4276012030860360525.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.
Detected timeout of ITS tools.
[2024-05-21 23:50:32] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:50:32] [INFO ] Applying decomposition
[2024-05-21 23:50:32] [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/graph14826983444548201681.txt' '-o' '/tmp/graph14826983444548201681.bin' '-w' '/tmp/graph14826983444548201681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14826983444548201681.bin' '-l' '-1' '-v' '-w' '/tmp/graph14826983444548201681.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:32] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-21 23:50:32] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-21 23:50:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality16789968013630045677.gal : 3 ms
[2024-05-21 23:50:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2223650624515957316.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/CTLCardinality16789968013630045677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2223650624515957316.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,4.22859e+17,0.649399,29784,2098,71,65290,680,673,66505,86,2155,0


Converting to forward existential form...Done !
original formula: (AX(((((i10.u43.p143==0) * AG((i9.i1.u50.p183==1))) + (i4.u18.p84==0)) + (i9.i2.u53.p192==1))) * E(AF(!(EF((i1.i1.u9.p40==1)))) U (AG(EX(...260
=> equivalent forward existential formula: (([(((EY(Init) * !((i9.i2.u53.p192==1))) * !((i4.u18.p84==0))) * !((i10.u43.p143==0)))] = FALSE * [(FwdU(((EY(In...442
Reverse transition relation is NOT exact ! Due to transitions t48, t56, t85, t137, t138, t170, i0.i0.u28.t77, i1.i0.t119, i1.i0.u3.t124, i1.i0.u3.t125, i1....739
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 236 transition count 192
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 236 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 236 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 227 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 227 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 226 transition count 173
Applied a total of 59 rules in 10 ms. Remains 226 /251 variables (removed 25) and now considering 173/207 (removed 34) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 23:51:02] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:51:03] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:51:03] [INFO ] Invariant cache hit.
[2024-05-21 23:51:03] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:51:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:51:08] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14984 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:51:21] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:51:26] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45015ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45017ms
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 173/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45425 ms. Remains : 226/251 places, 173/207 transitions.
[2024-05-21 23:51:48] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:51:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:51:48] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:51:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:51:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:51:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality864122033924196089.gal : 1 ms
[2024-05-21 23:51:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality1058211408137477903.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/CTLCardinality864122033924196089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1058211408137477903.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:52:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:18] [INFO ] Applying decomposition
[2024-05-21 23:52:18] [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/graph9642016926834320014.txt' '-o' '/tmp/graph9642016926834320014.bin' '-w' '/tmp/graph9642016926834320014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9642016926834320014.bin' '-l' '-1' '-v' '-w' '/tmp/graph9642016926834320014.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:18] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:18] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 23:52:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:52:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality14413806375295777112.gal : 2 ms
[2024-05-21 23:52:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9616460506805859941.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/CTLCardinality14413806375295777112.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9616460506805859941.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.22197e+17,0.825626,30764,2266,90,61033,524,630,72532,95,1583,0


Converting to forward existential form...Done !
original formula: EF(EX((i11.u9.p45==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (i11.u9.p45==1))] != FALSE
(forward)formula 0,1,0.922849,30764,1,0,61033,524,797,72532,121,1583,29638
FORMULA DES-PT-00b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Graph (complete) has 451 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 246 transition count 184
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 228 transition count 184
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 228 transition count 172
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 216 transition count 172
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 205 transition count 161
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 205 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 87 place count 205 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 204 transition count 157
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 204 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 90 place count 203 transition count 156
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 97 place count 196 transition count 149
Iterating global reduction 4 with 7 rules applied. Total rules applied 104 place count 196 transition count 149
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 110 place count 196 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 112 place count 195 transition count 142
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 112 place count 195 transition count 140
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 116 place count 193 transition count 140
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 244 place count 129 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 127 transition count 74
Reduce places removed 2 places and 0 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 6 with 3 rules applied. Total rules applied 249 place count 125 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 250 place count 124 transition count 73
Applied a total of 250 rules in 58 ms. Remains 124 /251 variables (removed 127) and now considering 73/207 (removed 134) transitions.
// Phase 1: matrix 73 rows 124 cols
[2024-05-21 23:52:19] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:52:19] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 23:52:19] [INFO ] Invariant cache hit.
[2024-05-21 23:52:19] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-21 23:52:19] [INFO ] Redundant transitions in 0 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 23:52:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 73/197 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/197 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 190 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3130 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 73/197 variables, 124/190 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 71/261 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 263 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 13/13 constraints]
After SMT, in 6656ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 6657ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/251 places, 73/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6950 ms. Remains : 124/251 places, 73/207 transitions.
[2024-05-21 23:52:26] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:52:26] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:52:26] [INFO ] Input system was already deterministic with 73 transitions.
[2024-05-21 23:52:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:52:26] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:52:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality4414622105255126915.gal : 0 ms
[2024-05-21 23:52:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality3150136058590608061.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/CTLCardinality4414622105255126915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3150136058590608061.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.
Detected timeout of ITS tools.
[2024-05-21 23:52:56] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:52:56] [INFO ] Applying decomposition
[2024-05-21 23:52:56] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14547565362878276776.txt' '-o' '/tmp/graph14547565362878276776.bin' '-w' '/tmp/graph14547565362878276776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14547565362878276776.bin' '-l' '-1' '-v' '-w' '/tmp/graph14547565362878276776.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:56] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:56] [INFO ] Removed a total of 9 redundant transitions.
[2024-05-21 23:52:56] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:52:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 23:52:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality2930945394985100910.gal : 2 ms
[2024-05-21 23:52:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality9270555174303128597.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/CTLCardinality2930945394985100910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9270555174303128597.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,8.60399e+10,0.29506,14252,608,75,23734,374,286,25855,72,900,0


Converting to forward existential form...Done !
original formula: EF(AG(((u48.p269==0)&&(i0.u3.p5==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((u48.p269==0)&&(i0.u3.p5==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t33, t46, t54, t65, u48.t0, i0.u0.t42, i0.u1.t10, i1.u2.t45, i2.u6.t5, i2.u7.t3, i3.u8.t...298
(forward)formula 0,0,0.4609,15308,1,0,26993,730,1374,44642,333,1717,40149
FORMULA DES-PT-00b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 194
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 238 transition count 191
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 230 transition count 183
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 230 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 230 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 229 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 229 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 229 transition count 176
Applied a total of 53 rules in 15 ms. Remains 229 /251 variables (removed 22) and now considering 176/207 (removed 31) transitions.
// Phase 1: matrix 176 rows 229 cols
[2024-05-21 23:52:57] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:52:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:52:57] [INFO ] Invariant cache hit.
[2024-05-21 23:52:57] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 23:52:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:53:00] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:53:01] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:02] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:53:02] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:53:02] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:03] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:53:03] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/405 variables, 229/322 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:07] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:09] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:53:09] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (OVERLAPS) 0/405 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 329 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16231 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 43/100 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/405 variables, 229/329 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 175/504 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:53:20] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:53:21] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:53:26] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:53:33] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:53:38] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/405 variables, and 516 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 55/55 constraints]
After SMT, in 46268ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 46270ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 176/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46561 ms. Remains : 229/251 places, 176/207 transitions.
[2024-05-21 23:53:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:53:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:43] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-21 23:53:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:43] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality16516625287685624200.gal : 1 ms
[2024-05-21 23:53:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality18207749992380136915.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/CTLCardinality16516625287685624200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18207749992380136915.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.
Detected timeout of ITS tools.
[2024-05-21 23:54:13] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:54:13] [INFO ] Applying decomposition
[2024-05-21 23:54:13] [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/graph10062347006126667276.txt' '-o' '/tmp/graph10062347006126667276.bin' '-w' '/tmp/graph10062347006126667276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10062347006126667276.bin' '-l' '-1' '-v' '-w' '/tmp/graph10062347006126667276.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:54:13] [INFO ] Decomposing Gal with order
[2024-05-21 23:54:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:54:13] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 23:54:13] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:54:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-21 23:54:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality3015352109107440884.gal : 21 ms
[2024-05-21 23:54:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality17214884460586609589.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/CTLCardinality3015352109107440884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17214884460586609589.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,4.06503e+17,8.21494,233092,9054,80,563238,757,665,416349,87,2372,0


Converting to forward existential form...Done !
original formula: EX((EG((EX(((i9.i1.u62.p219==0)&&(i3.i0.u21.p79==1))) + EX((i10.u65.p235==0)))) + ((i5.i0.u31.p128==1) * EX((AF((i2.u5.p36==1)) * AG(((i1...193
=> equivalent forward existential formula: ([FwdG(EY(Init),(EX(((i9.i1.u62.p219==0)&&(i3.i0.u21.p79==1))) + EX((i10.u65.p235==0))))] != FALSE + [((EY((EY(I...278
Reverse transition relation is NOT exact ! Due to transitions t51, t55, t86, t136, t137, t148, t170, i0.u27.t78, i1.t119, i1.u3.t124, i1.u3.t125, i1.u4.t12...747
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 236 transition count 192
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 236 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 236 transition count 189
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 227 transition count 180
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 227 transition count 180
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 226 transition count 173
Applied a total of 59 rules in 7 ms. Remains 226 /251 variables (removed 25) and now considering 173/207 (removed 34) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 23:54:43] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 23:54:44] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 23:54:44] [INFO ] Invariant cache hit.
[2024-05-21 23:54:44] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:54:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:48] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:54:49] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:54:55] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:54:56] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 15441 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:55:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:55:07] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:55:13] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:55:14] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45477ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45479ms
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 173/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45863 ms. Remains : 226/251 places, 173/207 transitions.
[2024-05-21 23:55:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:55:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:55:29] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:55:29] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:55:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11603251254945037289.gal : 1 ms
[2024-05-21 23:55:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality555411101281845455.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/CTLCardinality11603251254945037289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality555411101281845455.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.
Detected timeout of ITS tools.
[2024-05-21 23:55:59] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:55:59] [INFO ] Applying decomposition
[2024-05-21 23:55:59] [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/graph12733922168644948002.txt' '-o' '/tmp/graph12733922168644948002.bin' '-w' '/tmp/graph12733922168644948002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12733922168644948002.bin' '-l' '-1' '-v' '-w' '/tmp/graph12733922168644948002.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:55:59] [INFO ] Decomposing Gal with order
[2024-05-21 23:55:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:55:59] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 23:55:59] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:55:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-21 23:55:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality8982163827048052026.gal : 2 ms
[2024-05-21 23:55:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14413829371287483400.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/CTLCardinality8982163827048052026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14413829371287483400.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.22197e+17,0.519107,22656,1932,71,42941,422,661,49234,81,1149,0


Converting to forward existential form...Done !
original formula: EF(!(E(AX((i6.u31.p123==0)) U !(EF((i9.i0.u49.p181==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(!((i6.u31.p123==0)))) U !(E(TRUE U (i9.i0.u49.p181==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t54, t56, t85, t89, t134, t135, i0.i1.u9.t110, i0.i1.u11.t107, i1.t117, i1.u4.t122, i1.u4.t12...727
(forward)formula 0,1,1.63964,58560,1,0,124515,750,3194,190756,405,2105,202514
FORMULA DES-PT-00b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 194
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 238 transition count 191
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 37 place count 230 transition count 183
Iterating global reduction 1 with 8 rules applied. Total rules applied 45 place count 230 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 50 place count 230 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 229 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 229 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 229 transition count 176
Applied a total of 53 rules in 7 ms. Remains 229 /251 variables (removed 22) and now considering 176/207 (removed 31) transitions.
// Phase 1: matrix 176 rows 229 cols
[2024-05-21 23:56:01] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 23:56:01] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 23:56:01] [INFO ] Invariant cache hit.
[2024-05-21 23:56:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-21 23:56:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:03] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:56:04] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:56:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:56:06] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:56:08] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 176/405 variables, 229/323 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:56:11] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 14/337 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:56:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/405 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (OVERLAPS) 0/405 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 339 constraints, problems are : Problem set: 0 solved, 175 unsolved in 15110 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/229 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 53/110 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 176/405 variables, 229/339 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 175/514 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:56:19] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:56:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:24] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 5/525 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/405 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 526 constraints, problems are : Problem set: 0 solved, 175 unsolved in 29744 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 65/65 constraints]
After SMT, in 44868ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 44870ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 176/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45119 ms. Remains : 229/251 places, 176/207 transitions.
[2024-05-21 23:56:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:56:46] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:56:46] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-21 23:56:46] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:56:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:56:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality18264236611081818015.gal : 18 ms
[2024-05-21 23:56:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality1479261705086890022.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/CTLCardinality18264236611081818015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1479261705086890022.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.
Detected timeout of ITS tools.
[2024-05-21 23:57:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:57:16] [INFO ] Applying decomposition
[2024-05-21 23:57:16] [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/graph496622073155973560.txt' '-o' '/tmp/graph496622073155973560.bin' '-w' '/tmp/graph496622073155973560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph496622073155973560.bin' '-l' '-1' '-v' '-w' '/tmp/graph496622073155973560.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:57:16] [INFO ] Decomposing Gal with order
[2024-05-21 23:57:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:57:16] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 23:57:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:57:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-21 23:57:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality2934364021555647292.gal : 3 ms
[2024-05-21 23:57:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality9807671586116446002.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/CTLCardinality2934364021555647292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9807671586116446002.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.34907e+17,1.92058,62752,3114,93,124252,782,647,249076,89,2507,0


Converting to forward existential form...Done !
original formula: (E((((i8.i0.u37.p144==0)||(i9.i1.u52.p222==1))||((!((i12.u71.p264==0)||(i3.u24.p87==1)))||((i1.u4.p13!=1)&&(i8.i0.u37.p160==0)))) U EG(AF...291
=> equivalent forward existential formula: ([FwdG(EY((Init * !(E((((i8.i0.u37.p144==0)||(i9.i1.u52.p222==1))||((!((i12.u71.p264==0)||(i3.u24.p87==1)))||((i...564
Reverse transition relation is NOT exact ! Due to transitions t50, t54, t85, t98, t137, t138, i0.i0.u9.t113, i0.i0.u11.t110, i0.i1.t105, i0.i1.u13.t107, i1...770
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Graph (complete) has 451 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 246 transition count 185
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 229 transition count 185
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 229 transition count 173
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 217 transition count 173
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 206 transition count 162
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 206 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 85 place count 206 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 205 transition count 158
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 93 place count 198 transition count 151
Iterating global reduction 4 with 7 rules applied. Total rules applied 100 place count 198 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 106 place count 198 transition count 145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 108 place count 197 transition count 144
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 108 place count 197 transition count 142
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 112 place count 195 transition count 142
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 234 place count 134 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 132 transition count 79
Reduce places removed 1 places and 0 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 6 with 2 rules applied. Total rules applied 238 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 239 place count 130 transition count 78
Applied a total of 239 rules in 48 ms. Remains 130 /251 variables (removed 121) and now considering 78/207 (removed 129) transitions.
// Phase 1: matrix 78 rows 130 cols
[2024-05-21 23:57:46] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:57:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-21 23:57:47] [INFO ] Invariant cache hit.
[2024-05-21 23:57:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-21 23:57:47] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-21 23:57:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/130 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-21 23:57:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-21 23:57:48] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 78/208 variables, 130/198 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-21 23:57:49] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 200 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3476 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 23/43 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 78/208 variables, 130/202 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 76/278 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 278 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3170 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 16/16 constraints]
After SMT, in 6682ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6683ms
Starting structural reductions in SI_CTL mode, iteration 1 : 130/251 places, 78/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6959 ms. Remains : 130/251 places, 78/207 transitions.
[2024-05-21 23:57:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:57:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:57:53] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-21 23:57:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:57:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:57:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2423963568601139317.gal : 1 ms
[2024-05-21 23:57:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality16251519310190086839.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/CTLCardinality2423963568601139317.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16251519310190086839.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.
Detected timeout of ITS tools.
[2024-05-21 23:58:23] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:58:23] [INFO ] Applying decomposition
[2024-05-21 23:58:23] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14148627925959359361.txt' '-o' '/tmp/graph14148627925959359361.bin' '-w' '/tmp/graph14148627925959359361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14148627925959359361.bin' '-l' '-1' '-v' '-w' '/tmp/graph14148627925959359361.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:58:23] [INFO ] Decomposing Gal with order
[2024-05-21 23:58:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:58:23] [INFO ] Removed a total of 7 redundant transitions.
[2024-05-21 23:58:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:58:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-21 23:58:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3760708007403928656.gal : 1 ms
[2024-05-21 23:58:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9562953610110815067.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/CTLCardinality3760708007403928656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9562953610110815067.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.37042e+11,0.157402,10176,731,53,16759,227,339,16402,67,503,0


Converting to forward existential form...Done !
original formula: EF(EG((AG(((i5.i1.u28.p175!=0)&&(i10.i0.u26.p167!=1))) * (((i12.u5.p57==0)||(i10.i0.u26.p168==1))||(i12.u5.p54==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !(((i5.i1.u28.p175!=0)&&(i10.i0.u26.p167!=1))))) * (((i12.u5.p57==0)||(i10.i0....198
Reverse transition relation is NOT exact ! Due to transitions t38, t39, t61, t69, t75, i0.u0.t46, i0.u7.t6, i0.u8.t8, i1.u10.t4, i1.u11.t55, i2.u2.t49, i3....357
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,3.76935,156696,1,0,420251,653,1759,361176,302,1881,417708
FORMULA DES-PT-00b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 194
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 238 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 233 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 233 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 233 transition count 183
Applied a total of 42 rules in 12 ms. Remains 233 /251 variables (removed 18) and now considering 183/207 (removed 24) transitions.
// Phase 1: matrix 183 rows 233 cols
[2024-05-21 23:58:27] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:58:27] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 23:58:27] [INFO ] Invariant cache hit.
[2024-05-21 23:58:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-21 23:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:58:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:58:33] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:34] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 183/416 variables, 233/325 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:58:39] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 7/332 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:40] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:58:42] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (OVERLAPS) 0/416 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 335 constraints, problems are : Problem set: 0 solved, 182 unsolved in 18841 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 183/416 variables, 233/335 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 182/517 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:58:49] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:50] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 11/528 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:58:54] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:58:56] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:58:59] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:59:05] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:59:06] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:59:07] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-21 23:59:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:59:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 538 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 66/66 constraints]
After SMT, in 48889ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 48891ms
Starting structural reductions in LTL mode, iteration 1 : 233/251 places, 183/207 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49195 ms. Remains : 233/251 places, 183/207 transitions.
[2024-05-21 23:59:16] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:59:16] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:59:16] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-21 23:59:16] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:59:16] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:59:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality713790897173651015.gal : 1 ms
[2024-05-21 23:59:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality7889832280830434148.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/CTLCardinality713790897173651015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7889832280830434148.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:59:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:59:47] [INFO ] Applying decomposition
[2024-05-21 23:59:47] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13209071120120104996.txt' '-o' '/tmp/graph13209071120120104996.bin' '-w' '/tmp/graph13209071120120104996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13209071120120104996.bin' '-l' '-1' '-v' '-w' '/tmp/graph13209071120120104996.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:47] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:47] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-21 23:59:47] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:59:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-21 23:59:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality5009394584699247815.gal : 2 ms
[2024-05-21 23:59:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17616359000945730593.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/CTLCardinality5009394584699247815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17616359000945730593.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,7.08602e+17,2.07402,69816,3511,88,95966,936,628,454583,101,3140,0


Converting to forward existential form...Done !
original formula: A(((EX(((((i7.u32.p121==0)||(i5.u24.p84==1)) * E(((i2.u14.p59==0)||(i10.i1.i1.u48.p176==1)) U ((i0.u8.p29==0)||(i6.u10.p40==1)))) + !(((i...461
=> equivalent forward existential formula: [((Init * !(EG(!(!((!((E(!((!(!(E(TRUE U !((i11.u69.p248==0))))) * EX((i11.u71.p259==1)))) U (!(!((E(!(E(TRUE U ...1818
Reverse transition relation is NOT exact ! Due to transitions t54, t85, t123, t142, t143, t176, i0.t131, i0.u5.t115, i0.u8.t119, i1.u4.t125, i1.u4.t126, i1...719
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 251/251 places, 207/207 transitions.
Graph (complete) has 451 edges and 251 vertex of which 247 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 246 transition count 184
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 228 transition count 184
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 228 transition count 173
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 217 transition count 173
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 206 transition count 162
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 206 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 85 place count 206 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 205 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 86 place count 205 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 204 transition count 157
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 95 place count 197 transition count 150
Iterating global reduction 4 with 7 rules applied. Total rules applied 102 place count 197 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 108 place count 197 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 196 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 110 place count 196 transition count 141
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 114 place count 194 transition count 141
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 6 with 132 rules applied. Total rules applied 246 place count 128 transition count 75
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 128 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 249 place count 126 transition count 73
Reduce places removed 2 places and 0 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 6 with 3 rules applied. Total rules applied 252 place count 124 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 253 place count 123 transition count 72
Applied a total of 253 rules in 29 ms. Remains 123 /251 variables (removed 128) and now considering 72/207 (removed 135) transitions.
// Phase 1: matrix 72 rows 123 cols
[2024-05-22 00:00:17] [INFO ] Computed 55 invariants in 2 ms
[2024-05-22 00:00:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-22 00:00:17] [INFO ] Invariant cache hit.
[2024-05-22 00:00:17] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-22 00:00:17] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-22 00:00:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:00:17] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 4/122 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 72/195 variables, 123/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:00:18] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/195 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 180 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2139 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:00:19] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 4/122 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 72/195 variables, 123/182 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 70/252 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 14 (OVERLAPS) 0/195 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 252 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2830 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 4991ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 4992ms
Starting structural reductions in SI_CTL mode, iteration 1 : 123/251 places, 72/207 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5287 ms. Remains : 123/251 places, 72/207 transitions.
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 2 ms
[2024-05-22 00:00:22] [INFO ] Input system was already deterministic with 72 transitions.
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 2 ms
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 2 ms
[2024-05-22 00:00:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12727656352894935126.gal : 1 ms
[2024-05-22 00:00:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4871316568095427163.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12727656352894935126.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4871316568095427163.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 5848 steps (229 resets) in 29 ms. (194 steps per ms) remains 0/1 properties
FORMULA DES-PT-00b-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:00:22] [INFO ] Applying decomposition
[2024-05-22 00:00:22] [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/graph16259866655256681627.txt' '-o' '/tmp/graph16259866655256681627.bin' '-w' '/tmp/graph16259866655256681627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16259866655256681627.bin' '-l' '-1' '-v' '-w' '/tmp/graph16259866655256681627.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:00:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:00:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:00:22] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-22 00:00:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:00:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2024-05-22 00:00:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality13992295516368791907.gal : 16 ms
[2024-05-22 00:00:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10391318758187497516.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/CTLCardinality13992295516368791907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10391318758187497516.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 -...264
No direction supplied, using forward translation only.
Parsed 7 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.63436e+18,1.49058,51420,2883,62,115780,580,697,163406,84,1811,0


Converting to forward existential form...Done !
original formula: (E(E(!(((i10.i1.u63.p221==0)||(i6.i0.u21.p72==1))) U ((AG(!(((i4.u32.p111==0)||(i1.u8.p36==1)))) * !(((i7.i1.u37.p119==0)||(i8.u46.p140==...588
=> equivalent forward existential formula: ([((((FwdU(Init,E(!(((i10.i1.u63.p221==0)||(i6.i0.u21.p72==1))) U ((!(E(TRUE U !(!(((i4.u32.p111==0)||(i1.u8.p36...991
Reverse transition relation is NOT exact ! Due to transitions t54, t137, t163, t175, i0.t143, i0.u4.t139, i0.u4.t141, i1.t127, i1.u6.t148, i1.u8.t130, i1.u...868
(forward)formula 0,1,369.232,2523400,1,0,3.70941e+06,885,2805,7.79463e+06,247,2215,2378432
FORMULA DES-PT-00b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EX(EG(AX((i3.i2.u28.p86==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((i3.i2.u28.p86==1)))))] != FALSE
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
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:08:38] [INFO ] Applying decomposition
[2024-05-22 00:08:38] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:08:38] [INFO ] Decomposing Gal with order
[2024-05-22 00:08:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:08:38] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 00:08:38] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 6 ms.
[2024-05-22 00:08:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15992754056254792356.gal : 3 ms
[2024-05-22 00:08:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality4586091676335943576.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/CTLCardinality15992754056254792356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4586091676335943576.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 6 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.63436e+18,22.245,628488,11605,302,691235,1684,599,6.154e+06,148,5511,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AX((i0.i1.i0.i1.i0.i1.u114.p86==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((i0.i1.i0.i1.i0.i1.u114.p86==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u12.t113, i0.i0.u12.t115, i0.i0.i0.u11.t118, i0.i0.i0.i0.u10.t122, i0.i0.i0.i0.u10.t124...1757
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:12:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:12:21] [INFO ] Input system was already deterministic with 207 transitions.
[2024-05-22 00:12:21] [INFO ] Transformed 251 places.
[2024-05-22 00:12:21] [INFO ] Transformed 207 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:12:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6369010998057089870.gal : 3 ms
[2024-05-22 00:12:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality6630314540274640992.ctl : 2 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/CTLCardinality6369010998057089870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6630314540274640992.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 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.63436e+18,12.2146,268832,2,68807,5,1.10222e+06,6,0,1211,1.2443e+06,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(AX((p86==1)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(EX(!((p86==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t15, t21, t24, t32, t34, t37, t48, t50, t51, t52, t53, t54, t55, t56, t57, t58, t59, ...463
(forward)formula 0,1,189.48,3363988,1,0,695,1.86648e+07,13,195,3069,1.50777e+07,2
FORMULA DES-PT-00b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EG(EF((p230==1))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(E(TRUE U (p230==1)))))] = FALSE
Using saturation style SCC detection
ITS-tools command line returned an error code 137
Total runtime 3020362 ms.

BK_STOP 1716337808897

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DES-PT-00b"
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 DES-PT-00b, 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 r092-tall-171624189600609"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-00b.tgz
mv DES-PT-00b 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 ;