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.r136-tall-171631132500370.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 DiscoveryGPU-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.3K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 12 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 12 02:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 46K 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 DiscoveryGPU-PT-06b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-06b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716374141213

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 10:35:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:35:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:35:42] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-22 10:35:42] [INFO ] Transformed 184 places.
[2024-05-22 10:35:42] [INFO ] Transformed 194 transitions.
[2024-05-22 10:35:42] [INFO ] Found NUPN structural information;
[2024-05-22 10:35:42] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 64 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 28 place count 156 transition count 178
Iterating global reduction 1 with 16 rules applied. Total rules applied 44 place count 156 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 155 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 155 transition count 177
Applied a total of 46 rules in 38 ms. Remains 155 /184 variables (removed 29) and now considering 177/194 (removed 17) transitions.
// Phase 1: matrix 177 rows 155 cols
[2024-05-22 10:35:42] [INFO ] Computed 2 invariants in 15 ms
[2024-05-22 10:35:42] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 10:35:42] [INFO ] Invariant cache hit.
[2024-05-22 10:35:42] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-22 10:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (OVERLAPS) 177/332 variables, 155/157 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 11 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 2 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:35:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:35:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:35:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-22 10:35:46] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 13/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/332 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 170 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/332 variables, 155/170 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 176/346 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-22 10:35:50] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/332 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 347 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8739 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 14/14 constraints]
After SMT, in 15110ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15122ms
Starting structural reductions in LTL mode, iteration 1 : 155/184 places, 177/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15551 ms. Remains : 155/184 places, 177/194 transitions.
Support contains 64 out of 155 places after structural reductions.
[2024-05-22 10:35:58] [INFO ] Flatten gal took : 34 ms
[2024-05-22 10:35:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 10:35:58] [INFO ] Input system was already deterministic with 177 transitions.
RANDOM walk for 40000 steps (199 resets) in 1274 ms. (31 steps per ms) remains 3/58 properties
BEST_FIRST walk for 40003 steps (43 resets) in 247 ms. (161 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (42 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
[2024-05-22 10:35:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/19 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/93 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 195/288 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 9 (OVERLAPS) 41/329 variables, 35/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Real declared 332/332 variables, and 157 constraints, problems are : Problem set: 2 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-22 10:35:59] [INFO ] Flatten gal took : 12 ms
[2024-05-22 10:35:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:35:59] [INFO ] Input system was already deterministic with 177 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 289 edges and 155 vertex of which 151 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 137 transition count 159
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 137 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 131 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 131 transition count 153
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 128 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 128 transition count 150
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 125 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 125 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 122 transition count 141
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 122 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 119 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 119 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 118 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 118 transition count 137
Applied a total of 74 rules in 27 ms. Remains 118 /155 variables (removed 37) and now considering 137/177 (removed 40) transitions.
// Phase 1: matrix 137 rows 118 cols
[2024-05-22 10:35:59] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:35:59] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 10:35:59] [INFO ] Invariant cache hit.
[2024-05-22 10:35:59] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-22 10:35:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/255 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:36:00] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:36:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-22 10:36:01] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:36:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 12/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 132 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3676 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/255 variables, 118/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 136/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 268 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3499 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 12/12 constraints]
After SMT, in 7209ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 7212ms
Starting structural reductions in LTL mode, iteration 1 : 118/155 places, 137/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7367 ms. Remains : 118/155 places, 137/177 transitions.
[2024-05-22 10:36:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:36:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:36:06] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 10:36:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:36:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:36:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8965405737203319786.gal : 3 ms
[2024-05-22 10:36:06] [INFO ] Time to serialize properties into /tmp/CTLFireability5811617366902770976.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/CTLFireability8965405737203319786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5811617366902770976.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.32559e+08,13.558,354152,2,31071,5,1.15797e+06,6,0,609,2.14897e+06,0


