Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490700082.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 StigmergyCommit-PT-07a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490700082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 5.4M May 29 14:33 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 StigmergyCommit-PT-07a-CTLFireability-2023-12
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2023-13
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2023-14
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2023-15
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-00
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-01
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-02
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-03
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-04
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-05
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-06
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-07
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-08
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-09
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-10
FORMULA_NAME StigmergyCommit-PT-07a-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1749082085075

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-05 00:08:07] [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-05 00:08:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 00:08:07] [INFO ] Load time of PNML (sax parser for PT used): 744 ms
[2025-06-05 00:08:07] [INFO ] Transformed 292 places.
[2025-06-05 00:08:08] [INFO ] Transformed 7108 transitions.
[2025-06-05 00:08:08] [INFO ] Found NUPN structural information;
[2025-06-05 00:08:08] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 975 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Support contains 14 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 229 transition count 819
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 229 transition count 819
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 134 place count 229 transition count 811
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 166 place count 197 transition count 771
Iterating global reduction 1 with 32 rules applied. Total rules applied 198 place count 197 transition count 771
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 206 place count 197 transition count 763
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 190 transition count 756
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 190 transition count 756
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 227 place count 183 transition count 749
Iterating global reduction 2 with 7 rules applied. Total rules applied 234 place count 183 transition count 749
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 241 place count 176 transition count 742
Iterating global reduction 2 with 7 rules applied. Total rules applied 248 place count 176 transition count 742
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 255 place count 169 transition count 735
Iterating global reduction 2 with 7 rules applied. Total rules applied 262 place count 169 transition count 735
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 269 place count 169 transition count 728
Applied a total of 269 rules in 148 ms. Remains 169 /292 variables (removed 123) and now considering 728/890 (removed 162) transitions.
[2025-06-05 00:08:08] [INFO ] Flow matrix only has 719 transitions (discarded 9 similar events)
// Phase 1: matrix 719 rows 169 cols
[2025-06-05 00:08:08] [INFO ] Computed 2 invariants in 34 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:08:08] [INFO ] Implicit Places using invariants in 472 ms returned []
[2025-06-05 00:08:08] [INFO ] Flow matrix only has 719 transitions (discarded 9 similar events)
[2025-06-05 00:08:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:08:09] [INFO ] State equation strengthened by 584 read => feed constraints.
[2025-06-05 00:08:10] [INFO ] Implicit Places using invariants and state equation in 1181 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
Running 727 sub problems to find dead transitions.
[2025-06-05 00:08:10] [INFO ] Flow matrix only has 719 transitions (discarded 9 similar events)
[2025-06-05 00:08:10] [INFO ] Invariant cache hit.
[2025-06-05 00:08:10] [INFO ] State equation strengthened by 584 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 727 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:21] [INFO ] Deduced a trap composed of 14 places in 314 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:21] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:22] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:22] [INFO ] Deduced a trap composed of 14 places in 288 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:22] [INFO ] Deduced a trap composed of 14 places in 275 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:22] [INFO ] Deduced a trap composed of 14 places in 297 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:23] [INFO ] Deduced a trap composed of 14 places in 347 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:23] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:23] [INFO ] Deduced a trap composed of 14 places in 303 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:24] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:24] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:24] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:25] [INFO ] Deduced a trap composed of 14 places in 253 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:25] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:25] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:25] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:25] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:25] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:26] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:26] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:27] [INFO ] Deduced a trap composed of 14 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:27] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:27] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:27] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:27] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:28] [INFO ] Deduced a trap composed of 14 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:29] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:29] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:29] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:29] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:29] [INFO ] Deduced a trap composed of 14 places in 212 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:30] [INFO ] Deduced a trap composed of 14 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:30] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:30] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:34] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:34] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:34] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:34] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:35] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:35] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:35] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:35] [INFO ] Deduced a trap composed of 16 places in 300 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:36] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:36] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:36] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:37] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:37] [INFO ] Deduced a trap composed of 16 places in 322 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:37] [INFO ] Deduced a trap composed of 16 places in 310 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:38] [INFO ] Deduced a trap composed of 16 places in 265 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:38] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:38] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:38] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:39] [INFO ] Deduced a trap composed of 16 places in 323 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:39] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 727 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:40] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:40] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:40] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:41] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:41] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:42] [INFO ] Deduced a trap composed of 16 places in 352 ms of which 28 ms to minimize.
SMT process timed out in 31877ms, After SMT, problems are : Problem set: 0 solved, 727 unsolved
Search for dead transitions found 0 dead transitions in 31916ms
Starting structural reductions in LTL mode, iteration 1 : 169/292 places, 728/890 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33811 ms. Remains : 169/292 places, 728/890 transitions.
Support contains 14 out of 169 places after structural reductions.
[2025-06-05 00:08:42] [INFO ] Flatten gal took : 253 ms
[2025-06-05 00:08:42] [INFO ] Flatten gal took : 135 ms
[2025-06-05 00:08:43] [INFO ] Input system was already deterministic with 728 transitions.
Reduction of identical properties reduced properties to check from 14 to 8
RANDOM walk for 40000 steps (14 resets) in 3979 ms. (10 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 479 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
[2025-06-05 00:08:44] [INFO ] Flow matrix only has 719 transitions (discarded 9 similar events)
[2025-06-05 00:08:44] [INFO ] Invariant cache hit.
[2025-06-05 00:08:44] [INFO ] State equation strengthened by 584 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 159/168 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:45] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:45] [INFO ] Deduced a trap composed of 14 places in 468 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:46] [INFO ] Deduced a trap composed of 14 places in 464 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:46] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:46] [INFO ] Deduced a trap composed of 14 places in 369 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:47] [INFO ] Deduced a trap composed of 14 places in 428 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:47] [INFO ] Deduced a trap composed of 14 places in 380 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:48] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:48] [INFO ] Deduced a trap composed of 14 places in 333 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:48] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:49] [INFO ] Deduced a trap composed of 14 places in 402 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:08:49] [INFO ] Deduced a trap composed of 14 places in 330 ms of which 19 ms to minimize.
SMT process timed out in 5117ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 728/728 transitions.
Graph (complete) has 467 edges and 169 vertex of which 168 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 168 transition count 695
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 63 place count 153 transition count 680
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 63 place count 153 transition count 646
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 131 place count 119 transition count 646
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 139 place count 111 transition count 638
Iterating global reduction 2 with 8 rules applied. Total rules applied 147 place count 111 transition count 638
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 102 transition count 629
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 102 transition count 629
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 101 transition count 628
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 101 transition count 628
Performed 32 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 231 place count 69 transition count 595
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 247 place count 69 transition count 579
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 262 place count 54 transition count 564
Iterating global reduction 3 with 15 rules applied. Total rules applied 277 place count 54 transition count 564
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 532 place count 54 transition count 309
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 540 place count 46 transition count 301
Iterating global reduction 4 with 8 rules applied. Total rules applied 548 place count 46 transition count 301
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 556 place count 38 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 564 place count 38 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 565 place count 37 transition count 292
Reduce places removed 1 places and 0 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 4 with 10 rules applied. Total rules applied 575 place count 36 transition count 283
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 584 place count 27 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 584 place count 27 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 586 place count 26 transition count 282
Performed 8 Post agglomeration using F-continuation condition with reduction of 247 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 602 place count 18 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 610 place count 18 transition count 19
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 633 place count 3 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 641 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 641 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 643 place count 2 transition count 2
Applied a total of 643 rules in 380 ms. Remains 2 /169 variables (removed 167) and now considering 2/728 (removed 726) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 2/169 places, 2/728 transitions.
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-05 00:08:50] [INFO ] Flatten gal took : 127 ms
[2025-06-05 00:08:50] [INFO ] Flatten gal took : 104 ms
[2025-06-05 00:08:50] [INFO ] Input system was already deterministic with 728 transitions.
Computed a total of 50 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 76 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:08:50] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:08:50] [INFO ] Computed 2 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:08:50] [INFO ] Implicit Places using invariants in 234 ms returned []
[2025-06-05 00:08:50] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:08:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:08:51] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:08:56] [INFO ] Implicit Places using invariants and state equation in 5778 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6018 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 140 transition count 699
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 140 transition count 699
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 51 place count 140 transition count 692
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 132 transition count 684
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 132 transition count 684
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 75 place count 124 transition count 676
Iterating global reduction 1 with 8 rules applied. Total rules applied 83 place count 124 transition count 676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 91 place count 116 transition count 668
Iterating global reduction 1 with 8 rules applied. Total rules applied 99 place count 116 transition count 668
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 107 place count 108 transition count 660
Iterating global reduction 1 with 8 rules applied. Total rules applied 115 place count 108 transition count 660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 101 transition count 653
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 101 transition count 653
Applied a total of 129 rules in 42 ms. Remains 101 /162 variables (removed 61) and now considering 653/721 (removed 68) transitions.
[2025-06-05 00:08:56] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
// Phase 1: matrix 644 rows 101 cols
[2025-06-05 00:08:56] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:08:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-06-05 00:08:56] [INFO ] Flow matrix only has 644 transitions (discarded 9 similar events)
[2025-06-05 00:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:08:57] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:08:57] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/169 places, 653/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6604 ms. Remains : 101/169 places, 653/728 transitions.
[2025-06-05 00:08:57] [INFO ] Flatten gal took : 64 ms
[2025-06-05 00:08:57] [INFO ] Flatten gal took : 69 ms
[2025-06-05 00:08:57] [INFO ] Input system was already deterministic with 653 transitions.
[2025-06-05 00:08:57] [INFO ] Flatten gal took : 65 ms
[2025-06-05 00:08:57] [INFO ] Flatten gal took : 65 ms
[2025-06-05 00:08:57] [INFO ] Time to serialize gal into /tmp/CTLFireability5711618781065689179.gal : 71 ms
[2025-06-05 00:08:57] [INFO ] Time to serialize properties into /tmp/CTLFireability7578950694929548371.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5711618781065689179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7578950694929548371.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,7.80253e+06,3.5318,68420,2,4666,5,69854,6,0,1048,45938,0


