Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r198-tall-174894533000610.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ShieldPPPs-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-174894533000610
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 18K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2023-15
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-00
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-01
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-02
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-03
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-04
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-05
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-06
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-07
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-08
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-09
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-10
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749184473798

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-06 04:34:34] [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]
[2025-06-06 04:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 04:34:35] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2025-06-06 04:34:35] [INFO ] Transformed 71 places.
[2025-06-06 04:34:35] [INFO ] Transformed 66 transitions.
[2025-06-06 04:34:35] [INFO ] Found NUPN structural information;
[2025-06-06 04:34:35] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 61 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 71 cols
[2025-06-06 04:34:35] [INFO ] Computed 12 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:35] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-06 04:34:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:35] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-06 04:34:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 13 places in 769 ms of which 735 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:37] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 66/137 variables, 71/170 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:38] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/137 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:39] [INFO ] Deduced a trap along path composed of 5 places in 495 ms of which 349 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 13 (OVERLAPS) 0/137 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 174 constraints, problems are : Problem set: 0 solved, 65 unsolved in 5223 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 1/71 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 19/102 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/137 variables, 71/173 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 65/238 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:41] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:42] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:42] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:42] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:43] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:43] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:43] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:43] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:48] [INFO ] Deduced a trap along path composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 15 (OVERLAPS) 0/137 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 261 constraints, problems are : Problem set: 0 solved, 65 unsolved in 15214 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 20465ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 20480ms
Finished structural reductions in LTL mode , in 1 iterations and 20813 ms. Remains : 71/71 places, 66/66 transitions.
Support contains 61 out of 71 places after structural reductions.
[2025-06-06 04:34:56] [INFO ] Flatten gal took : 19 ms
[2025-06-06 04:34:56] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:34:56] [INFO ] Input system was already deterministic with 66 transitions.
Reduction of identical properties reduced properties to check from 69 to 63
RANDOM walk for 40000 steps (126 resets) in 1234 ms. (32 steps per ms) remains 6/63 properties
BEST_FIRST walk for 40002 steps (32 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (33 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (30 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (41 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
[2025-06-06 04:34:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 2 (OVERLAPS) 56/71 variables, 12/27 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 56/83 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:56] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 4 ms to minimize.
Problem AtomicPropp12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:56] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 2/85 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/85 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/137 variables, 71/156 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:56] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 1/157 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/137 variables, 0/157 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 157 constraints, problems are : Problem set: 5 solved, 1 unsolved in 193 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 63/68 variables, 11/16 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 63/79 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/80 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/80 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/71 variables, 1/81 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 3/84 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 2/86 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:57] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:57] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/71 variables, 2/88 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 0/88 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 66/137 variables, 71/159 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 1/160 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 1/161 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/137 variables, 0/161 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/137 variables, 0/161 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 161 constraints, problems are : Problem set: 5 solved, 1 unsolved in 196 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 71 transition count 58
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 63 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 62 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 62 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 57 transition count 52
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 31 place count 54 transition count 49
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 54 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 34 place count 54 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 53 transition count 48
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 3 with 30 rules applied. Total rules applied 66 place count 38 transition count 33
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 72 place count 38 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 37 transition count 32
Applied a total of 73 rules in 25 ms. Remains 37 /71 variables (removed 34) and now considering 32/66 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 37/71 places, 32/66 transitions.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Probably explored full state space saw : 44972 states, properties seen :0
Probabilistic random walk after 222227 steps, saw 44972 distinct states, run finished after 269 ms. (steps per millisecond=826 ) properties seen :0
Explored full state space saw : 44972 states, properties seen :0
Exhaustive walk after 222227 steps, saw 44972 distinct states, run finished after 118 ms. (steps per millisecond=1883 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2025-06-06 04:34:57] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:34:57] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:34:57] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 58 out of 71 places (down from 60) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 5 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2025-06-06 04:34:57] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 04:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:34:57] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2025-06-06 04:34:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 83 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:59] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:59] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:34:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:00] [INFO ] Deduced a trap along path composed of 14 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:00] [INFO ] Deduced a trap along path composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:01] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 150 constraints, problems are : Problem set: 0 solved, 58 unsolved in 5175 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6600ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 6601ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6690 ms. Remains : 64/71 places, 59/66 transitions.
[2025-06-06 04:35:04] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:35:04] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:35:04] [INFO ] Input system was already deterministic with 59 transitions.
[2025-06-06 04:35:04] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:04] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14147105407817603915.gal : 2 ms
[2025-06-06 04:35:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3369619198799431829.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14147105407817603915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3369619198799431829.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.4962e+06,1.00696,43620,2,5998,5,139200,6,0,317,239964,0


Converting to forward existential form...Done !
original formula: AX((A(EG(!((((p65==1)&&(p1==1))&&(p52==1)))) U (p56==1)) + (p51==1)))
=> equivalent forward existential formula: ([((FwdU((EY(Init) * !((p51==1))),!((p56==1))) * !((p56==1))) * !(EG(!((((p65==1)&&(p1==1))&&(p52==1))))))] = FA...214
Hit Full ! (commute/partial/dont) 56/0/3
(forward)formula 0,0,2.25239,74976,1,0,70,314759,22,6,1524,336246,67
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 9 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 65 cols
[2025-06-06 04:35:06] [INFO ] Computed 12 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:06] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 04:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:35:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:08] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:08] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/125 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:08] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 88 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2664 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:09] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:09] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:09] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:10] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:11] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:12] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:12] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 168 constraints, problems are : Problem set: 0 solved, 59 unsolved in 6243 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8913ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8913ms
Starting structural reductions in LTL mode, iteration 1 : 65/71 places, 60/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9023 ms. Remains : 65/71 places, 60/66 transitions.
[2025-06-06 04:35:15] [INFO ] Flatten gal took : 11 ms
[2025-06-06 04:35:15] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:15] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-06 04:35:15] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:35:15] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:15] [INFO ] Time to serialize gal into /tmp/CTLFireability14038648485531192939.gal : 1 ms
[2025-06-06 04:35:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1335165721102292834.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14038648485531192939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1335165721102292834.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.56888e+06,1.29426,56328,2,9376,5,183217,6,0,322,309948,0


Converting to forward existential form...Done !
original formula: AG(((EX(((p12==0)||(p62==0))) + !(E((p36==1) U ((p20==1)&&(p57==1))))) + ((p23==0)&&(p45==0))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(((p23==0)&&(p45==0)))) * !(EX(((p12==0)||(p62==0))))),(p36==1)) * ((p20==1)&&(p57==...168
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t27, t29, t30, t32, t33, t35, t36, t38, t39, ...258
(forward)formula 0,1,3.10421,90328,1,0,151,432056,145,67,1829,441109,130
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 51 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 51 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 38 place count 51 transition count 43
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 48 transition count 43
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 20 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
// Phase 1: matrix 28 rows 33 cols
[2025-06-06 04:35:18] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:18] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 04:35:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:35:19] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2025-06-06 04:35:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 28/61 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 0/61 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 45 constraints, problems are : Problem set: 0 solved, 26 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 28/61 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:19] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 72 constraints, problems are : Problem set: 0 solved, 26 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 584ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 585ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/71 places, 28/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 681 ms. Remains : 33/71 places, 28/66 transitions.
[2025-06-06 04:35:19] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:19] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:35:19] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-06 04:35:19] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:35:19] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:35:19] [INFO ] Time to serialize gal into /tmp/CTLFireability12074411605031872129.gal : 0 ms
[2025-06-06 04:35:19] [INFO ] Time to serialize properties into /tmp/CTLFireability16212571143260819470.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12074411605031872129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16212571143260819470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,57021,0.041368,5964,2,527,5,8685,6,0,163,13690,0