Converting to forward existential form...Done !
original formula: EX(((!(E(!(AF((p105==1))) U EG((p40==1)))) * !(E(AX(((p120==1)&&(p175==1))) U E((p83==1) U (p29==1))))) * (EG((p89==0)) + ((p44==1)&&(p22...163
=> equivalent forward existential formula: ([FwdG((EY(Init) * (!(E(!(!(EG(!((p105==1))))) U EG((p40==1)))) * !(E(!(EX(!(((p120==1)&&(p175==1))))) U E((p83=...358
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t29, t31, t33, t43, t45, t46, t52, t55, t56, t58, t64, t...334
Detected timeout of ITS tools.
[2024-05-22 10:36:36] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:36:36] [INFO ] Applying decomposition
[2024-05-22 10:36:36] [INFO ] Flatten gal took : 5 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/graph16897328411749810580.txt' '-o' '/tmp/graph16897328411749810580.bin' '-w' '/tmp/graph16897328411749810580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16897328411749810580.bin' '-l' '-1' '-v' '-w' '/tmp/graph16897328411749810580.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:36:36] [INFO ] Decomposing Gal with order
[2024-05-22 10:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:36:36] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 10:36:36] [INFO ] Flatten gal took : 33 ms
[2024-05-22 10:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 10:36:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10512700360497319322.gal : 4 ms
[2024-05-22 10:36:36] [INFO ] Time to serialize properties into /tmp/CTLFireability10708721193936817844.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/CTLFireability10512700360497319322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10708721193936817844.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,7.32559e+08,6.99428,222212,3437,109,287180,3487,334,1.40704e+06,50,26422,0


Converting to forward existential form...Done !
original formula: EX(((!(E(!(AF((i9.u25.p105==1))) U EG((i3.u4.p40==1)))) * !(E(AX(((u29.p120==1)&&(u41.p175==1))) U E((i8.u20.p83==1) U (i2.u3.p29==1)))))...217
=> equivalent forward existential formula: ([FwdG((EY(Init) * (!(E(!(!(EG(!((i9.u25.p105==1))))) U EG((i3.u4.p40==1)))) * !(E(!(EX(!(((u29.p120==1)&&(u41.p...446
Reverse transition relation is NOT exact ! Due to transitions t131, t133, u29.t29, u41.t4, u41.t5, i2.u3.t89, i3.t101, i3.t86, i3.t71, i3.u4.t70, i3.u5.t85...503
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 158
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 129 transition count 151
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 125 transition count 147
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 121 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 121 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 117 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 117 transition count 135
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 113 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 112 transition count 130
Applied a total of 86 rules in 20 ms. Remains 112 /155 variables (removed 43) and now considering 130/177 (removed 47) transitions.
// Phase 1: matrix 130 rows 112 cols
[2024-05-22 10:37:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:37:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 10:37:06] [INFO ] Invariant cache hit.
[2024-05-22 10:37:06] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2024-05-22 10:37:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/242 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 2 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:37:08] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 126 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3411 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/126 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 129/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 255 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 12/12 constraints]
After SMT, in 6685ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 6687ms
Starting structural reductions in LTL mode, iteration 1 : 112/155 places, 130/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6829 ms. Remains : 112/155 places, 130/177 transitions.
[2024-05-22 10:37:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:37:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:37:13] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-22 10:37:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:37:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:37:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3731170704712122725.gal : 2 ms
[2024-05-22 10:37:13] [INFO ] Time to serialize properties into /tmp/CTLFireability6068293654900073798.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/CTLFireability3731170704712122725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6068293654900073798.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.25252e+08,15.1977,411920,2,34465,5,1.2503e+06,6,0,579,2.62291e+06,0


Converting to forward existential form...Done !
original formula: EF(((EG((p62==1)) * (p121==0)) * EX(EF((p58==0)))))
=> equivalent forward existential formula: [(FwdU(EY((FwdU(Init,TRUE) * (EG((p62==1)) * (p121==0)))),TRUE) * (p58==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t29, t30, t31, t33, t39, t42, t43, t45, t51, t55, t57, t...314
Detected timeout of ITS tools.
[2024-05-22 10:37:43] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:37:43] [INFO ] Applying decomposition
[2024-05-22 10:37:43] [INFO ] Flatten gal took : 5 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/graph13002522521895481111.txt' '-o' '/tmp/graph13002522521895481111.bin' '-w' '/tmp/graph13002522521895481111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13002522521895481111.bin' '-l' '-1' '-v' '-w' '/tmp/graph13002522521895481111.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:37:43] [INFO ] Decomposing Gal with order
[2024-05-22 10:37:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:37:43] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 10:37:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:37:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2024-05-22 10:37:43] [INFO ] Time to serialize gal into /tmp/CTLFireability179741704241800365.gal : 2 ms
[2024-05-22 10:37:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13762990785334344329.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/CTLFireability179741704241800365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13762990785334344329.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,6.25252e+08,11.253,344600,2984,140,676044,7866,308,2.27971e+06,44,69183,0


Converting to forward existential form...Done !
original formula: EF(((EG((i1.u17.p62==1)) * (i9.u27.p121==0)) * EX(EF((i5.u13.p58==0)))))
=> equivalent forward existential formula: [(FwdU(EY((FwdU(Init,TRUE) * (EG((i1.u17.p62==1)) * (i9.u27.p121==0)))),TRUE) * (i5.u13.p58==0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions u38.t4, u38.t5, i1.t79, i1.t68, i1.t55, i1.t42, i1.t14, i1.u4.t84, i1.u10.t69, i1.u17.t57, i1...474
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
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,29.1456,545008,1,0,676044,9837,1815,4.72559e+06,255,82063,467191
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 137 transition count 159
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 137 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 131 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 131 transition count 153
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 127 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 127 transition count 149
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 123 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 123 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 120 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 120 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 118 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 118 transition count 136
Applied a total of 74 rules in 11 ms. Remains 118 /155 variables (removed 37) and now considering 136/177 (removed 41) transitions.
// Phase 1: matrix 136 rows 118 cols
[2024-05-22 10:38:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:38:13] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:38:13] [INFO ] Invariant cache hit.
[2024-05-22 10:38:13] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2024-05-22 10:38:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/254 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 135 unsolved
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:38:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 131 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3616 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/254 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 135/266 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 266 constraints, problems are : Problem set: 0 solved, 135 unsolved in 3490 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 11/11 constraints]
After SMT, in 7134ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 7135ms
Starting structural reductions in LTL mode, iteration 1 : 118/155 places, 136/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7250 ms. Remains : 118/155 places, 136/177 transitions.
[2024-05-22 10:38:20] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:38:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:38:20] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 10:38:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:38:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:38:20] [INFO ] Time to serialize gal into /tmp/CTLFireability17843351478955961572.gal : 1 ms
[2024-05-22 10:38:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6920145506155864773.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/CTLFireability17843351478955961572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6920145506155864773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.36814e+08,11.8075,308660,2,35323,5,928273,6,0,608,1.84117e+06,0


Converting to forward existential form...Done !
original formula: ((AF(!(E(!(((p12==1)&&(p175==1))) U ((p43==1)&&(p182==1))))) + AX(AG(((p97==0)||(p182==0))))) + A((A(!(AF((p168==1))) U !(A((p142==1) U (...264
=> equivalent forward existential formula: [(FwdU(EY(((Init * !(!((E(!((((p26==1)&&(p175==1))&&(p85==1))) U (!((!((E(!(!(!((E(!((p164==1)) U (!((p142==1)) ...679
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t12, t15, t16, t19, t24, t27, t28, t30, t36, t41, t43, t50, t53, t55, t58, t63, t...323
Detected timeout of ITS tools.
[2024-05-22 10:38:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 10:38:50] [INFO ] Applying decomposition
[2024-05-22 10:38:50] [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/graph6706217544950687459.txt' '-o' '/tmp/graph6706217544950687459.bin' '-w' '/tmp/graph6706217544950687459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6706217544950687459.bin' '-l' '-1' '-v' '-w' '/tmp/graph6706217544950687459.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:38:50] [INFO ] Decomposing Gal with order
[2024-05-22 10:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:38:50] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-22 10:38:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:38:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16170585387121539323.gal : 1 ms
[2024-05-22 10:38:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17326748806228498647.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/CTLFireability16170585387121539323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17326748806228498647.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,7.36814e+08,1.90942,72088,1590,112,138485,3011,312,434026,46,25631,0


Converting to forward existential form...Done !
original formula: ((AF(!(E(!(((u4.p12==1)&&(u40.p175==1))) U ((i6.u14.p43==1)&&(i16.u41.p182==1))))) + AX(AG(((i11.u25.p97==0)||(i16.u41.p182==0))))) + A((...369
=> equivalent forward existential formula: [(FwdU(EY(((Init * !(!((E(!((((i4.u8.p26==1)&&(u40.p175==1))&&(i9.u19.p85==1))) U (!((!((E(!(!(!((E(!((i15.u36.p...898
Reverse transition relation is NOT exact ! Due to transitions t92, t94, t97, t129, t131, u40.t4, u40.t5, u4.t84, i3.u6.t86, i4.u8.t134, i5.u10.t88, i6.u12....484
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
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
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 : 155/155 places, 177/177 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 157
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 128 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 128 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 123 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 123 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 118 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 118 transition count 136
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 113 transition count 130
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 113 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 108 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 107 transition count 124
Applied a total of 96 rules in 13 ms. Remains 107 /155 variables (removed 48) and now considering 124/177 (removed 53) transitions.
// Phase 1: matrix 124 rows 107 cols
[2024-05-22 10:39:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:39:20] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:39:20] [INFO ] Invariant cache hit.
[2024-05-22 10:39:20] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 10:39:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 124/231 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-22 10:39:21] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:39:21] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:39:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:39:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:39:21] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:39:21] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:39:22] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/231 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 122 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3174 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/231 variables, 107/122 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 123/245 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/231 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 245 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 13/13 constraints]
After SMT, in 6172ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6173ms
Starting structural reductions in LTL mode, iteration 1 : 107/155 places, 124/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6288 ms. Remains : 107/155 places, 124/177 transitions.
[2024-05-22 10:39:26] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:39:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:39:26] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 10:39:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:39:26] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:39:26] [INFO ] Time to serialize gal into /tmp/CTLFireability8890357955908630145.gal : 1 ms
[2024-05-22 10:39:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1438670147916405106.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/CTLFireability8890357955908630145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1438670147916405106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.20559e+08,12.1523,318788,2,26597,5,1.05383e+06,6,0,553,1.89124e+06,0


Converting to forward existential form...Done !
original formula: AG(EX((((EF(((p53==1)&&(p175==1))) + EG((p112==1))) + ((p143==0) + ((p29==0) * AX((p114==1))))) + ((p80==1)&&(p175==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((E(TRUE U ((p53==1)&&(p175==1))) + EG((p112==1))) + ((p143==0) + ((p29==0) * !(EX(!((...206
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t15, t17, t18, t24, t27, t28, t30, t37, t40, t41, t44, t49, t52, t53, t55, t...304
Detected timeout of ITS tools.
[2024-05-22 10:39:56] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:39:56] [INFO ] Applying decomposition
[2024-05-22 10:39: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/graph16157064385396234476.txt' '-o' '/tmp/graph16157064385396234476.bin' '-w' '/tmp/graph16157064385396234476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16157064385396234476.bin' '-l' '-1' '-v' '-w' '/tmp/graph16157064385396234476.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:39:56] [INFO ] Decomposing Gal with order
[2024-05-22 10:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:39:56] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:39:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:39:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:39:56] [INFO ] Time to serialize gal into /tmp/CTLFireability430597303861113711.gal : 1 ms
[2024-05-22 10:39:56] [INFO ] Time to serialize properties into /tmp/CTLFireability15167252384154940157.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/CTLFireability430597303861113711.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15167252384154940157.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,5.20559e+08,15.3489,430300,5116,114,703004,5613,311,3.39164e+06,45,50456,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 133 transition count 155
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 133 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 126 transition count 148
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 122 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 122 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 118 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 114 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 109 transition count 127
Applied a total of 92 rules in 20 ms. Remains 109 /155 variables (removed 46) and now considering 127/177 (removed 50) transitions.
// Phase 1: matrix 127 rows 109 cols
[2024-05-22 10:40:26] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:40:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 10:40:27] [INFO ] Invariant cache hit.
[2024-05-22 10:40:27] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 10:40:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/236 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:40:28] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 120 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3096 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/236 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 126/246 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 246 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 9/9 constraints]
After SMT, in 6354ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6355ms
Starting structural reductions in LTL mode, iteration 1 : 109/155 places, 127/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6489 ms. Remains : 109/155 places, 127/177 transitions.
[2024-05-22 10:40:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:40:33] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:40:33] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-22 10:40:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:33] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:40:33] [INFO ] Time to serialize gal into /tmp/CTLFireability5991635142962835140.gal : 1 ms
[2024-05-22 10:40:33] [INFO ] Time to serialize properties into /tmp/CTLFireability13539546148749310124.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/CTLFireability5991635142962835140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13539546148749310124.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.40778e+08,9.22826,247512,2,23854,5,857279,6,0,564,1.4218e+06,0


Converting to forward existential form...Done !
original formula: (EG(AG(EF(((p68==1)&&(p182==1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EG(!(E(TRUE U !(E(TRUE U ((p68==1)&&(p182==1)))))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t53, t54, t56, t...314
Detected timeout of ITS tools.
[2024-05-22 10:41:03] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:41:03] [INFO ] Applying decomposition
[2024-05-22 10:41:03] [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/graph9031325850989611431.txt' '-o' '/tmp/graph9031325850989611431.bin' '-w' '/tmp/graph9031325850989611431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9031325850989611431.bin' '-l' '-1' '-v' '-w' '/tmp/graph9031325850989611431.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:41:03] [INFO ] Decomposing Gal with order
[2024-05-22 10:41:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:41:03] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-22 10:41:03] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:41:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:41:03] [INFO ] Time to serialize gal into /tmp/CTLFireability6399945084689103570.gal : 1 ms
[2024-05-22 10:41:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8599451546026105438.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/CTLFireability6399945084689103570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8599451546026105438.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,5.40778e+08,8.96745,296624,3248,102,515656,6322,315,2.03948e+06,44,53543,0


Converting to forward existential form...Done !
original formula: (EG(AG(EF(((i2.u16.p68==1)&&(i2.u38.p182==1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EG(!(E(TRUE U !(E(TRUE U ((i2.u16.p68==1)&&(i2.u38.p182==1)))))))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions u37.t4, u37.t5, i2.t94, i2.t93, i2.t53, i2.u5.t79, i2.u38.t2, i3.t76, i3.t65, i3.t38, i3.t26,...472
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 : 155/155 places, 177/177 transitions.
Graph (complete) has 289 edges and 155 vertex of which 151 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 150 transition count 140
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 118 transition count 140
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 65 place count 118 transition count 128
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 89 place count 106 transition count 128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 98 transition count 120
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 98 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 105 place count 98 transition count 118
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 96 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 113 place count 92 transition count 114
Iterating global reduction 2 with 4 rules applied. Total rules applied 117 place count 92 transition count 114
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 121 place count 88 transition count 109
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 88 transition count 109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 84 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 84 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 81 transition count 99
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 81 transition count 99
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 169 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 64 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 64 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 63 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 63 transition count 80
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 63 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 61 transition count 78
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 71 edges and 59 vertex of which 55 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 60 edges and 55 vertex of which 22 / 55 are part of one of the 11 SCC in 2 ms
Free SCC test removed 11 places
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 2 with 22 rules applied. Total rules applied 200 place count 44 transition count 55
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 229 place count 26 transition count 44
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 233 place count 22 transition count 36
Iterating global reduction 4 with 4 rules applied. Total rules applied 237 place count 22 transition count 36
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 241 place count 18 transition count 28
Iterating global reduction 4 with 4 rules applied. Total rules applied 245 place count 18 transition count 28
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 249 place count 14 transition count 20
Iterating global reduction 4 with 4 rules applied. Total rules applied 253 place count 14 transition count 20
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 257 place count 10 transition count 16
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 10 transition count 15
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 1 rules applied. Total rules applied 263 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 7 transition count 12
Applied a total of 266 rules in 67 ms. Remains 7 /155 variables (removed 148) and now considering 12/177 (removed 165) transitions.
[2024-05-22 10:41:33] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 7 cols
[2024-05-22 10:41:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:41:33] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 10:41:33] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-22 10:41:33] [INFO ] Invariant cache hit.
[2024-05-22 10:41:33] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-22 10:41:33] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 10:41:33] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2024-05-22 10:41:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 62 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 41 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/155 places, 12/177 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 215 ms. Remains : 7/155 places, 12/177 transitions.
[2024-05-22 10:41:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:41:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:41:33] [INFO ] Input system was already deterministic with 12 transitions.
[2024-05-22 10:41:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:41:33] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:41:33] [INFO ] Time to serialize gal into /tmp/CTLFireability7850231790290776528.gal : 1 ms
[2024-05-22 10:41:33] [INFO ] Time to serialize properties into /tmp/CTLFireability426360379237648258.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/CTLFireability7850231790290776528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability426360379237648258.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,126,0.001854,3352,2,17,5,94,6,0,34,86,0


Converting to forward existential form...Done !
original formula: EF(EG((p44==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p44==1))] != FALSE
Hit Full ! (commute/partial/dont) 10/0/2
(forward)formula 0,1,0.002867,3672,1,0,8,195,19,2,169,171,8
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 157
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 128 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 128 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 123 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 123 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 118 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 118 transition count 136
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 113 transition count 130
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 113 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 109 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 109 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 108 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 108 transition count 125
Applied a total of 94 rules in 11 ms. Remains 108 /155 variables (removed 47) and now considering 125/177 (removed 52) transitions.
// Phase 1: matrix 125 rows 108 cols
[2024-05-22 10:41:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:41:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 10:41:33] [INFO ] Invariant cache hit.
[2024-05-22 10:41:33] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-22 10:41:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/233 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 124 unsolved
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:41:35] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/233 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 121 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 125/233 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 124/245 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/233 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 245 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2910 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 11/11 constraints]
After SMT, in 6122ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6123ms
Starting structural reductions in LTL mode, iteration 1 : 108/155 places, 125/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6250 ms. Remains : 108/155 places, 125/177 transitions.
[2024-05-22 10:41:40] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:41:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:41:40] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-22 10:41:40] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:41:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3855984179244425521.gal : 1 ms
[2024-05-22 10:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability4851688509992835953.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/CTLFireability3855984179244425521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4851688509992835953.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.41607e+08,11.7579,299232,2,28759,5,985306,6,0,558,1.83173e+06,0


Converting to forward existential form...Done !
original formula: EF((A((AX(A((p0==1) U (p34==1))) + (p4==1)) U (p71!=1)) * EG(AF((p85==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((E(!((p71!=1)) U (!((!(EX(!(!((E(!((p34==1)) U (!((p0==1)) * !((p34==1)))) + EG(!((p3...246
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t48, t52, t53, t56, t...309
Detected timeout of ITS tools.
[2024-05-22 10:42:10] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:42:10] [INFO ] Applying decomposition
[2024-05-22 10:42:10] [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/graph11074831917326630541.txt' '-o' '/tmp/graph11074831917326630541.bin' '-w' '/tmp/graph11074831917326630541.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11074831917326630541.bin' '-l' '-1' '-v' '-w' '/tmp/graph11074831917326630541.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:42:10] [INFO ] Decomposing Gal with order
[2024-05-22 10:42:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:42:10] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 10:42:10] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:42:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:42:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11152451401528228700.gal : 1 ms
[2024-05-22 10:42:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11518588562126778528.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/CTLFireability11152451401528228700.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11518588562126778528.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 135 transition count 157
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 135 transition count 157
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 129 transition count 151
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 125 transition count 147
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 125 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 122 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 122 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 119 transition count 138
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 119 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 116 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 116 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 115 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 115 transition count 134
Applied a total of 80 rules in 20 ms. Remains 115 /155 variables (removed 40) and now considering 134/177 (removed 43) transitions.
// Phase 1: matrix 134 rows 115 cols
[2024-05-22 10:42:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:42:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 10:42:40] [INFO ] Invariant cache hit.
[2024-05-22 10:42:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-05-22 10:42:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/249 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:42:41] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2024-05-22 10:42:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 11/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 128 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/249 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 133/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 261 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3266 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints]
After SMT, in 6762ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 6764ms
Starting structural reductions in LTL mode, iteration 1 : 115/155 places, 134/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6899 ms. Remains : 115/155 places, 134/177 transitions.
[2024-05-22 10:42:47] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:42:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:42:47] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-22 10:42:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:42:47] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:42:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9248271644192796860.gal : 2 ms
[2024-05-22 10:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6581738808184436058.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/CTLFireability9248271644192796860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6581738808184436058.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.49136e+08,14.459,374796,2,29065,5,1.26056e+06,6,0,595,2.10588e+06,0


Converting to forward existential form...Done !
original formula: EF(EG((AX(A((p69==1) U (p85==1))) + ((p39==1)&&(p175==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!(!((E(!((p85==1)) U (!((p69==1)) * !((p85==1)))) + EG(!((p85==1)))))))) + ((p39==1)...179
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t48, t53, t54, t55, t...327
Detected timeout of ITS tools.
[2024-05-22 10:43:17] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:43:17] [INFO ] Applying decomposition
[2024-05-22 10:43:17] [INFO ] Flatten gal took : 6 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/graph10851204198540428581.txt' '-o' '/tmp/graph10851204198540428581.bin' '-w' '/tmp/graph10851204198540428581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10851204198540428581.bin' '-l' '-1' '-v' '-w' '/tmp/graph10851204198540428581.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:43:17] [INFO ] Decomposing Gal with order
[2024-05-22 10:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:43:17] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 10:43:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 10:43:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3730027202646649921.gal : 1 ms
[2024-05-22 10:43:17] [INFO ] Time to serialize properties into /tmp/CTLFireability169436794493285200.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/CTLFireability3730027202646649921.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability169436794493285200.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 -...261
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,6.49136e+08,8.54399,215692,4513,158,325015,2500,324,1.6281e+06,54,19668,0


Converting to forward existential form...Done !
original formula: EF(EG((AX(A((u5.p69==1) U (i6.u18.p85==1))) + ((i14.u13.p39==1)&&(u38.p175==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!(!((E(!((i6.u18.p85==1)) U (!((u5.p69==1)) * !((i6.u18.p85==1)))) + EG(!((i6.u18.p8...215
Reverse transition relation is NOT exact ! Due to transitions t128, t130, u5.t53, u5.t54, u5.t83, u5.t84, u38.t4, u38.t5, i1.t81, i1.t38, i1.t26, i1.t14, i...485
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 156
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 156
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 127 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 127 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 122 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 122 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 118 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 114 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 109 transition count 127
Applied a total of 92 rules in 17 ms. Remains 109 /155 variables (removed 46) and now considering 127/177 (removed 50) transitions.
// Phase 1: matrix 127 rows 109 cols
[2024-05-22 10:43:47] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:43:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:43:47] [INFO ] Invariant cache hit.
[2024-05-22 10:43:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 10:43:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/236 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:43:48] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 119 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/236 variables, 109/119 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 126/245 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 245 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3217 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints]
After SMT, in 6370ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6372ms
Starting structural reductions in LTL mode, iteration 1 : 109/155 places, 127/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6500 ms. Remains : 109/155 places, 127/177 transitions.
[2024-05-22 10:43:53] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:43:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:43:53] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-22 10:43:53] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:43:53] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:43:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8237127086939484359.gal : 1 ms
[2024-05-22 10:43:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3285077650082822062.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/CTLFireability8237127086939484359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3285077650082822062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.50146e+08,11.5895,295616,2,34177,5,977702,6,0,564,1.75903e+06,0


Converting to forward existential form...Done !
original formula: E(!(AX(A(((p102==1)&&(p175==1)) U ((p113==1)&&(p175==1))))) U (p36==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(!((E(!(((p113==1)&&(p175==1))) U (!(((p102==1)&&(p175==1))) * !(((p113==1)&&(p175==1))))) +...214
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...314
Detected timeout of ITS tools.
[2024-05-22 10:44:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:44:23] [INFO ] Applying decomposition
[2024-05-22 10:44:23] [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/graph1733467286962851955.txt' '-o' '/tmp/graph1733467286962851955.bin' '-w' '/tmp/graph1733467286962851955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1733467286962851955.bin' '-l' '-1' '-v' '-w' '/tmp/graph1733467286962851955.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:44:23] [INFO ] Decomposing Gal with order
[2024-05-22 10:44:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:44:23] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:44:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:44:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:44:23] [INFO ] Time to serialize gal into /tmp/CTLFireability17830887412338734802.gal : 1 ms
[2024-05-22 10:44:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9733745585972410078.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/CTLFireability17830887412338734802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9733745585972410078.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,5.50146e+08,12.6375,372752,4353,116,627966,7522,298,2.66024e+06,44,63053,0


Converting to forward existential form...Done !
original formula: E(!(AX(A(((i3.u23.p102==1)&&(u37.p175==1)) U ((i0.u26.p113==1)&&(u37.p175==1))))) U (i5.u10.p36==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(!((E(!(((i0.u26.p113==1)&&(u37.p175==1))) U (!(((i3.u23.p102==1)&&(u37.p175==1))) * !(((i0....265
Reverse transition relation is NOT exact ! Due to transitions u37.t4, u37.t5, i2.t77, i2.t50, i2.t38, i2.t26, i2.t14, i2.u6.t82, i2.u18.t51, i2.u22.t39, i2...477
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 158
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 158
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 131 transition count 153
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 131 transition count 153
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 126 transition count 148
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 126 transition count 148
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 121 transition count 139
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 121 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 116 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 116 transition count 133
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 111 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 111 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 110 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 110 transition count 127
Applied a total of 90 rules in 11 ms. Remains 110 /155 variables (removed 45) and now considering 127/177 (removed 50) transitions.
// Phase 1: matrix 127 rows 110 cols
[2024-05-22 10:44:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:44:54] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 10:44:54] [INFO ] Invariant cache hit.
[2024-05-22 10:44:54] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 10:44:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/237 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-22 10:44:55] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 14/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 126 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/237 variables, 110/126 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 126/252 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 10:44:58] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/237 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 253 constraints, problems are : Problem set: 0 solved, 126 unsolved in 5117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 15/15 constraints]
After SMT, in 8568ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 8569ms
Starting structural reductions in LTL mode, iteration 1 : 110/155 places, 127/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8690 ms. Remains : 110/155 places, 127/177 transitions.
[2024-05-22 10:45:02] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:45:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:02] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-22 10:45:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:02] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:45:02] [INFO ] Time to serialize gal into /tmp/CTLFireability3250473894944788769.gal : 1 ms
[2024-05-22 10:45:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14395951676024738450.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/CTLFireability3250473894944788769.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14395951676024738450.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.32203e+08,25.6629,614664,2,46550,5,2.06297e+06,6,0,568,3.69462e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 10:45:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:45:32] [INFO ] Applying decomposition
[2024-05-22 10:45: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/graph16823840036925190462.txt' '-o' '/tmp/graph16823840036925190462.bin' '-w' '/tmp/graph16823840036925190462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16823840036925190462.bin' '-l' '-1' '-v' '-w' '/tmp/graph16823840036925190462.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:45:32] [INFO ] Decomposing Gal with order
[2024-05-22 10:45:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:45:32] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:45:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:45:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:45:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4820782497733109467.gal : 1 ms
[2024-05-22 10:45:32] [INFO ] Time to serialize properties into /tmp/CTLFireability10190230965292553768.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/CTLFireability4820782497733109467.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10190230965292553768.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,8.32203e+08,21.665,582436,6120,128,1.04719e+06,6092,289,4.22718e+06,50,58882,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 133 transition count 155
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 133 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 126 transition count 148
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 121 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 121 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 116 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 116 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 111 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 111 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 106 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 105 transition count 122
Applied a total of 100 rules in 5 ms. Remains 105 /155 variables (removed 50) and now considering 122/177 (removed 55) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-22 10:46:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:46:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 10:46:02] [INFO ] Invariant cache hit.
[2024-05-22 10:46:02] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-22 10:46:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:46:04] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 115 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 236 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 5907ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 5908ms
Starting structural reductions in LTL mode, iteration 1 : 105/155 places, 122/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6018 ms. Remains : 105/155 places, 122/177 transitions.
[2024-05-22 10:46:08] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:46:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:46:08] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 10:46:08] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:46:08] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:46:08] [INFO ] Time to serialize gal into /tmp/CTLFireability13826489000185315967.gal : 0 ms
[2024-05-22 10:46:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8906146670834601340.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/CTLFireability13826489000185315967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8906146670834601340.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70015e+08,11.6806,287980,2,27997,5,939100,6,0,543,1.7306e+06,0


Converting to forward existential form...Done !
original formula: EG(AX((EF(AG((p60==1))) + (p79==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((E(TRUE U !(E(TRUE U !((p60==1))))) + (p79==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...304
(forward)formula 0,0,27.7429,565984,1,0,298,2.49286e+06,273,131,3432,3.84707e+06,282
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 156
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 156
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 128 transition count 150
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 128 transition count 150
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 124 transition count 146
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 124 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 120 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 120 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 116 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 116 transition count 134
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 112 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 111 transition count 129
Applied a total of 88 rules in 13 ms. Remains 111 /155 variables (removed 44) and now considering 129/177 (removed 48) transitions.
// Phase 1: matrix 129 rows 111 cols
[2024-05-22 10:46:36] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:46:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 10:46:36] [INFO ] Invariant cache hit.
[2024-05-22 10:46:36] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-22 10:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/240 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:46:38] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 122 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3179 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/240 variables, 111/122 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 128/250 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 250 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 9/9 constraints]
After SMT, in 6348ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 6349ms
Starting structural reductions in LTL mode, iteration 1 : 111/155 places, 129/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6474 ms. Remains : 111/155 places, 129/177 transitions.
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:46:43] [INFO ] Input system was already deterministic with 129 transitions.
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:46:43] [INFO ] Time to serialize gal into /tmp/CTLFireability15439569120333406170.gal : 1 ms
[2024-05-22 10:46:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7777149198719286986.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/CTLFireability15439569120333406170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7777149198719286986.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.61156e+08,13.993,359920,2,25808,5,1.13523e+06,6,0,574,2.10563e+06,0


Converting to forward existential form...Done !
original formula: EF(((AX((p83==0)) * EX((p82==1))) * ((p147==0)||(p175==0))))
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * ((p147==0)||(p175==0))) * !(EX(!((p83==0)))))) * (p82==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t17, t19, t21, t27, t30, t31, t33, t39, t42, t43, t45, t51, t54, t55, t57, t...316
(forward)formula 0,1,24.6599,440236,1,0,292,1.8909e+06,277,136,3509,2.9969e+06,268
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 133 transition count 155
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 133 transition count 155
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 126 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 126 transition count 148
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 121 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 121 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 116 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 116 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 111 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 111 transition count 128
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 93 place count 106 transition count 123
Iterating global reduction 0 with 5 rules applied. Total rules applied 98 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 105 transition count 122
Applied a total of 100 rules in 14 ms. Remains 105 /155 variables (removed 50) and now considering 122/177 (removed 55) transitions.
// Phase 1: matrix 122 rows 105 cols
[2024-05-22 10:47:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:47:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 10:47:08] [INFO ] Invariant cache hit.
[2024-05-22 10:47:08] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-22 10:47:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/227 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:47:09] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 115 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2922 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/227 variables, 105/115 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 121/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 236 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 8/8 constraints]
After SMT, in 5757ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 5758ms
Starting structural reductions in LTL mode, iteration 1 : 105/155 places, 122/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5871 ms. Remains : 105/155 places, 122/177 transitions.
[2024-05-22 10:47:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:47:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:47:13] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 10:47:13] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:47:13] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:47:13] [INFO ] Time to serialize gal into /tmp/CTLFireability7425495646236550249.gal : 1 ms
[2024-05-22 10:47:13] [INFO ] Time to serialize properties into /tmp/CTLFireability3206433279635471390.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/CTLFireability7425495646236550249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3206433279635471390.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70015e+08,11.5627,287876,2,27997,5,939100,6,0,543,1.7306e+06,0


Converting to forward existential form...Done !
original formula: EX(AF(!(E((p45==1) U AF(((p73==1)&&(p175==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E((p45==1) U !(EG(!(((p73==1)&&(p175==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t50, t51, t53, t...304
Detected timeout of ITS tools.
[2024-05-22 10:47:43] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:47:43] [INFO ] Applying decomposition
[2024-05-22 10:47:43] [INFO ] Flatten gal took : 2 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/graph12286495277943312717.txt' '-o' '/tmp/graph12286495277943312717.bin' '-w' '/tmp/graph12286495277943312717.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12286495277943312717.bin' '-l' '-1' '-v' '-w' '/tmp/graph12286495277943312717.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:47:43] [INFO ] Decomposing Gal with order
[2024-05-22 10:47:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:47:43] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:47:43] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:47:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 0 ms.
[2024-05-22 10:47:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17404729755008897057.gal : 1 ms
[2024-05-22 10:47:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16240145137145179429.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/CTLFireability17404729755008897057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16240145137145179429.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,4.70015e+08,8.80967,279452,4648,113,474213,3942,293,2.12923e+06,44,31360,0


Converting to forward existential form...Done !
original formula: EX(AF(!(E((u11.p45==1) U AF(((i2.u16.p73==1)&&(u35.p175==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E((u11.p45==1) U !(EG(!(((i2.u16.p73==1)&&(u35.p175==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t62, u11.t63, u35.t4, u35.t5, i1.u4.t80, i2.t73, i2.t50, i2.t38, i2.t26, i2.t14, i2.u7.t78, i...448
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 134 transition count 156
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 134 transition count 156
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 127 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 127 transition count 149
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 122 transition count 144
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 122 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 118 transition count 137
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 118 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 114 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 109 transition count 127
Applied a total of 92 rules in 5 ms. Remains 109 /155 variables (removed 46) and now considering 127/177 (removed 50) transitions.
// Phase 1: matrix 127 rows 109 cols
[2024-05-22 10:48:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:48:14] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:48:14] [INFO ] Invariant cache hit.
[2024-05-22 10:48:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 10:48:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (OVERLAPS) 127/236 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:48:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/236 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 124 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/236 variables, 109/124 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 126/250 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 250 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 13/13 constraints]
After SMT, in 6568ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 6569ms
Starting structural reductions in LTL mode, iteration 1 : 109/155 places, 127/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6681 ms. Remains : 109/155 places, 127/177 transitions.
[2024-05-22 10:48:20] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:48:20] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:48:20] [INFO ] Input system was already deterministic with 127 transitions.
[2024-05-22 10:48:20] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:48:20] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:48:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6244953016832892161.gal : 1 ms
[2024-05-22 10:48:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9728338064056017441.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/CTLFireability6244953016832892161.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9728338064056017441.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.50329e+08,12.0663,302676,2,22516,5,1.07034e+06,6,0,564,1.69341e+06,0


Converting to forward existential form...Done !
original formula: EG(A(!(EF((p168!=1))) U !(((AF((p76==1)) + (p117==1)) + AX(AF(((p107==1)&&(p175==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((!(EG(!((p76==1)))) + (p117==1)) + !(EX(!(!(EG(!(((p107==1)&&(p175==1))))))))))) U (!(!(E(T...368
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t28, t30, t31, t33, t39, t42, t43, t45, t51, t54, t55, t...314
Detected timeout of ITS tools.
[2024-05-22 10:48:50] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:48:50] [INFO ] Applying decomposition
[2024-05-22 10:48:50] [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/graph17102791598379443119.txt' '-o' '/tmp/graph17102791598379443119.bin' '-w' '/tmp/graph17102791598379443119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17102791598379443119.bin' '-l' '-1' '-v' '-w' '/tmp/graph17102791598379443119.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:48:50] [INFO ] Decomposing Gal with order
[2024-05-22 10:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:48:50] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-22 10:48:50] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:48:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:48:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12076613073837565119.gal : 1 ms
[2024-05-22 10:48:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8678070633220321719.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/CTLFireability12076613073837565119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8678070633220321719.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,5.50329e+08,15.3856,385548,4615,114,612706,6146,304,2.79693e+06,44,53650,0


Converting to forward existential form...Done !
original formula: EG(A(!(EF((i0.u0.p168!=1))) U !(((AF((i3.u18.p76==1)) + (i8.u27.p117==1)) + AX(AF(((i7.u22.p107==1)&&(u37.p175==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((!(EG(!((i3.u18.p76==1)))) + (i8.u27.p117==1)) + !(EX(!(!(EG(!(((i7.u22.p107==1)&&(u37.p175...449
Reverse transition relation is NOT exact ! Due to transitions u37.t4, u37.t5, i2.t77, i2.t66, i2.t54, i2.t42, i2.t14, i2.u6.t82, i2.u10.t67, i2.u17.t55, i2...477
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 137 transition count 159
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 137 transition count 159
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 133 transition count 155
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 133 transition count 155
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 129 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 129 transition count 151
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 126 transition count 145
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 126 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 123 transition count 142
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 123 transition count 142
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 120 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 120 transition count 139
Applied a total of 70 rules in 5 ms. Remains 120 /155 variables (removed 35) and now considering 139/177 (removed 38) transitions.
// Phase 1: matrix 139 rows 120 cols
[2024-05-22 10:49:20] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:49:20] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 10:49:20] [INFO ] Invariant cache hit.
[2024-05-22 10:49:20] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-22 10:49:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/259 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-22 10:49:22] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 13/135 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 135 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3854 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/259 variables, 120/135 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 138/273 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-22 10:49:27] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/259 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 274 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7657 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints]
After SMT, in 11535ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 11536ms
Starting structural reductions in LTL mode, iteration 1 : 120/155 places, 139/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11654 ms. Remains : 120/155 places, 139/177 transitions.
[2024-05-22 10:49:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:49:32] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:49:32] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-22 10:49:32] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:49:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:49:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13097670818632551055.gal : 1 ms
[2024-05-22 10:49:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9772491740430822743.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/CTLFireability13097670818632551055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9772491740430822743.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.74541e+08,23.1812,555580,2,44165,5,1.8182e+06,6,0,619,3.30603e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 10:50:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:50:02] [INFO ] Applying decomposition
[2024-05-22 10:50:02] [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/graph14205282727127415340.txt' '-o' '/tmp/graph14205282727127415340.bin' '-w' '/tmp/graph14205282727127415340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14205282727127415340.bin' '-l' '-1' '-v' '-w' '/tmp/graph14205282727127415340.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:50:02] [INFO ] Decomposing Gal with order
[2024-05-22 10:50:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:50:02] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 10:50:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:50:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:50:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14004626269525234894.gal : 1 ms
[2024-05-22 10:50:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5106186222053128341.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/CTLFireability14004626269525234894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5106186222053128341.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,9.74541e+08,1.32091,56276,3055,206,91831,2440,329,363858,59,15791,0


Converting to forward existential form...Done !
original formula: EG(A(AX((EG((u38.p173==1)) * EF((i10.i1.u0.p1==1)))) U E(((i14.u40.p183==1)||((i14.u5.p123==1)&&((i9.u31.p115==1)||(u38.p174==1)))) U (!(...212
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(((i14.u40.p183==1)||((i14.u5.p123==1)&&((i9.u31.p115==1)||(u38.p174==1)))) U (!(((i2.u29.p12...588
Reverse transition relation is NOT exact ! Due to transitions t134, u38.t6, u38.t8, u38.t9, u38.t10, u22.t49, u22.t137, i1.t85, i1.t74, i1.t62, i1.t18, i1....549
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 155/155 places, 177/177 transitions.
Graph (complete) has 289 edges and 155 vertex of which 151 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 150 transition count 139
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 117 transition count 139
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 67 place count 117 transition count 127
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 91 place count 105 transition count 127
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 97 transition count 119
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 97 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 107 place count 97 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 95 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 93 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 93 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 91 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 91 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 89 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 89 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 88 transition count 108
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 88 transition count 108
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 155 place count 73 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 72 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 72 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 71 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 70 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 70 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 68 transition count 87
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 66 edges and 62 vertex of which 24 / 62 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 2 with 24 rules applied. Total rules applied 187 place count 50 transition count 62
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 219 place count 30 transition count 50
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 222 place count 27 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 225 place count 27 transition count 44
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 24 transition count 38
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 24 transition count 38
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 234 place count 21 transition count 32
Iterating global reduction 4 with 3 rules applied. Total rules applied 237 place count 21 transition count 32
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 240 place count 18 transition count 29
Iterating global reduction 4 with 3 rules applied. Total rules applied 243 place count 18 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 244 place count 18 transition count 28
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 1 rules applied. Total rules applied 245 place count 18 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 17 transition count 27
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 249 place count 14 transition count 24
Applied a total of 249 rules in 33 ms. Remains 14 /155 variables (removed 141) and now considering 24/177 (removed 153) transitions.
[2024-05-22 10:50:32] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 14 cols
[2024-05-22 10:50:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:50:32] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 10:50:32] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-05-22 10:50:32] [INFO ] Invariant cache hit.
[2024-05-22 10:50:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-22 10:50:32] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 10:50:32] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-05-22 10:50:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 3/32 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 102 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 18/29 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 3/32 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 90 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 197ms
Starting structural reductions in SI_CTL mode, iteration 1 : 14/155 places, 24/177 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 273 ms. Remains : 14/155 places, 24/177 transitions.
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:50:32] [INFO ] Input system was already deterministic with 24 transitions.
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 0 ms
[2024-05-22 10:50:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2782812577991131526.gal : 0 ms
[2024-05-22 10:50:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6412200915228928842.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/CTLFireability2782812577991131526.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6412200915228928842.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(EF(AG(((p148==1)||(p40==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(((p148==1)||(p40==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t8, t12, t13, t15, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,0,0.007912,3736,1,0,48,1043,70,27,371,1083,62
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-22 10:50:32] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:50:32] [INFO ] Applying decomposition
[2024-05-22 10:50:32] [INFO ] Flatten gal took : 6 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/graph9512682556086982919.txt' '-o' '/tmp/graph9512682556086982919.bin' '-w' '/tmp/graph9512682556086982919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9512682556086982919.bin' '-l' '-1' '-v' '-w' '/tmp/graph9512682556086982919.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:50:32] [INFO ] Decomposing Gal with order
[2024-05-22 10:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:50:33] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 10:50:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:50:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 10:50:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15368198952038940786.gal : 2 ms
[2024-05-22 10:50:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7831755101004808421.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/CTLFireability15368198952038940786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7831755101004808421.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 11 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.7617e+09,5.66811,177960,4187,91,286413,3931,382,900225,59,37496,0


Converting to forward existential form...Done !
original formula: EX(((!(E(!(AF((i13.u32.p105==1))) U EG((i5.u12.p40==1)))) * !(E(AX(((i15.u37.p120==1)&&(u51.p175==1))) U E((i11.u25.p83==1) U (i4.i1.u3.p...231
=> equivalent forward existential formula: ([FwdG((EY(Init) * (!(E(!(!(EG(!((i13.u32.p105==1))))) U EG((i5.u12.p40==1)))) * !(E(!(EX(!(((i15.u37.p120==1)&&...470
Reverse transition relation is NOT exact ! Due to transitions t162, t166, t168, t169, t171, u51.t7, u51.t9, u51.t10, u51.t11, i3.u4.t115, i3.u5.t113, i4.i0...735
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
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,104.318,2136972,1,0,3.54831e+06,3931,2382,8.81242e+06,295,37496,2755886
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
ITS-tools command line returned an error code 139
[2024-05-22 10:52:46] [INFO ] Applying decomposition
[2024-05-22 10:52:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:52:46] [INFO ] Decomposing Gal with order
[2024-05-22 10:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:52:46] [INFO ] Removed a total of 56 redundant transitions.
[2024-05-22 10:52:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:52:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 219 labels/synchronizations in 4 ms.
[2024-05-22 10:52:46] [INFO ] Time to serialize gal into /tmp/CTLFireability16245749769466414507.gal : 2 ms
[2024-05-22 10:52:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4476876713504063251.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/CTLFireability16245749769466414507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4476876713504063251.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 10 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.7617e+09,12.1652,326284,529,1150,479187,100343,207,1.51619e+06,188,1.04273e+06,0


Converting to forward existential form...Done !
original formula: ((AF(!(E(!(((i0.i0.i0.i0.i0.u6.p12==1)&&(i1.u13.p175==1))) U ((i0.i0.i0.i0.i0.u7.p43==1)&&(i1.u14.p182==1))))) + AX(AG(((i0.i0.i0.u9.p97=...452
=> equivalent forward existential formula: [(FwdU(EY(((Init * !(!((E(!((((i0.i0.i0.i0.i0.u6.p26==1)&&(i1.u13.p175==1))&&(i0.i0.i0.i0.u8.p85==1))) U (!((!((...1017
Reverse transition relation is NOT exact ! Due to transitions t167, t169, i0.t17, i0.u11.t14, i0.u11.t20, i0.u11.t24, i0.u11.t26, i0.u11.t28, i0.u11.t30, i...933
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
Fast SCC detection found an SCC at level 2
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,141.451,2464852,1,0,3.48671e+06,1.05777e+06,530,1.09782e+07,571,8.8739e+06,4145
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(EX((((EF(((i0.i0.i0.i0.i0.u7.p53==1)&&(i1.u13.p175==1))) + EG((i0.i0.i0.u9.p112==1))) + ((i0.u11.p143==0) + ((i0.i0.i0.i0.i0.u6.p29==0...234
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((E(TRUE U ((i0.i0.i0.i0.i0.u7.p53==1)&&(i1.u13.p175==1))) + EG((i0.i0.i0.u9.p112==1))...300
(forward)formula 1,0,144.843,2464852,1,0,3.48671e+06,1.05777e+06,720,1.09782e+07,738,8.8739e+06,94439
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(AG(EF(((i0.i0.i0.i0.u8.p68==1)&&(i1.u14.p182==1))))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(EG(!(E(TRUE U !(E(TRUE U ((i0.i0.i0.i0.u8.p68==1)&&(i1.u14.p182==1)))))))))) * !(FALSE))] = FALSE
(forward)formula 2,0,145.524,2464852,1,0,3.48671e+06,1.05777e+06,741,1.09782e+07,789,8.8739e+06,134491
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((A((AX(A((u17.p0==1) U (i0.i0.i0.i0.i0.u7.p34==1))) + (i0.i0.i0.i0.u21.p4==1)) U (i0.i0.i0.i0.u8.p71!=1)) * EG(AF((i0.i0.i0.i0.u8.p85=...162
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((E(!((i0.i0.i0.i0.u8.p71!=1)) U (!((!(EX(!(!((E(!((i0.i0.i0.i0.i0.u7.p34==1)) U (!((u...380
(forward)formula 3,1,187.029,2464852,1,0,3.48671e+06,1.05777e+06,828,1.09782e+07,797,8.8739e+06,711416
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(EG((AX(A((i0.i0.i0.i0.u8.p69==1) U (i0.i0.i0.i0.u8.p85==1))) + ((i0.i0.i0.i0.i0.u7.p39==1)&&(i1.u13.p175==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EX(!(!((E(!((i0.i0.i0.i0.u8.p85==1)) U (!((i0.i0.i0.i0.u8.p69==1)) * !((i0.i0.i0.i0.u8....264
(forward)formula 4,1,187.911,2464852,1,0,3.48671e+06,1.05777e+06,863,1.09782e+07,801,8.8739e+06,744059
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(AX(A(((i0.i0.i0.u9.p102==1)&&(i1.u13.p175==1)) U ((i0.i0.i0.u9.p113==1)&&(i1.u13.p175==1))))) U (i0.i0.i0.i0.i0.u7.p36==1))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!(!((E(!(((i0.i0.i0.u9.p113==1)&&(i1.u13.p175==1))) U (!(((i0.i0.i0.u9.p102==1)&&(i1.u13.p175...308
(forward)formula 5,1,290.799,2720072,1,0,3.72232e+06,1.1984e+06,417,1.17228e+07,501,1.01354e+07,259201
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(!(A(E(E((i1.u14.p181==1) U ((i0.i0.i0.i0.i0.u6.p27==1)&&(i1.u14.p182==1))) U !(((i1.u14.p179==1)||(i0.i0.i0.u9.p99==1)))) U (i1.u13.p1...164
=> equivalent forward existential formula: ([((FwdU(EY(Init),!((i1.u13.p173==1))) * !((i1.u13.p173==1))) * !(E(E((i1.u14.p181==1) U ((i0.i0.i0.i0.i0.u6.p27...287
(forward)formula 6,0,291.778,2720072,1,0,3.72232e+06,1.1984e+06,663,1.17228e+07,765,1.01354e+07,281790
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AF(!(E((i0.i0.i0.i0.i0.u7.p45==1) U AF(((i0.i0.i0.i0.u8.p73==1)&&(i1.u13.p175==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E((i0.i0.i0.i0.i0.u7.p45==1) U !(EG(!(((i0.i0.i0.i0.u8.p73==1)&&(i1.u13.p175==1)))))))))))...165
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 7,1,348.355,2720336,1,0,3.72232e+06,1.2813e+06,740,1.17228e+07,778,1.05383e+07,758492
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(A(!(EF((i1.u16.p168!=1))) U !(((AF((i0.i0.i0.i0.u8.p76==1)) + (i0.i0.u10.p117==1)) + AX(AF(((i0.i0.i0.u9.p107==1)&&(i1.u13.p175==1))))...159
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(((!(EG(!((i0.i0.i0.i0.u8.p76==1)))) + (i0.i0.u10.p117==1)) + !(EX(!(!(EG(!(((i0.i0.i0.u9.p10...507
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 8,1,531.85,3116532,1,0,4.01641e+06,1.48905e+06,620,1.26661e+07,671,1.28672e+07,951966
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(A(AX((EG((i1.u13.p173==1)) * EF((i0.u18.p1==1)))) U E(((i1.u14.p183==1)||((i0.i0.u10.p123==1)&&((i0.i0.u10.p115==1)||(i1.u13.p174==1))...234
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(((i1.u14.p183==1)||((i0.i0.u10.p123==1)&&((i0.i0.u10.p115==1)||(i1.u13.p174==1)))) U (!(((i0...654
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 9,0,605.462,3429316,1,0,4.66393e+06,1.48905e+06,434,1.46236e+07,540,1.28672e+07,242013
FORMULA DiscoveryGPU-PT-06b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1631006 ms.

BK_STOP 1716375773336

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-06b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132500370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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