Converting to forward existential form...Done !
original formula: EG(E((EX((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))||(p84==1))) * E(AF(((((p30==...669
=> equivalent forward existential formula: [FwdG(Init,E((EX((((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1...724
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...460
Detected timeout of ITS tools.
[2025-06-05 00:09:27] [INFO ] Flatten gal took : 65 ms
[2025-06-05 00:09:27] [INFO ] Applying decomposition
[2025-06-05 00:09:28] [INFO ] Flatten gal took : 62 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/graph4959162672827059895.txt' '-o' '/tmp/graph4959162672827059895.bin' '-w' '/tmp/graph4959162672827059895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4959162672827059895.bin' '-l' '-1' '-v' '-w' '/tmp/graph4959162672827059895.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:09:28] [INFO ] Decomposing Gal with order
[2025-06-05 00:09:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:09:28] [INFO ] Removed a total of 4139 redundant transitions.
[2025-06-05 00:09:28] [INFO ] Flatten gal took : 250 ms
[2025-06-05 00:09:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 117 ms.
[2025-06-05 00:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14530544559615515863.gal : 23 ms
[2025-06-05 00:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9623804718642125000.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/CTLFireability14530544559615515863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9623804718642125000.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,7.80253e+06,2.51348,45620,1744,25,32734,283,847,315823,56,958,0


Converting to forward existential form...Done !
original formula: EG(E((EX((((((i1.u0.p30==1)&&(i1.u8.p66==1))&&((i1.u14.p102==1)&&(i1.u4.p138==1)))&&(((i1.u24.p174==1)&&(i1.u29.p210==1))&&((i1.u20.p246=...997
=> equivalent forward existential formula: [FwdG(Init,E((EX((((((i1.u0.p30==1)&&(i1.u8.p66==1))&&((i1.u14.p102==1)&&(i1.u4.p138==1)))&&(((i1.u24.p174==1)&&...1052
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t6, t8, t11, t14, t18, t21, t23, t28, t34, t637, t639, t641, t643, t645, t647, t649, ...638
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,28.2642,361396,1,0,659887,325,12967,1.23905e+06,278,1115,2175464
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 36 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:09:57] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:09:57] [INFO ] Computed 2 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:09:57] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-06-05 00:09:57] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:09:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:09:57] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:10:03] [INFO ] Implicit Places using invariants and state equation in 6000 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 40 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:10:03] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:10:03] [INFO ] Computed 1 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:10:03] [INFO ] Implicit Places using invariants in 103 ms returned []
[2025-06-05 00:10:03] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:10:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:10:04] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:10:04] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6759 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:10:04] [INFO ] Flatten gal took : 47 ms
[2025-06-05 00:10:04] [INFO ] Flatten gal took : 45 ms
[2025-06-05 00:10:04] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:10:04] [INFO ] Flatten gal took : 41 ms
[2025-06-05 00:10:04] [INFO ] Flatten gal took : 39 ms
[2025-06-05 00:10:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5153070608344017387.gal : 9 ms
[2025-06-05 00:10:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16069414523122100945.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/CTLFireability5153070608344017387.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16069414523122100945.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,7.80253e+06,3.47363,68668,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: AG(E(EX(!(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))))) U AF(E(AF(((((p30==1)&...350
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EX(!(EX(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246...416
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,1,20.9203,367904,1,0,1049,1.01881e+06,1326,235,22468,662788,1677
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 24 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:10:25] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:10:25] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:10:25] [INFO ] Implicit Places using invariants in 187 ms returned []
[2025-06-05 00:10:25] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:10:26] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:10:31] [INFO ] Implicit Places using invariants and state equation in 5588 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5778 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 26 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:10:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:10:31] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:10:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 00:10:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:10:31] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:10:31] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6324 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:10:31] [INFO ] Flatten gal took : 47 ms
[2025-06-05 00:10:32] [INFO ] Flatten gal took : 52 ms
[2025-06-05 00:10:32] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:10:32] [INFO ] Flatten gal took : 48 ms
[2025-06-05 00:10:32] [INFO ] Flatten gal took : 48 ms
[2025-06-05 00:10:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8189891879477406333.gal : 11 ms
[2025-06-05 00:10:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14450178612814636567.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8189891879477406333.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14450178612814636567.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,7.80253e+06,3.58087,68536,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: (AG(((AG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))) * !(A(((((p30==1)&&(p66==1))...1287
=> equivalent forward existential formula: ((((([(FwdU((Init * !(!(E(TRUE U !(((!(E(TRUE U !(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&...5383
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,27.4703,473128,1,0,830,684522,1334,152,23104,440326,1421
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 167 transition count 642
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 1 with 108 rules applied. Total rules applied 194 place count 82 transition count 619
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 210 place count 74 transition count 611
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 210 place count 74 transition count 604
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 224 place count 67 transition count 604
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 240 place count 51 transition count 588
Iterating global reduction 3 with 16 rules applied. Total rules applied 256 place count 51 transition count 588
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 512 place count 51 transition count 332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 512 place count 51 transition count 324
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 528 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 531 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 539 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 555 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 33 transition count 305
Applied a total of 556 rules in 270 ms. Remains 33 /169 variables (removed 136) and now considering 305/728 (removed 423) transitions.
[2025-06-05 00:11:00] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2025-06-05 00:11:00] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:11:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 00:11:00] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:11:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:11:00] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 00:11:00] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:11:00] [INFO ] Redundant transitions in 44 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 00:11:00] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:11:00] [INFO ] Invariant cache hit.
[2025-06-05 00:11:00] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:03] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:03] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:04] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:05] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:06] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:07] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:07] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:07] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:07] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:07] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:08] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:08] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:08] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:09] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:11] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:11] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:11] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:11] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:11] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/357 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:15] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:15] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:15] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/329 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 329/329 variables, and 372 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 263/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:33] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:36] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:36] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:36] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:38] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:11:38] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/122 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/384 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 33/417 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/329 variables, and 417 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61027ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 61034ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/169 places, 305/728 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61609 ms. Remains : 33/169 places, 305/728 transitions.
[2025-06-05 00:12:01] [INFO ] Flatten gal took : 18 ms
[2025-06-05 00:12:01] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:12:01] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-05 00:12:01] [INFO ] Flatten gal took : 19 ms
[2025-06-05 00:12:01] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:12:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8512841532689572281.gal : 6 ms
[2025-06-05 00:12:01] [INFO ] Time to serialize properties into /tmp/CTLFireability188977955768611391.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/CTLFireability8512841532689572281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability188977955768611391.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,527,0.295428,10608,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: EF(!(E(!((EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))) * E(((((p30==1)&&(p66==1...441
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!((EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==...493
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...312
(forward)formula 0,1,1.26527,21616,1,0,416,28901,625,81,9303,22371,662
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 28 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:12:03] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:12:03] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:03] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-06-05 00:12:03] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:12:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:03] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:12:09] [INFO ] Implicit Places using invariants and state equation in 5835 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6047 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 38 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:12:09] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:12:09] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-05 00:12:09] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:09] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:12:09] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6564 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:12:09] [INFO ] Flatten gal took : 33 ms
[2025-06-05 00:12:09] [INFO ] Flatten gal took : 38 ms
[2025-06-05 00:12:09] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:12:09] [INFO ] Flatten gal took : 37 ms
[2025-06-05 00:12:09] [INFO ] Flatten gal took : 38 ms
[2025-06-05 00:12:09] [INFO ] Time to serialize gal into /tmp/CTLFireability18155459663384450499.gal : 11 ms
[2025-06-05 00:12:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8504661357890364844.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/CTLFireability18155459663384450499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8504661357890364844.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,7.80253e+06,4.01768,68536,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: AX(!(A(((((AG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))) * (p30==1)) * ((p66==1)...344
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!(!(EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==...657
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,23.8236,416492,1,0,1050,1.02577e+06,1330,230,23225,665201,1679
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 35 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:12:33] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:12:33] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:34] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-05 00:12:34] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:12:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:34] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:12:39] [INFO ] Implicit Places using invariants and state equation in 5428 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5611 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 21 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:12:39] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:12:39] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 00:12:39] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:12:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:12:39] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:12:39] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6049 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:12:39] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:12:40] [INFO ] Flatten gal took : 30 ms
[2025-06-05 00:12:40] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:12:40] [INFO ] Flatten gal took : 40 ms
[2025-06-05 00:12:40] [INFO ] Flatten gal took : 29 ms
[2025-06-05 00:12:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4766381462715307498.gal : 7 ms
[2025-06-05 00:12:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12579005369293955037.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4766381462715307498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12579005369293955037.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,7.80253e+06,3.8272,68416,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EG((EF((((((AX(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))) * !(A(((((p30==1)&&(p6...547
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((((!(EX(!(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p24...827
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,0,28.742,521632,1,0,1151,1.15339e+06,1332,337,22290,836129,1782
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 23 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:13:09] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:13:09] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:09] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-05 00:13:09] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:13:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:09] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:13:14] [INFO ] Implicit Places using invariants and state equation in 5628 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5833 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 18 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:13:15] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:13:15] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2025-06-05 00:13:15] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:13:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:15] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:13:15] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6197 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:13:15] [INFO ] Flatten gal took : 24 ms
[2025-06-05 00:13:15] [INFO ] Flatten gal took : 27 ms
[2025-06-05 00:13:15] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:13:15] [INFO ] Flatten gal took : 26 ms
[2025-06-05 00:13:15] [INFO ] Flatten gal took : 26 ms
[2025-06-05 00:13:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17848317807338955745.gal : 6 ms
[2025-06-05 00:13:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15657528359779597222.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/CTLFireability17848317807338955745.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15657528359779597222.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,7.80253e+06,3.56839,68540,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: ((AG(((((EX(A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((p30==1)&&(p66==1))...982
=> equivalent forward existential formula: ([(FwdU(EY((Init * !((!(E(TRUE U !(((((EX(!((E(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(...2238
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Detected timeout of ITS tools.
[2025-06-05 00:13:45] [INFO ] Flatten gal took : 50 ms
[2025-06-05 00:13:45] [INFO ] Applying decomposition
[2025-06-05 00:13:45] [INFO ] Flatten gal took : 49 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/graph14390959629379458073.txt' '-o' '/tmp/graph14390959629379458073.bin' '-w' '/tmp/graph14390959629379458073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14390959629379458073.bin' '-l' '-1' '-v' '-w' '/tmp/graph14390959629379458073.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:13:45] [INFO ] Decomposing Gal with order
[2025-06-05 00:13:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:13:46] [INFO ] Removed a total of 4141 redundant transitions.
[2025-06-05 00:13:46] [INFO ] Flatten gal took : 173 ms
[2025-06-05 00:13:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 37 ms.
[2025-06-05 00:13:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17742952166486417626.gal : 14 ms
[2025-06-05 00:13:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3779226462200950680.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/CTLFireability17742952166486417626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3779226462200950680.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,7.80253e+06,0.507984,9968,1511,24,7271,363,812,5737,52,800,0


Converting to forward existential form...Done !
original formula: ((AG(((((EX(A(((((i1.u0.p30==1)&&(i1.u4.p66==1))&&((i1.u13.p102==1)&&(i1.u17.p138==1)))&&(((i1.u21.p174==1)&&(i1.u25.p210==1))&&((i1.u29....1459
=> equivalent forward existential formula: ([(FwdU(EY((Init * !((!(E(TRUE U !(((((EX(!((E(!(((((i1.u0.p30==1)&&(i1.u4.p66==1))&&((i1.u13.p102==1)&&(i1.u17....3245
Reverse transition relation is NOT exact ! Due to transitions t4, t11, t14, t16, t21, t23, t26, t28, t635, t637, t639, t641, t643, t645, t647, t649, i1.t8,...657
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,7.95624,153712,1,0,140328,363,10089,612438,247,800,1661328
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 38 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:13:54] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:13:54] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:54] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-06-05 00:13:54] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:13:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:13:54] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:14:00] [INFO ] Implicit Places using invariants and state equation in 6248 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6501 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 28 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:14:00] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:14:00] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-05 00:14:00] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:01] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:14:01] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7053 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:14:01] [INFO ] Flatten gal took : 40 ms
[2025-06-05 00:14:01] [INFO ] Flatten gal took : 45 ms
[2025-06-05 00:14:01] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:14:01] [INFO ] Flatten gal took : 44 ms
[2025-06-05 00:14:01] [INFO ] Flatten gal took : 44 ms
[2025-06-05 00:14:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10334556954141092345.gal : 10 ms
[2025-06-05 00:14:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2453287023993321429.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/CTLFireability10334556954141092345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2453287023993321429.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,7.80253e+06,3.823,68540,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: !(A(!(EG((!(A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((p30==1)&&(p66==1))...444
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282=...944
Hit Full ! (commute/partial/dont) 108/0/543
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,1,24.4271,419916,1,0,1042,1.02463e+06,1325,229,23416,674494,1671
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 20 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:14:26] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:14:26] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:26] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-05 00:14:26] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:14:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:26] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:14:31] [INFO ] Implicit Places using invariants and state equation in 5440 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5616 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 23 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:14:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:14:31] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 00:14:31] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:32] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:14:32] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6007 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:14:32] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:14:32] [INFO ] Flatten gal took : 28 ms
[2025-06-05 00:14:32] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:14:32] [INFO ] Flatten gal took : 44 ms
[2025-06-05 00:14:32] [INFO ] Flatten gal took : 45 ms
[2025-06-05 00:14:32] [INFO ] Time to serialize gal into /tmp/CTLFireability4783497695812789998.gal : 11 ms
[2025-06-05 00:14:32] [INFO ] Time to serialize properties into /tmp/CTLFireability5466818007391930359.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/CTLFireability4783497695812789998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5466818007391930359.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,7.80253e+06,3.84716,68664,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: AG(EX(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(...178
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,0,10.1846,158596,1,0,744,269173,1308,122,22934,178074,1299
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 167 transition count 643
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 1 with 107 rules applied. Total rules applied 192 place count 83 transition count 620
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 208 place count 75 transition count 612
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 208 place count 75 transition count 605
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 222 place count 68 transition count 605
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 237 place count 53 transition count 590
Iterating global reduction 3 with 15 rules applied. Total rules applied 252 place count 53 transition count 590
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 3 with 255 rules applied. Total rules applied 507 place count 53 transition count 335
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 507 place count 53 transition count 327
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 523 place count 45 transition count 327
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 525 place count 44 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 526 place count 44 transition count 325
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 534 place count 44 transition count 317
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 550 place count 36 transition count 309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 551 place count 35 transition count 308
Applied a total of 551 rules in 195 ms. Remains 35 /169 variables (removed 134) and now considering 308/728 (removed 420) transitions.
[2025-06-05 00:14:43] [INFO ] Flow matrix only has 299 transitions (discarded 9 similar events)
// Phase 1: matrix 299 rows 35 cols
[2025-06-05 00:14:43] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-05 00:14:43] [INFO ] Flow matrix only has 299 transitions (discarded 9 similar events)
[2025-06-05 00:14:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:14:43] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 00:14:43] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:14:43] [INFO ] Redundant transitions in 16 ms returned []
Running 300 sub problems to find dead transitions.
[2025-06-05 00:14:43] [INFO ] Flow matrix only has 299 transitions (discarded 9 similar events)
[2025-06-05 00:14:43] [INFO ] Invariant cache hit.
[2025-06-05 00:14:43] [INFO ] State equation strengthened by 263 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 8/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:47] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 5 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-05 00:14:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:50] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:50] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:51] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:51] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:51] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:51] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:51] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:52] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:52] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:52] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:53] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:53] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:53] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:53] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:54] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:54] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:55] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:55] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:55] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:55] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:55] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:57] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:57] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:57] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:57] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:58] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:58] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:59] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:14:59] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:00] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/35 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/35 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 12 (OVERLAPS) 298/333 variables, 35/110 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 262/372 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:09] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:09] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:09] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 3/375 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:12] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:12] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 333/334 variables, and 380 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 300/36 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 8/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:16] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:16] [INFO ] Deduced a trap composed of 4 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-05 00:15:16] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:16] [INFO ] Deduced a trap composed of 4 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-05 00:15:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:16] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:15:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 298/333 variables, 35/127 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 262/389 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 36/425 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/334 variables, and 425 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 35/35 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 300/36 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60895ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 60898ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/169 places, 308/728 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61411 ms. Remains : 35/169 places, 308/728 transitions.
[2025-06-05 00:15:44] [INFO ] Flatten gal took : 28 ms
[2025-06-05 00:15:44] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:15:44] [INFO ] Input system was already deterministic with 308 transitions.
[2025-06-05 00:15:44] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:15:44] [INFO ] Flatten gal took : 23 ms
[2025-06-05 00:15:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6360112273815117682.gal : 6 ms
[2025-06-05 00:15:44] [INFO ] Time to serialize properties into /tmp/CTLFireability5681147005895283506.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/CTLFireability6360112273815117682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5681147005895283506.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,529,0.371657,10620,2,521,5,5084,6,0,440,2848,0


Converting to forward existential form...Done !
original formula: EF(AG(!(A((p51!=1) U AF(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(!((E(!(!(EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(...460
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t20, t22, t23...317
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.41316,23292,1,0,450,33769,642,85,9764,24023,720
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 24 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:15:45] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:15:45] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:46] [INFO ] Implicit Places using invariants in 219 ms returned []
[2025-06-05 00:15:46] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:15:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:46] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:15:51] [INFO ] Implicit Places using invariants and state equation in 5699 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5931 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 35 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:15:51] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:15:51] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-05 00:15:51] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:15:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:15:52] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:15:52] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6385 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:15:52] [INFO ] Flatten gal took : 41 ms
[2025-06-05 00:15:52] [INFO ] Flatten gal took : 47 ms
[2025-06-05 00:15:52] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:15:52] [INFO ] Flatten gal took : 49 ms
[2025-06-05 00:15:52] [INFO ] Flatten gal took : 49 ms
[2025-06-05 00:15:52] [INFO ] Time to serialize gal into /tmp/CTLFireability16388050261028663081.gal : 10 ms
[2025-06-05 00:15:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16746720741033761518.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/CTLFireability16388050261028663081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16746720741033761518.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,7.80253e+06,4.26967,68540,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: (E(!(AF(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))))) U (!(AF(!(EF(((((p30==1)&...572
=> equivalent forward existential formula: [(EY((Init * !(E(!(!(EG(!(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)...658
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Detected timeout of ITS tools.
[2025-06-05 00:16:22] [INFO ] Flatten gal took : 34 ms
[2025-06-05 00:16:22] [INFO ] Applying decomposition
[2025-06-05 00:16:22] [INFO ] Flatten gal took : 28 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/graph1673445832662116668.txt' '-o' '/tmp/graph1673445832662116668.bin' '-w' '/tmp/graph1673445832662116668.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1673445832662116668.bin' '-l' '-1' '-v' '-w' '/tmp/graph1673445832662116668.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:16:22] [INFO ] Decomposing Gal with order
[2025-06-05 00:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:16:22] [INFO ] Removed a total of 4140 redundant transitions.
[2025-06-05 00:16:22] [INFO ] Flatten gal took : 133 ms
[2025-06-05 00:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 34 ms.
[2025-06-05 00:16:22] [INFO ] Time to serialize gal into /tmp/CTLFireability7240824512492447890.gal : 10 ms
[2025-06-05 00:16:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12728932277060773783.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/CTLFireability7240824512492447890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12728932277060773783.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,7.80253e+06,2.04095,35856,2095,24,33277,316,839,171760,52,1092,0


Converting to forward existential form...Done !
original formula: (E(!(AF(!(((((i2.u16.p30==1)&&(i2.u10.p66==1))&&((i2.u14.p102==1)&&(i2.u19.p138==1)))&&(((i2.u22.p174==1)&&(i2.u5.p210==1))&&((i2.u1.p246...842
=> equivalent forward existential formula: [(EY((Init * !(E(!(!(EG(!(!(((((i2.u16.p30==1)&&(i2.u10.p66==1))&&((i2.u14.p102==1)&&(i2.u19.p138==1)))&&(((i2.u...928
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t8, t11, t14, t16, t21, t24, t28, t34, t38, t635, t637, t639, t641, t643, t645, t647,...637
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,19.7032,307472,1,0,209883,316,13333,2.10212e+06,269,1092,2460010
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 167 transition count 642
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 1 with 108 rules applied. Total rules applied 194 place count 82 transition count 619
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 210 place count 74 transition count 611
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 210 place count 74 transition count 604
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 224 place count 67 transition count 604
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 240 place count 51 transition count 588
Iterating global reduction 3 with 16 rules applied. Total rules applied 256 place count 51 transition count 588
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 512 place count 51 transition count 332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 512 place count 51 transition count 324
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 528 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 531 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 539 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 555 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 33 transition count 305
Applied a total of 556 rules in 116 ms. Remains 33 /169 variables (removed 136) and now considering 305/728 (removed 423) transitions.
[2025-06-05 00:16:42] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2025-06-05 00:16:42] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:16:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-05 00:16:42] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:16:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:16:43] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 00:16:43] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:16:43] [INFO ] Redundant transitions in 9 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 00:16:43] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:16:43] [INFO ] Invariant cache hit.
[2025-06-05 00:16:43] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:45] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:45] [INFO ] Deduced a trap composed of 5 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-05 00:16:45] [INFO ] Deduced a trap composed of 5 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-05 00:16:45] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:50] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:50] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:50] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:50] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:50] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:51] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:52] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:52] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:53] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/357 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:58] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:16:59] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:00] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 328/329 variables, and 371 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 75/75 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:15] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:15] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:16] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:18] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:19] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/122 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/384 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 33/417 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 328/329 variables, and 417 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 262/263 constraints, PredecessorRefiner: 297/33 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60559ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/169 places, 305/728 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60925 ms. Remains : 33/169 places, 305/728 transitions.
[2025-06-05 00:17:43] [INFO ] Flatten gal took : 20 ms
[2025-06-05 00:17:43] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:17:43] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-05 00:17:43] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:17:43] [INFO ] Flatten gal took : 22 ms
[2025-06-05 00:17:43] [INFO ] Time to serialize gal into /tmp/CTLFireability14162392812190257823.gal : 6 ms
[2025-06-05 00:17:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7210465554972270122.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/CTLFireability14162392812190257823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7210465554972270122.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,527,0.355282,10616,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: AF(EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1))...169
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...312
(forward)formula 0,1,1.34472,20728,1,0,401,20777,626,64,9878,16427,637
FORMULA StigmergyCommit-PT-07a-CTLFireability-2025-11 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 : 169/169 places, 728/728 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 167 transition count 642
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 1 with 108 rules applied. Total rules applied 194 place count 82 transition count 619
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 210 place count 74 transition count 611
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 210 place count 74 transition count 604
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 224 place count 67 transition count 604
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 240 place count 51 transition count 588
Iterating global reduction 3 with 16 rules applied. Total rules applied 256 place count 51 transition count 588
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 3 with 256 rules applied. Total rules applied 512 place count 51 transition count 332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 512 place count 51 transition count 324
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 528 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 530 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 531 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 539 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 555 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 556 place count 33 transition count 305
Applied a total of 556 rules in 158 ms. Remains 33 /169 variables (removed 136) and now considering 305/728 (removed 423) transitions.
[2025-06-05 00:17:45] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:17:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-05 00:17:45] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:17:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:17:45] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 00:17:45] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:17:45] [INFO ] Redundant transitions in 11 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 00:17:45] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:17:45] [INFO ] Invariant cache hit.
[2025-06-05 00:17:45] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 5 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-05 00:17:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:48] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:49] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:50] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:51] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:52] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:53] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:54] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:17:55] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 295/328 variables, 33/95 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 262/357 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:01] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:02] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 14/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 297 unsolved
SMT process timed out in 30612ms, After SMT, problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 30616ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/169 places, 305/728 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31046 ms. Remains : 33/169 places, 305/728 transitions.
[2025-06-05 00:18:16] [INFO ] Flatten gal took : 12 ms
[2025-06-05 00:18:16] [INFO ] Flatten gal took : 14 ms
[2025-06-05 00:18:16] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-05 00:18:16] [INFO ] Flatten gal took : 16 ms
[2025-06-05 00:18:16] [INFO ] Flatten gal took : 13 ms
[2025-06-05 00:18:16] [INFO ] Time to serialize gal into /tmp/CTLFireability5038088191133730212.gal : 3 ms
[2025-06-05 00:18:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3347687418460907205.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/CTLFireability5038088191133730212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3347687418460907205.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,527,0.215811,10616,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: AG(!(A(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))) U ((((p30==1)&&(p66==1))&&((p10...227
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)...503
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...312
(forward)formula 0,0,1.09422,20856,1,0,419,26955,625,66,9800,19063,668
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 167 transition count 645
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 102 rules applied. Total rules applied 185 place count 85 transition count 625
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 17 rules applied. Total rules applied 202 place count 78 transition count 615
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 208 place count 75 transition count 612
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 210 place count 74 transition count 611
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 210 place count 74 transition count 604
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 224 place count 67 transition count 604
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 240 place count 51 transition count 588
Iterating global reduction 5 with 16 rules applied. Total rules applied 256 place count 51 transition count 588
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 512 place count 51 transition count 332
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 512 place count 51 transition count 324
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 528 place count 43 transition count 324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 530 place count 42 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 531 place count 42 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 539 place count 42 transition count 314
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 555 place count 34 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 556 place count 33 transition count 305
Applied a total of 556 rules in 104 ms. Remains 33 /169 variables (removed 136) and now considering 305/728 (removed 423) transitions.
[2025-06-05 00:18:17] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
// Phase 1: matrix 296 rows 33 cols
[2025-06-05 00:18:17] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 00:18:17] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:18:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:17] [INFO ] State equation strengthened by 263 read => feed constraints.
[2025-06-05 00:18:17] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 00:18:17] [INFO ] Redundant transitions in 7 ms returned []
Running 297 sub problems to find dead transitions.
[2025-06-05 00:18:17] [INFO ] Flow matrix only has 296 transitions (discarded 9 similar events)
[2025-06-05 00:18:17] [INFO ] Invariant cache hit.
[2025-06-05 00:18:17] [INFO ] State equation strengthened by 263 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:19] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:19] [INFO ] Deduced a trap composed of 5 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-05 00:18:19] [INFO ] Deduced a trap composed of 5 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-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 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-05 00:18:20] [INFO ] Deduced a trap composed of 5 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-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 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-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:21] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 5 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-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:23] [INFO ] Deduced a trap composed of 5 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-05 00:18:23] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:23] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:23] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:23] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:24] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:25] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:26] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:26] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:26] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 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-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:27] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 295/328 variables, 33/108 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 262/370 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:33] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:33] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:33] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:33] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/328 variables, 4/374 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 00:18:37] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/328 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/328 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 297 unsolved
SMT process timed out in 30516ms, After SMT, problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 30518ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/169 places, 305/728 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30810 ms. Remains : 33/169 places, 305/728 transitions.
[2025-06-05 00:18:48] [INFO ] Flatten gal took : 13 ms
[2025-06-05 00:18:48] [INFO ] Flatten gal took : 15 ms
[2025-06-05 00:18:48] [INFO ] Input system was already deterministic with 305 transitions.
[2025-06-05 00:18:48] [INFO ] Flatten gal took : 18 ms
[2025-06-05 00:18:48] [INFO ] Flatten gal took : 15 ms
[2025-06-05 00:18:48] [INFO ] Time to serialize gal into /tmp/CTLFireability8147173458997065991.gal : 4 ms
[2025-06-05 00:18:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3635837235620836122.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/CTLFireability8147173458997065991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3635837235620836122.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,527,0.329378,10616,2,508,5,5032,6,0,429,2833,0


Converting to forward existential form...Done !
original formula: AF(EG((EF((p65==1)) * EG((((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(((p174!=1)||(p210!=1))||((p246!=1)||(p282!=1)))) + AG(((((p30...252
=> equivalent forward existential formula: [FwdG(Init,!(EG((E(TRUE U (p65==1)) * EG((((((p30!=1)||(p66!=1))||((p102!=1)||(p138!=1)))||(((p174!=1)||(p210!=1...315
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t19, t20, t21...312
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.78603,32632,1,0,474,39167,638,118,9490,32082,745
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 25 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:18:50] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:18:50] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:50] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-05 00:18:50] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:50] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:18:55] [INFO ] Implicit Places using invariants and state equation in 5416 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5592 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 19 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:18:55] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:18:55] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-05 00:18:55] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:18:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:18:56] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:18:56] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6039 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:18:56] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:18:56] [INFO ] Flatten gal took : 28 ms
[2025-06-05 00:18:56] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:18:56] [INFO ] Flatten gal took : 27 ms
[2025-06-05 00:18:56] [INFO ] Flatten gal took : 29 ms
[2025-06-05 00:18:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2917663238584601208.gal : 7 ms
[2025-06-05 00:18:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17818455810061576060.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/CTLFireability2917663238584601208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17818455810061576060.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,7.80253e+06,3.66073,68668,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EX((E((EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&(p282==1)))))) * !(A(((((p30==1)&&(p66=...659
=> equivalent forward existential formula: [FwdG((EY(Init) * E((EG(!(((((p30==1)&&(p66==1))&&((p102==1)&&(p138==1)))&&(((p174==1)&&(p210==1))&&((p246==1)&&...933
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
Detected timeout of ITS tools.
[2025-06-05 00:19:26] [INFO ] Flatten gal took : 34 ms
[2025-06-05 00:19:26] [INFO ] Applying decomposition
[2025-06-05 00:19:26] [INFO ] Flatten gal took : 27 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/graph1891940571995005722.txt' '-o' '/tmp/graph1891940571995005722.bin' '-w' '/tmp/graph1891940571995005722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1891940571995005722.bin' '-l' '-1' '-v' '-w' '/tmp/graph1891940571995005722.weights' '-q' '0' '-e' '0.001'
[2025-06-05 00:19:26] [INFO ] Decomposing Gal with order
[2025-06-05 00:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 00:19:26] [INFO ] Removed a total of 4141 redundant transitions.
[2025-06-05 00:19:26] [INFO ] Flatten gal took : 81 ms
[2025-06-05 00:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 17 ms.
[2025-06-05 00:19:26] [INFO ] Time to serialize gal into /tmp/CTLFireability48992980279696749.gal : 8 ms
[2025-06-05 00:19:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9364243897695153779.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/CTLFireability48992980279696749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9364243897695153779.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.80253e+06,2.72345,53128,1549,24,20834,261,801,534267,50,969,0


Converting to forward existential form...Done !
original formula: EX((E((EG(!(((((i1.u0.p30==1)&&(i1.u9.p66==1))&&((i1.u14.p102==1)&&(i1.u19.p138==1)))&&(((i1.u25.p174==1)&&(i1.u21.p210==1))&&((i1.u27.p2...977
=> equivalent forward existential formula: [FwdG((EY(Init) * E((EG(!(((((i1.u0.p30==1)&&(i1.u9.p66==1))&&((i1.u14.p102==1)&&(i1.u19.p138==1)))&&(((i1.u25.p...1357
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t14, t16, t18, t23, t29, t31, t635, t637, t639, t641, t643, t645, t647, t649, i0.t26...643
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,15.6518,278280,1,0,318073,330,11826,1.81204e+06,233,969,1375962
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-14 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 : 169/169 places, 728/728 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 727
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 167 transition count 726
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 167 transition count 726
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 166 transition count 725
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 166 transition count 725
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 165 transition count 724
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 165 transition count 724
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 164 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 164 transition count 723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 163 transition count 722
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 163 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 163 transition count 721
Applied a total of 13 rules in 22 ms. Remains 163 /169 variables (removed 6) and now considering 721/728 (removed 7) transitions.
[2025-06-05 00:19:42] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
// Phase 1: matrix 712 rows 163 cols
[2025-06-05 00:19:42] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:19:42] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-05 00:19:42] [INFO ] Flow matrix only has 712 transitions (discarded 9 similar events)
[2025-06-05 00:19:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:19:43] [INFO ] State equation strengthened by 581 read => feed constraints.
[2025-06-05 00:19:48] [INFO ] Implicit Places using invariants and state equation in 5643 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5896 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/169 places, 721/728 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 139 transition count 698
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 139 transition count 698
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 139 transition count 690
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 682
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 682
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 123 transition count 674
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 123 transition count 674
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 115 transition count 666
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 115 transition count 666
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 107 transition count 658
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 107 transition count 658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 100 transition count 651
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 100 transition count 651
Applied a total of 132 rules in 22 ms. Remains 100 /162 variables (removed 62) and now considering 651/721 (removed 70) transitions.
[2025-06-05 00:19:48] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2025-06-05 00:19:48] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:19:48] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-05 00:19:48] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2025-06-05 00:19:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 00:19:48] [INFO ] State equation strengthened by 517 read => feed constraints.
[2025-06-05 00:19:48] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 100/169 places, 651/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6270 ms. Remains : 100/169 places, 651/728 transitions.
[2025-06-05 00:19:48] [INFO ] Flatten gal took : 25 ms
[2025-06-05 00:19:48] [INFO ] Flatten gal took : 30 ms
[2025-06-05 00:19:48] [INFO ] Input system was already deterministic with 651 transitions.
[2025-06-05 00:19:49] [INFO ] Flatten gal took : 30 ms
[2025-06-05 00:19:49] [INFO ] Flatten gal took : 31 ms
[2025-06-05 00:19:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8284149840562674476.gal : 7 ms
[2025-06-05 00:19:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2736307763605143363.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/CTLFireability8284149840562674476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2736307763605143363.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,7.80253e+06,3.60387,68668,2,4679,5,69829,6,0,1042,45999,0


Converting to forward existential form...Done !
original formula: EG((EF(AX(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)||(p282==0)))))) * ((((p30==0)||(p66==0))||...231
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U !(EX(!(((((p30==0)||(p66==0))||((p102==0)||(p138==0)))||(((p174==0)||(p210==0))||((p246==0)...286
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...454
(forward)formula 0,0,20.5181,348792,1,0,899,610585,1320,230,22916,474012,1467
FORMULA StigmergyCommit-PT-07a-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2025-06-05 00:20:09] [INFO ] Flatten gal took : 29 ms
[2025-06-05 00:20:09] [INFO ] Flatten gal took : 28 ms
Total runtime 722782 ms.

BK_STOP 1749082809891

--------------------
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="StigmergyCommit-PT-07a"
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 StigmergyCommit-PT-07a, 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 r226-smll-174903490700082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07a.tgz
mv StigmergyCommit-PT-07a 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 ;