Converting to forward existential form...Done !
original formula: AF(AG(E((p53==1) U (p64!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E((p53==1) U (p64!=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t23, t26, t27, Intersection with reachable at each s...215
(forward)formula 0,0,0.647706,35576,1,0,253,153623,87,162,1036,271963,225
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 8 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 66 cols
[2025-06-06 04:35:20] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-06 04:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:35:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-06 04:35:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:21] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/127 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:21] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:21] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 92 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/127 variables, 66/99 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 60/159 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:23] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:23] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:24] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:35:24] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 167 constraints, problems are : Problem set: 0 solved, 60 unsolved in 5484 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7585ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7585ms
Starting structural reductions in LTL mode, iteration 1 : 66/71 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7699 ms. Remains : 66/71 places, 61/66 transitions.
[2025-06-06 04:35:27] [INFO ] Flatten gal took : 9 ms
[2025-06-06 04:35:27] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:28] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-06 04:35:28] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:28] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:35:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12285982011383988950.gal : 1 ms
[2025-06-06 04:35:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7944924477811238720.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12285982011383988950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7944924477811238720.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.96873e+06,1.25103,53900,2,9132,5,173357,6,0,327,296652,0


Converting to forward existential form...Done !
original formula: (A(((((p65==1) * AG(((p30==1)||(p38==1)))) * (EX(((p34==1)&&(p57==1))) * AG((p66==1)))) * AX(EG(AF(((p32==1)&&(p65==1)))))) U (p61!=1)) *...200
=> equivalent forward existential formula: [(EY((Init * !((E(!((p61!=1)) U (!(((((p65==1) * !(E(TRUE U !(((p30==1)||(p38==1)))))) * (EX(((p34==1)&&(p57==1)...338
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t17, t20, t22, t28, t31, t33, t34, t36, t37, t39, ...268
Detected timeout of ITS tools.
[2025-06-06 04:35:58] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:35:58] [INFO ] Applying decomposition
[2025-06-06 04:35:58] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph14902519209916928989.txt' '-o' '/tmp/graph14902519209916928989.bin' '-w' '/tmp/graph14902519209916928989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14902519209916928989.bin' '-l' '-1' '-v' '-w' '/tmp/graph14902519209916928989.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:35:58] [INFO ] Decomposing Gal with order
[2025-06-06 04:35:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:35:58] [INFO ] Removed a total of 9 redundant transitions.
[2025-06-06 04:35:58] [INFO ] Flatten gal took : 33 ms
[2025-06-06 04:35:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-06 04:35:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4834770907224456950.gal : 2 ms
[2025-06-06 04:35:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13973696451646742041.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4834770907224456950.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13973696451646742041.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.96873e+06,0.089243,8172,453,39,9398,262,204,12674,47,696,0


Converting to forward existential form...Done !
original formula: (A(((((u22.p65==1) * AG(((i4.u12.p30==1)||(i6.u16.p38==1)))) * (EX(((i4.u14.p34==1)&&(i7.u21.p57==1))) * AG((u22.p66==1)))) * AX(EG(AF(((...276
=> equivalent forward existential formula: [(EY((Init * !((E(!((i8.u23.p61!=1)) U (!(((((u22.p65==1) * !(E(TRUE U !(((i4.u12.p30==1)||(i6.u16.p38==1)))))) ...428
Reverse transition relation is NOT exact ! Due to transitions t31, t34, t37, u22.t9, u22.t10, u22.t11, u22.t12, i0.u0.t41, i1.i1.u5.t40, i2.u6.t39, i3.u9.t...387
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,2.29578,115180,1,0,261072,394,1129,283238,236,936,368777
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 11 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 63 cols
[2025-06-06 04:36:00] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:00] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 04:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:00] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:00] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:00] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:01] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:01] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:03] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:03] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:03] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5119ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5121ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5212 ms. Remains : 63/71 places, 58/66 transitions.
[2025-06-06 04:36:05] [INFO ] Flatten gal took : 9 ms
[2025-06-06 04:36:05] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:36:05] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-06 04:36:05] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:36:05] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:36:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14701654335023509100.gal : 0 ms
[2025-06-06 04:36:05] [INFO ] Time to serialize properties into /tmp/CTLFireability7287383957624879995.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14701654335023509100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7287383957624879995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.49598e+06,1.05405,42956,2,5935,5,136158,6,0,312,235490,0


Converting to forward existential form...Done !
original formula: EF((AX(EF((p60==1))) * AG(((((p3==0)||(p22==0))&&(p54==1))&&((p14==1)&&(p49==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(!(E(TRUE U (p60==1)))))) * !(E(TRUE U !(((((p3==0)||(p22==0))&&(p54==1))&&((p14==1)&&(...178
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t29, t31, t32, t34, t35, t37, t38, t39, Inte...248
(forward)formula 0,0,1.93818,51020,1,0,138,210172,138,61,1807,235490,126
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 4 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2025-06-06 04:36:07] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 04:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2025-06-06 04:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 83 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 58/141 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:10] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:10] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:10] [INFO ] Deduced a trap along path composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:10] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:11] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 12 (OVERLAPS) 0/123 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 154 constraints, problems are : Problem set: 0 solved, 58 unsolved in 5269 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6605ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 6605ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6688 ms. Remains : 64/71 places, 59/66 transitions.
[2025-06-06 04:36:14] [INFO ] Flatten gal took : 9 ms
[2025-06-06 04:36:14] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:36:14] [INFO ] Input system was already deterministic with 59 transitions.
[2025-06-06 04:36:14] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:36:14] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:36:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8767627268810594215.gal : 0 ms
[2025-06-06 04:36:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7139731143362446723.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8767627268810594215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7139731143362446723.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.99973e+06,1.05024,41660,2,5923,5,130654,6,0,317,227811,0


Converting to forward existential form...Done !
original formula: (EF(EX(((((p25==1)&&(p43==1))&&(((p18==1)&&(p42==1))||((p30==1)&&(p29==1))))||(p5==1)))) * EX(A(AF(AX((p6==1))) U EX((A((p4==1) U (p53==1...177
=> equivalent forward existential formula: [((EY((Init * E(TRUE U EX(((((p25==1)&&(p43==1))&&(((p18==1)&&(p42==1))||((p30==1)&&(p29==1))))||(p5==1)))))) * ...491
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t21, t30, t32, t33, t35, t36, t38, t39, t40, ...253
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-06 04:36:44] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:36:44] [INFO ] Applying decomposition
[2025-06-06 04:36:44] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph2548207802303035849.txt' '-o' '/tmp/graph2548207802303035849.bin' '-w' '/tmp/graph2548207802303035849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2548207802303035849.bin' '-l' '-1' '-v' '-w' '/tmp/graph2548207802303035849.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:36:44] [INFO ] Decomposing Gal with order
[2025-06-06 04:36:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:36:44] [INFO ] Removed a total of 9 redundant transitions.
[2025-06-06 04:36:44] [INFO ] Flatten gal took : 6 ms
[2025-06-06 04:36:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 04:36:44] [INFO ] Time to serialize gal into /tmp/CTLFireability18150207503471681173.gal : 1 ms
[2025-06-06 04:36:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10253579897478074226.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18150207503471681173.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10253579897478074226.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,3.99973e+06,0.120402,9648,431,34,12858,228,209,16172,46,702,0


Converting to forward existential form...Done !
original formula: (EF(EX(((((i3.u10.p25==1)&&(i6.u16.p43==1))&&(((i2.u8.p18==1)&&(i6.u15.p42==1))||((i4.u12.p30==1)&&(i4.u12.p29==1))))||(i0.u1.p5==1)))) *...250
=> equivalent forward existential formula: [((EY((Init * E(TRUE U EX(((((i3.u10.p25==1)&&(i6.u16.p43==1))&&(((i2.u8.p18==1)&&(i6.u15.p42==1))||((i4.u12.p30...622
Reverse transition relation is NOT exact ! Due to transitions t30, t33, t36, u19.t6, u19.t7, u19.t8, u19.t9, u22.t10, u22.t11, u22.t12, i0.u0.t40, i1.i1.u5...350
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
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,3.50987,164784,1,0,352348,387,1078,467327,233,1098,513716
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 68 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 68 transition count 63
Applied a total of 6 rules in 7 ms. Remains 68 /71 variables (removed 3) and now considering 63/66 (removed 3) transitions.
// Phase 1: matrix 63 rows 68 cols
[2025-06-06 04:36:48] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-06 04:36:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:36:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-06 04:36:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/131 variables, 68/91 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:49] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:49] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:49] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:50] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 95 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2643 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:50] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 63/131 variables, 68/94 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 62/156 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:51] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:52] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:52] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:36:55] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/131 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/131 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 170 constraints, problems are : Problem set: 0 solved, 62 unsolved in 8616 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 11262ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 11263ms
Starting structural reductions in LTL mode, iteration 1 : 68/71 places, 63/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11352 ms. Remains : 68/71 places, 63/66 transitions.
[2025-06-06 04:36:59] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:36:59] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:36:59] [INFO ] Input system was already deterministic with 63 transitions.
[2025-06-06 04:36:59] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:36:59] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:36:59] [INFO ] Time to serialize gal into /tmp/CTLFireability625759539872942325.gal : 1 ms
[2025-06-06 04:36:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9023750043050562485.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability625759539872942325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9023750043050562485.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,4.60492e+06,1.58113,61868,2,5612,5,192399,6,0,337,389546,0


Converting to forward existential form...Done !
original formula: ((EX(AF(EX(((p18==0)||(p42==0))))) * A(((AF(((A(((p18==1)&&(p42==1)) U ((p25==1)&&(p40==1))) + (p23==1)) + (p47==1))) + ((AF(((p55==1)||(...470
=> equivalent forward existential formula: (([(Init * !(EX(!(EG(!(EX(((p18==0)||(p42==0)))))))))] = FALSE * (([((FwdU(Init,!((!(!(EX(!(((!((p20==1)&&(p57==...1411
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t17, t23, t25, t27, t28, t30, t33, t35, t36, ...283
Detected timeout of ITS tools.
[2025-06-06 04:37:29] [INFO ] Flatten gal took : 9 ms
[2025-06-06 04:37:29] [INFO ] Applying decomposition
[2025-06-06 04:37:29] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph15196509419347669175.txt' '-o' '/tmp/graph15196509419347669175.bin' '-w' '/tmp/graph15196509419347669175.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15196509419347669175.bin' '-l' '-1' '-v' '-w' '/tmp/graph15196509419347669175.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:37:29] [INFO ] Decomposing Gal with order
[2025-06-06 04:37:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:37:29] [INFO ] Removed a total of 9 redundant transitions.
[2025-06-06 04:37:29] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 04:37:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16113087224707048867.gal : 1 ms
[2025-06-06 04:37:29] [INFO ] Time to serialize properties into /tmp/CTLFireability14930748453481906632.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16113087224707048867.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14930748453481906632.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.60492e+06,0.126029,9752,522,50,12304,234,207,18708,45,939,0


Converting to forward existential form...Done !
original formula: ((EX(AF(EX(((i2.u8.p18==0)||(i5.u16.p42==0))))) * A(((AF(((A(((i2.u8.p18==1)&&(i5.u16.p42==1)) U ((i3.u10.p25==1)&&(i5.u16.p40==1))) + (i...679
=> equivalent forward existential formula: (([(Init * !(EX(!(EG(!(EX(((i2.u8.p18==0)||(i5.u16.p42==0)))))))))] = FALSE * (([((FwdU(Init,!((!(!(EX(!(((!((i2...1923
Reverse transition relation is NOT exact ! Due to transitions t33, t36, t39, u20.t7, u20.t8, u20.t9, u20.t10, i0.u0.t43, i1.i1.u5.t42, i1.i1.u18.t27, i1.i1...429
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,5.11246,219672,1,0,483401,464,1083,571883,232,1350,678083
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 5 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 63 cols
[2025-06-06 04:37:34] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:34] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 04:37:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:37:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:35] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:36] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:36] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:36] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:36] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:37] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:37] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:37] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3537 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 4961ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4962ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5037 ms. Remains : 63/71 places, 58/66 transitions.
[2025-06-06 04:37:39] [INFO ] Flatten gal took : 7 ms
[2025-06-06 04:37:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:37:39] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-06 04:37:39] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:37:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:37:39] [INFO ] Time to serialize gal into /tmp/CTLFireability1267325032792059197.gal : 0 ms
[2025-06-06 04:37:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2825845360812462533.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1267325032792059197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2825845360812462533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.49598e+06,1.04215,42940,2,5935,5,136158,6,0,312,235490,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,1.04342,42940,1,0,6,136158,7,1,393,235490,1
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 62 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 34 place count 50 transition count 45
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 50 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 40 place count 50 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 48 transition count 43
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 14 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
// Phase 1: matrix 28 rows 33 cols
[2025-06-06 04:37:40] [INFO ] Computed 12 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-06 04:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:40] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:37:40] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2025-06-06 04:37:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 28/61 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 45 constraints, problems are : Problem set: 0 solved, 27 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 1/33 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 28/61 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:41] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:41] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 74 constraints, problems are : Problem set: 0 solved, 27 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1175ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1175ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/71 places, 28/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1261 ms. Remains : 33/71 places, 28/66 transitions.
[2025-06-06 04:37:42] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:37:42] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:37:42] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-06 04:37:42] [INFO ] Flatten gal took : 3 ms
[2025-06-06 04:37:42] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:37:42] [INFO ] Time to serialize gal into /tmp/CTLFireability6906894623748848176.gal : 1 ms
[2025-06-06 04:37:42] [INFO ] Time to serialize properties into /tmp/CTLFireability5248238920529599169.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6906894623748848176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5248238920529599169.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,36610,0.053589,6224,2,606,5,9051,6,0,162,15292,0


Converting to forward existential form...Done !
original formula: EG(EF((p50==0)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p50==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t19, t21, t24, t25, t26, t27, Intersection with reachabl...226
(forward)formula 0,1,0.136791,9296,1,0,92,25377,81,37,1092,32631,83
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 62
Applied a total of 8 rules in 1 ms. Remains 67 /71 variables (removed 4) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 67 cols
[2025-06-06 04:37:42] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 04:37:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:37:42] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 04:37:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 62/129 variables, 67/88 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:43] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:43] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:43] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:43] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:43] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:44] [INFO ] Deduced a trap along path composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 94 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2557 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:44] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:45] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:45] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 62/129 variables, 67/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:45] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:45] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:46] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:46] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:49] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/129 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:37:52] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/129 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 16 (OVERLAPS) 0/129 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 169 constraints, problems are : Problem set: 0 solved, 61 unsolved in 11391 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 13952ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 13952ms
Starting structural reductions in LTL mode, iteration 1 : 67/71 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14032 ms. Remains : 67/71 places, 62/66 transitions.
[2025-06-06 04:37:56] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:37:56] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:37:56] [INFO ] Input system was already deterministic with 62 transitions.
[2025-06-06 04:37:56] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:37:56] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:37:56] [INFO ] Time to serialize gal into /tmp/CTLFireability11135574048050785563.gal : 0 ms
[2025-06-06 04:37:56] [INFO ] Time to serialize properties into /tmp/CTLFireability1211214076863764652.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11135574048050785563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1211214076863764652.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.07635e+06,1.24294,51452,2,4416,5,162009,6,0,332,314515,0


Converting to forward existential form...Done !
original formula: (EF(((((AG((p51==0)) * ((p20==0)||(p56==0))) * ((p0==0)&&(p55==0))) + (EG(((p32==0)||(p68==0))) * EG((p59==0)))) * AX((p37==0)))) * !(E(!...183
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((((!(E(TRUE U !((p51==0)))) * ((p20==0)||(p56==0))) * ((p0==0)&&(p55==0))) + (EG(((p32==0)...277
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t22, t24, t29, t31, t32, t34, t35, t37, t38, ...268
Detected timeout of ITS tools.
[2025-06-06 04:38:26] [INFO ] Flatten gal took : 8 ms
[2025-06-06 04:38:26] [INFO ] Applying decomposition
[2025-06-06 04:38:26] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph3702749749657821147.txt' '-o' '/tmp/graph3702749749657821147.bin' '-w' '/tmp/graph3702749749657821147.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3702749749657821147.bin' '-l' '-1' '-v' '-w' '/tmp/graph3702749749657821147.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:38:26] [INFO ] Decomposing Gal with order
[2025-06-06 04:38:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:38:26] [INFO ] Removed a total of 9 redundant transitions.
[2025-06-06 04:38:26] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:38:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 04:38:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1461310142983714683.gal : 1 ms
[2025-06-06 04:38:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15601310590141646898.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1461310142983714683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15601310590141646898.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.07635e+06,0.108788,9204,465,41,11783,151,220,15457,46,553,0


Converting to forward existential form...Done !
original formula: (EF(((((AG((i7.u19.p51==0)) * ((i2.u6.p20==0)||(u18.p56==0))) * ((i0.u1.p0==0)&&(u18.p55==0))) + (EG(((i4.u12.p32==0)||(i8.u23.p68==0))) ...251
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((((!(E(TRUE U !((i7.u19.p51==0)))) * ((i2.u6.p20==0)||(u18.p56==0))) * ((i0.u1.p0==0)&&(u1...345
Reverse transition relation is NOT exact ! Due to transitions t32, t35, t38, u18.t6, u18.t7, u18.t8, u18.t9, i0.u0.t42, i2.u5.t40, i3.u8.t37, i4.u11.t34, i...387
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,4.74547,220276,1,0,471694,393,1123,569494,237,1010,575114
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 67 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 67 transition count 62
Applied a total of 8 rules in 1 ms. Remains 67 /71 variables (removed 4) and now considering 62/66 (removed 4) transitions.
// Phase 1: matrix 62 rows 67 cols
[2025-06-06 04:38:31] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 04:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:38:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2025-06-06 04:38:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:31] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:32] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 62/129 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1731 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:33] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 62/129 variables, 67/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 61/155 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:33] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:33] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:33] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 5/160 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:34] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:34] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:38:35] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 163 constraints, problems are : Problem set: 0 solved, 61 unsolved in 6125 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7863ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7863ms
Starting structural reductions in LTL mode, iteration 1 : 67/71 places, 62/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7936 ms. Remains : 67/71 places, 62/66 transitions.
[2025-06-06 04:38:39] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:38:39] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:38:39] [INFO ] Input system was already deterministic with 62 transitions.
[2025-06-06 04:38:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:38:39] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:38:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6927073596391738853.gal : 1 ms
[2025-06-06 04:38:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14948205564841946734.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6927073596391738853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14948205564841946734.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.07633e+06,1.26308,56780,2,10687,5,180858,6,0,332,319584,0


Converting to forward existential form...Done !
original formula: (((AX(EG((p61==1))) + AX(((EG((p8==1)) * EF((p8==1))) * ((p69==1)&&(p50==0))))) + (EX((p13==1)) + EG(EX(EF((p58==1)))))) + (EG(((E((p53==...231
=> equivalent forward existential formula: (([(EY((((Init * !((EG(((E((p53==1) U (p60==1)) + EX((p55==1))) * E(TRUE U ((p25==0)||(p43==0))))) * EG((p45==0)...731
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t17, t20, t22, t29, t31, t32, t34, t35, t37, t38, ...268
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-06-06 04:39:09] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:09] [INFO ] Applying decomposition
[2025-06-06 04:39:09] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph2770959350321072531.txt' '-o' '/tmp/graph2770959350321072531.bin' '-w' '/tmp/graph2770959350321072531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2770959350321072531.bin' '-l' '-1' '-v' '-w' '/tmp/graph2770959350321072531.weights' '-q' '0' '-e' '0.001'
[2025-06-06 04:39:09] [INFO ] Decomposing Gal with order
[2025-06-06 04:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 04:39:09] [INFO ] Removed a total of 9 redundant transitions.
[2025-06-06 04:39:09] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:39:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-06 04:39:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7200741695992266375.gal : 1 ms
[2025-06-06 04:39:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10288420506190646481.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7200741695992266375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10288420506190646481.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.07633e+06,0.119442,9616,482,50,12314,256,218,17520,46,1046,0


Converting to forward existential form...Done !
original formula: (((AX(EG((i8.u24.p61==1))) + AX(((EG((i1.i1.u3.p8==1)) * EF((i1.i1.u3.p8==1))) * ((i8.u24.p69==1)&&(i6.u19.p50==0))))) + (EX((i1.i1.u5.p1...328
=> equivalent forward existential formula: (([(EY((((Init * !((EG(((E((i6.u20.p53==1) U (i8.u22.p60==1)) + EX((i6.u20.p55==1))) * E(TRUE U ((i3.u11.p25==0)...958
Reverse transition relation is NOT exact ! Due to transitions t32, t35, t38, u23.t10, u23.t11, u23.t12, i0.u0.t42, i1.i1.u5.t41, i2.u6.t40, i3.u9.t37, i4.u...390
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.38221,162576,1,0,359288,443,1199,402008,243,1156,479610
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 2 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
// Phase 1: matrix 58 rows 63 cols
[2025-06-06 04:39:12] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-06 04:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2025-06-06 04:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:12] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:13] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:13] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 82 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:14] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 58/121 variables, 63/83 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 57/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:14] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:14] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:14] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:15] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:15] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 148 constraints, problems are : Problem set: 0 solved, 57 unsolved in 3635 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5053ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 5054ms
Starting structural reductions in LTL mode, iteration 1 : 63/71 places, 58/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5137 ms. Remains : 63/71 places, 58/66 transitions.
[2025-06-06 04:39:17] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:17] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:17] [INFO ] Input system was already deterministic with 58 transitions.
[2025-06-06 04:39:17] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:17] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:39:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14980778160140041288.gal : 0 ms
[2025-06-06 04:39:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8269033079918923055.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14980778160140041288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8269033079918923055.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.49598e+06,1.0321,42968,2,5935,5,136158,6,0,312,235490,0


Converting to forward existential form...Done !
original formula: AG(AX((p50==1)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p50==1)))] = FALSE
(forward)formula 0,0,1.09243,42968,1,0,10,136158,9,2,526,235490,2
FORMULA ShieldPPPs-PT-001B-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 2 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 65 cols
[2025-06-06 04:39:18] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 04:39:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:18] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2025-06-06 04:39:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:20] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:20] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:20] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 89 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2304 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/125 variables, 65/87 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 59/146 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 6/152 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:21] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/125 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 157 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5342 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 7650ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 7650ms
Starting structural reductions in LTL mode, iteration 1 : 65/71 places, 60/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7728 ms. Remains : 65/71 places, 60/66 transitions.
[2025-06-06 04:39:26] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:39:26] [INFO ] Flatten gal took : 6 ms
[2025-06-06 04:39:26] [INFO ] Input system was already deterministic with 60 transitions.
[2025-06-06 04:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:39:26] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:39:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14428690209710376348.gal : 0 ms
[2025-06-06 04:39:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12339992206627993254.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14428690209710376348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12339992206627993254.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.9736e+06,1.23264,49956,2,6756,5,165984,6,0,322,278231,0


Converting to forward existential form...Done !
original formula: ((AF(((((p8==1)&&(p39==1))||((p14==1)&&(p49==1)))||(p2==1))) + EX(AG((p59==1)))) + ((EG(AF(((p15==1)&&(p48==1)))) * EF((p42==0))) * EG(AG...168
=> equivalent forward existential formula: [FwdG(((Init * !(((EG(!(EG(!(((p15==1)&&(p48==1)))))) * E(TRUE U (p42==0))) * EG(!(E(TRUE U !((p60==1)))))))) * ...255
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t22, t24, t31, t33, t34, t36, t37, t39, t40, ...258
Hit Full ! (commute/partial/dont) 51/15/9
(forward)formula 0,1,2.86118,84540,1,0,208,379496,162,71,2016,393021,202
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 2 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 66 cols
[2025-06-06 04:39:29] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:29] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-06 04:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:29] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-06 04:39:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:29] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:29] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:29] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:29] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:30] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 61/127 variables, 66/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:30] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/127 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 87 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:31] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/127 variables, 66/90 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 60/150 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:32] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:32] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:32] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:33] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:34] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:34] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:34] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:35] [INFO ] Deduced a trap along path composed of 11 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:35] [INFO ] Deduced a trap along path composed of 5 places in 15 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:35] [INFO ] Deduced a trap along path composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/127 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 18 (OVERLAPS) 0/127 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 168 constraints, problems are : Problem set: 0 solved, 60 unsolved in 6879 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8904ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 8905ms
Starting structural reductions in LTL mode, iteration 1 : 66/71 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8978 ms. Remains : 66/71 places, 61/66 transitions.
[2025-06-06 04:39:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:38] [INFO ] Input system was already deterministic with 61 transitions.
[2025-06-06 04:39:38] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:39:38] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:38] [INFO ] Time to serialize gal into /tmp/CTLFireability7964234639624350389.gal : 0 ms
[2025-06-06 04:39:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4455757999843161348.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7964234639624350389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4455757999843161348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.01001e+06,1.2079,51168,2,3936,5,160210,6,0,327,314254,0


Converting to forward existential form...Done !
original formula: EF((EX((AG(((p15==0)||(p48==0))) * ((p18==0)||(p43==0)))) * ((EF((((p12==0)||(p62==0))&&(p36==0))) + (p51==1)) + ((((p19==1)&&(p21==1))&&...202
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * EX((!(E(TRUE U !(((p15==0)||(p48==0))))) * ((p18==0)||(p43==0))))),TRUE) * (((p12==0...475
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t16, t22, t24, t28, t31, t33, t34, t36, t37, t39, ...268
(forward)formula 0,1,3.40799,104188,1,0,190,475882,147,87,1996,637823,183
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 42 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 46 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 32 transition count 27
Applied a total of 75 rules in 9 ms. Remains 32 /71 variables (removed 39) and now considering 27/66 (removed 39) transitions.
// Phase 1: matrix 27 rows 32 cols
[2025-06-06 04:39:41] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:41] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 04:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 04:39:41] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2025-06-06 04:39:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 27/59 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 0/59 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 44 constraints, problems are : Problem set: 0 solved, 25 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 27/59 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 25/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:42] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/59 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 70 constraints, problems are : Problem set: 0 solved, 25 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 660ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/71 places, 27/66 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 752 ms. Remains : 32/71 places, 27/66 transitions.
[2025-06-06 04:39:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:42] [INFO ] Input system was already deterministic with 27 transitions.
[2025-06-06 04:39:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:42] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13994766111853927876.gal : 1 ms
[2025-06-06 04:39:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16374584314570101156.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13994766111853927876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16374584314570101156.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,44099,0.040068,5568,2,474,5,7431,6,0,158,11844,0


Converting to forward existential form...Done !
original formula: EG((p17==0))
=> equivalent forward existential formula: [FwdG(Init,(p17==0))] != FALSE
Hit Full ! (commute/partial/dont) 25/0/2
(forward)formula 0,0,0.104263,8128,1,0,13,23875,19,3,792,23008,12
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 6 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
// Phase 1: matrix 59 rows 64 cols
[2025-06-06 04:39:42] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 04:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 04:39:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2025-06-06 04:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 59/123 variables, 64/83 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:43] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:44] [INFO ] Deduced a trap along path composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/123 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 86 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2173 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/123 variables, 64/90 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:45] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 5/153 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:46] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:46] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:47] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:47] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:48] [INFO ] Deduced a trap along path composed of 19 places in 29 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 04:39:48] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/123 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 14 (OVERLAPS) 0/123 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 163 constraints, problems are : Problem set: 0 solved, 58 unsolved in 7188 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 9365ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 9365ms
Starting structural reductions in LTL mode, iteration 1 : 64/71 places, 59/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9451 ms. Remains : 64/71 places, 59/66 transitions.
[2025-06-06 04:39:52] [INFO ] Flatten gal took : 5 ms
[2025-06-06 04:39:52] [INFO ] Flatten gal took : 4 ms
[2025-06-06 04:39:52] [INFO ] Input system was already deterministic with 59 transitions.
[2025-06-06 04:39:52] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:39:52] [INFO ] Flatten gal took : 1 ms
[2025-06-06 04:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15473176566231690972.gal : 0 ms
[2025-06-06 04:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6885343214798574980.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15473176566231690972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6885343214798574980.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.51718e+06,0.969867,41556,2,3363,5,128620,6,0,317,245770,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((((p9==0)&&(p47==0))&&((p34==1)&&(p57==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((((p9==0)&&(p47==0))&&((p34==1)&&(p57==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t20, t24, t25, t30, t32, t33, t35, t36, t38, t39, ...258
(forward)formula 0,0,2.65508,87344,1,0,226,323240,144,66,1957,526656,216
FORMULA ShieldPPPs-PT-001B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-06 04:39:54] [INFO ] Flatten gal took : 2 ms
[2025-06-06 04:39:54] [INFO ] Flatten gal took : 2 ms
Total runtime 320034 ms.

BK_STOP 1749184794991

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="ShieldPPPs-PT-001B"
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-5832"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-001B, 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 r198-tall-174894533000610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001B.tgz
mv ShieldPPPs-PT-001B 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.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 ;