Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967500146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is CloudReconfiguration-PT-305, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967500146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K Mar 6 08:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 6 08:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 6 08:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 08:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 6 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 08:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 660K Mar 3 18:30 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 CloudReconfiguration-PT-305-CTLFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-305-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779501318111

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-305
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 01:55:19] [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]
[2026-05-23 01:55:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:55:19] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2026-05-23 01:55:19] [INFO ] Transformed 2585 places.
[2026-05-23 01:55:19] [INFO ] Transformed 3095 transitions.
[2026-05-23 01:55:19] [INFO ] Found NUPN structural information;
[2026-05-23 01:55:19] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 124 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 496 places :
Symmetric choice reduction at 0 with 496 rule applications. Total rules 496 place count 2089 transition count 2599
Iterating global reduction 0 with 496 rules applied. Total rules applied 992 place count 2089 transition count 2599
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 1020 place count 2089 transition count 2571
Discarding 216 places :
Symmetric choice reduction at 1 with 216 rule applications. Total rules 1236 place count 1873 transition count 2355
Iterating global reduction 1 with 216 rules applied. Total rules applied 1452 place count 1873 transition count 2355
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 1537 place count 1788 transition count 2270
Iterating global reduction 1 with 85 rules applied. Total rules applied 1622 place count 1788 transition count 2270
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 1638 place count 1788 transition count 2254
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1684 place count 1742 transition count 2208
Iterating global reduction 2 with 46 rules applied. Total rules applied 1730 place count 1742 transition count 2208
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1738 place count 1742 transition count 2200
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1774 place count 1706 transition count 2160
Iterating global reduction 3 with 36 rules applied. Total rules applied 1810 place count 1706 transition count 2160
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1835 place count 1681 transition count 2135
Iterating global reduction 3 with 25 rules applied. Total rules applied 1860 place count 1681 transition count 2135
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1883 place count 1658 transition count 2112
Iterating global reduction 3 with 23 rules applied. Total rules applied 1906 place count 1658 transition count 2112
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1928 place count 1636 transition count 2090
Iterating global reduction 3 with 22 rules applied. Total rules applied 1950 place count 1636 transition count 2090
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1967 place count 1619 transition count 2064
Iterating global reduction 3 with 17 rules applied. Total rules applied 1984 place count 1619 transition count 2064
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1992 place count 1611 transition count 2050
Iterating global reduction 3 with 8 rules applied. Total rules applied 2000 place count 1611 transition count 2050
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 2008 place count 1603 transition count 2039
Iterating global reduction 3 with 8 rules applied. Total rules applied 2016 place count 1603 transition count 2039
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2019 place count 1603 transition count 2036
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2022 place count 1600 transition count 2033
Iterating global reduction 4 with 3 rules applied. Total rules applied 2025 place count 1600 transition count 2033
Applied a total of 2025 rules in 1478 ms. Remains 1600 /2585 variables (removed 985) and now considering 2033/3095 (removed 1062) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12230326355439975434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7115521288754755659.kers'
[2026-05-23 01:55:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12230326355439975434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7115521288754755659.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2033 rows 1600 cols 4243 entries
Finished phase 1 with 1595 SingleSign rule and 1 generalized
[2026-05-23 01:55:21] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7115521288754755659.kers
Total runtime 12 ms.
[2026-05-23 01:55:21] [INFO ] Implicit Places using invariants in 534 ms returned []
[2026-05-23 01:55:21] [INFO ] Invariant cache hit.
[2026-05-23 01:55:22] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
Running 2032 sub problems to find dead transitions.
[2026-05-23 01:55:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1599 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1599/3633 variables, and 4 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30065 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 2032/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1599 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1599/3633 variables, and 4 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 0/2032 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60729ms problems are : Problem set: 0 solved, 2032 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Starting structural reductions in LTL mode, iteration 1 : 1600/2585 places, 2033/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63955 ms. Remains : 1600/2585 places, 2033/3095 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Applied a total of 0 rules in 54 ms. Remains 1600 /1600 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
[2026-05-23 01:56:23] [INFO ] Invariant cache hit.
[2026-05-23 01:56:23] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-23 01:56:23] [INFO ] Invariant cache hit.
[2026-05-23 01:56:24] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1172 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1229 ms. Remains : 1600/1600 places, 2033/2033 transitions.
Support contains 124 out of 1600 places after structural reductions.
[2026-05-23 01:56:25] [INFO ] Flatten gal took : 133 ms
[2026-05-23 01:56:25] [INFO ] Flatten gal took : 72 ms
[2026-05-23 01:56:25] [INFO ] Input system was already deterministic with 2033 transitions.
Support contains 120 out of 1600 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (298 resets) in 1868 ms. (21 steps per ms) remains 70/91 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 70/70 properties
BEST_FIRST walk for 4002 steps (10 resets) in 67 ms. (58 steps per ms) remains 69/70 properties
BEST_FIRST walk for 4003 steps (9 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (9 resets) in 79 ms. (50 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (9 resets) in 60 ms. (65 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (11 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 33 ms. (117 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (10 resets) in 31 ms. (125 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (9 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4002 steps (9 resets) in 15 ms. (250 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4001 steps (9 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (9 resets) in 59 ms. (66 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (10 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
[2026-05-23 01:56:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1500/1589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2023/3612 variables, 1589/1593 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3612/3633 variables, and 1593 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1589/1600 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1500/1589 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1589 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 2023/3612 variables, 1589/1593 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3612 variables, 66/1659 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3612/3633 variables, and 1659 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1589/1600 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10080ms problems are : Problem set: 0 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 89 out of 1600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Graph (trivial) has 1749 edges and 1600 vertex of which 507 / 1600 are part of one of the 53 SCC in 11 ms
Free SCC test removed 454 places
Drop transitions (Empty/Sink Transition effects.) removed 567 transitions
Reduce isomorphic transitions removed 567 transitions.
Graph (complete) has 1645 edges and 1146 vertex of which 1136 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 519 transitions
Trivial Post-agglo rules discarded 519 transitions
Performed 519 trivial Post agglomeration. Transition count delta: 519
Iterating post reduction 0 with 525 rules applied. Total rules applied 527 place count 1136 transition count 936
Reduce places removed 519 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 557 rules applied. Total rules applied 1084 place count 617 transition count 898
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 27 rules applied. Total rules applied 1111 place count 594 transition count 894
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 1117 place count 592 transition count 890
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 1124 place count 590 transition count 885
Reduce places removed 3 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 5 with 38 rules applied. Total rules applied 1162 place count 587 transition count 850
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 36 rules applied. Total rules applied 1198 place count 552 transition count 849
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 69 Pre rules applied. Total rules applied 1198 place count 552 transition count 780
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 7 with 138 rules applied. Total rules applied 1336 place count 483 transition count 780
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1341 place count 478 transition count 774
Iterating global reduction 7 with 5 rules applied. Total rules applied 1346 place count 478 transition count 774
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1350 place count 474 transition count 770
Iterating global reduction 7 with 4 rules applied. Total rules applied 1354 place count 474 transition count 770
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1358 place count 474 transition count 766
Performed 184 Post agglomeration using F-continuation condition with reduction of 74 identical transitions.
Deduced a syphon composed of 184 places in 1 ms
Reduce places removed 184 places and 0 transitions.
Iterating global reduction 8 with 368 rules applied. Total rules applied 1726 place count 290 transition count 508
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 1754 place count 290 transition count 480
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1757 place count 287 transition count 477
Iterating global reduction 9 with 3 rules applied. Total rules applied 1760 place count 287 transition count 477
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 1780 place count 277 transition count 467
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 1791 place count 277 transition count 456
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 10 with 72 rules applied. Total rules applied 1863 place count 241 transition count 486
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 1890 place count 241 transition count 459
Discarding 8 places :
Symmetric choice reduction at 11 with 8 rule applications. Total rules 1898 place count 233 transition count 443
Iterating global reduction 11 with 8 rules applied. Total rules applied 1906 place count 233 transition count 443
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1909 place count 233 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 1931 place count 233 transition count 418
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1932 place count 232 transition count 417
Iterating global reduction 12 with 1 rules applied. Total rules applied 1933 place count 232 transition count 417
Free-agglomeration rule applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1937 place count 232 transition count 413
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1941 place count 228 transition count 413
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 13 with 18 rules applied. Total rules applied 1959 place count 228 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1961 place count 228 transition count 411
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 1965 place count 228 transition count 411
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1966 place count 228 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1967 place count 227 transition count 409
Applied a total of 1967 rules in 262 ms. Remains 227 /1600 variables (removed 1373) and now considering 409/2033 (removed 1624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 227/1600 places, 409/2033 transitions.
RANDOM walk for 40000 steps (2637 resets) in 407 ms. (98 steps per ms) remains 16/66 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (60 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (60 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (60 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (53 resets) in 14 ms. (266 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (59 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (59 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (64 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (54 resets) in 10 ms. (363 steps per ms) remains 14/15 properties
[2026-05-23 01:56:37] [INFO ] Flow matrix only has 403 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16542864062370663505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6961122088330629565.kers'
[2026-05-23 01:56:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16542864062370663505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6961122088330629565.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 227 cols 1057 entries
Finished phase 1 with 224 SingleSign rule and 0 generalized
[2026-05-23 01:56:37] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6961122088330629565.kers
Total runtime 2 ms.
[2026-05-23 01:56:37] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 167/197 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 376/573 variables, 197/200 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 39/612 variables, 19/222 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 1/223 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 15/627 variables, 8/231 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 3/630 variables, 3/234 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/630 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/630 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 630/630 variables, and 234 constraints, problems are : Problem set: 1 solved, 13 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 227/227 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem AtomicPropp54 is UNSAT
At refinement iteration 1 (OVERLAPS) 169/197 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 376/573 variables, 197/200 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 7/210 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 39/612 variables, 19/229 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 1/230 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 5/235 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 1/236 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 0/236 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 15/627 variables, 8/244 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/244 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/630 variables, 3/247 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/630 variables, 0/247 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/630 variables, 0/247 constraints. Problems are: Problem set: 4 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 630/630 variables, and 247 constraints, problems are : Problem set: 4 solved, 10 unsolved in 2288 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 227/227 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 12/14 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3268ms problems are : Problem set: 4 solved, 10 unsolved
Parikh walk visited 8 properties in 773 ms.
Support contains 9 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 409/409 transitions.
Graph (trivial) has 244 edges and 227 vertex of which 65 / 227 are part of one of the 29 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 191 transition count 310
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 38 rules applied. Total rules applied 70 place count 160 transition count 303
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 157 transition count 303
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 73 place count 157 transition count 289
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 101 place count 143 transition count 289
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 138 transition count 283
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 138 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 138 transition count 281
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 177 place count 106 transition count 249
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 195 place count 106 transition count 231
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 201 place count 100 transition count 221
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 100 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 211 place count 100 transition count 217
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 212 place count 99 transition count 216
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 99 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 215 place count 99 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 221 place count 96 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 224 place count 96 transition count 208
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 226 place count 94 transition count 204
Iterating global reduction 8 with 2 rules applied. Total rules applied 228 place count 94 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 230 place count 94 transition count 202
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 231 place count 93 transition count 201
Iterating global reduction 9 with 1 rules applied. Total rules applied 232 place count 93 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 233 place count 93 transition count 200
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 257 place count 81 transition count 216
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 10 with 21 rules applied. Total rules applied 278 place count 81 transition count 195
Discarding 10 places :
Symmetric choice reduction at 11 with 10 rule applications. Total rules 288 place count 71 transition count 171
Iterating global reduction 11 with 10 rules applied. Total rules applied 298 place count 71 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 304 place count 71 transition count 165
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 307 place count 68 transition count 161
Iterating global reduction 12 with 3 rules applied. Total rules applied 310 place count 68 transition count 161
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 12 with 7 rules applied. Total rules applied 317 place count 68 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 319 place count 67 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 13 with 15 rules applied. Total rules applied 334 place count 67 transition count 151
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 335 place count 67 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 336 place count 66 transition count 150
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 337 place count 65 transition count 149
Iterating global reduction 15 with 1 rules applied. Total rules applied 338 place count 65 transition count 149
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 15 with 2 rules applied. Total rules applied 340 place count 64 transition count 148
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 344 place count 64 transition count 144
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 351 place count 60 transition count 141
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 352 place count 60 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 353 place count 60 transition count 140
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 354 place count 59 transition count 139
Iterating global reduction 16 with 1 rules applied. Total rules applied 355 place count 59 transition count 139
Applied a total of 355 rules in 43 ms. Remains 59 /227 variables (removed 168) and now considering 139/409 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 59/227 places, 139/409 transitions.
RANDOM walk for 40000 steps (3749 resets) in 797 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (15 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (802 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Probably explored full state space saw : 36652 states, properties seen :0
Probabilistic random walk after 158967 steps, saw 36652 distinct states, run finished after 406 ms. (steps per millisecond=391 ) properties seen :0
Explored full state space saw : 36652 states, properties seen :0
Exhaustive walk after 158967 steps, saw 36652 distinct states, run finished after 344 ms. (steps per millisecond=462 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 01:56:42] [INFO ] Flatten gal took : 49 ms
[2026-05-23 01:56:42] [INFO ] Flatten gal took : 47 ms
[2026-05-23 01:56:42] [INFO ] Input system was already deterministic with 2033 transitions.
Support contains 106 out of 1600 places (down from 107) after GAL structural reductions.
Computed a total of 32 stabilizing places and 34 stable transitions
Graph (complete) has 2215 edges and 1600 vertex of which 1590 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.21 ms
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1551 transition count 1983
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1551 transition count 1983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 1551 transition count 1982
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 123 place count 1527 transition count 1955
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 1527 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 148 place count 1527 transition count 1954
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 154 place count 1521 transition count 1947
Iterating global reduction 2 with 6 rules applied. Total rules applied 160 place count 1521 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 179 place count 1511 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 181 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 1510 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 186 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 187 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 188 place count 1507 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 189 place count 1507 transition count 1930
Applied a total of 189 rules in 735 ms. Remains 1507 /1600 variables (removed 93) and now considering 1930/2033 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6517461202004585620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3341041750070909347.kers'
[2026-05-23 01:56:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6517461202004585620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3341041750070909347.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1507 cols 4031 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:56:43] [INFO ] Computed 4 invariants in 14 ms
Computed 4 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-3341041750070909347.kers
Total runtime 18 ms.
[2026-05-23 01:56:43] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-23 01:56:43] [INFO ] Invariant cache hit.
[2026-05-23 01:56:44] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 01:56:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60490ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60495ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1600 places, 1930/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62366 ms. Remains : 1507/1600 places, 1930/2033 transitions.
[2026-05-23 01:57:44] [INFO ] Flatten gal took : 35 ms
[2026-05-23 01:57:45] [INFO ] Flatten gal took : 32 ms
[2026-05-23 01:57:45] [INFO ] Input system was already deterministic with 1930 transitions.
[2026-05-23 01:57:45] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:57:45] [INFO ] Flatten gal took : 28 ms
[2026-05-23 01:57:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15914266143753508871.gal : 28 ms
[2026-05-23 01:57:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11929693186786611514.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15914266143753508871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11929693186786611514.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60088e+10,10.1571,268720,2,23708,5,708672,6,0,7960,1.39622e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:58:15] [INFO ] Flatten gal took : 26 ms
[2026-05-23 01:58:15] [INFO ] Applying decomposition
[2026-05-23 01:58:15] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1855491617958094722.txt' '-o' '/tmp/graph1855491617958094722.bin' '-w' '/tmp/graph1855491617958094722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1855491617958094722.bin' '-l' '-1' '-v' '-w' '/tmp/graph1855491617958094722.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:58:15] [INFO ] Decomposing Gal with order
[2026-05-23 01:58:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:58:15] [INFO ] Removed a total of 516 redundant transitions.
[2026-05-23 01:58:15] [INFO ] Flatten gal took : 141 ms
[2026-05-23 01:58:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 34 ms.
[2026-05-23 01:58:15] [INFO ] Time to serialize gal into /tmp/CTLFireability4025834980743540093.gal : 21 ms
[2026-05-23 01:58:15] [INFO ] Time to serialize properties into /tmp/CTLFireability17093529647425728412.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4025834980743540093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17093529647425728412.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.60088e+10,1.1792,41280,1943,209,58056,6675,2501,129031,122,57268,0


Converting to forward existential form...Done !
original formula: EF(((E((i6.i0.i1.u94.p524==1) U (i26.i0.i2.u396.p1660==1)) * AX((i37.i3.i2.u559.p2277==1))) * (i29.i1.i2.u484.p2036==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i29.i1.i2.u484.p2036==1)) * E((i6.i0.i1.u94.p524==1) U (i26.i0.i2.u396.p1660==1))) * !(EX...197
Reverse transition relation is NOT exact ! Due to transitions t26, t210, t262, t322, t371, t442, t491, t494, t647, t728, t759, t837, t908, t1141, t1193, t1...2017
(forward)formula 0,0,4.10631,141384,1,0,241637,7141,21122,422779,566,57268,1310216
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1554 transition count 1986
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1554 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 1554 transition count 1984
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 116 place count 1532 transition count 1960
Iterating global reduction 1 with 22 rules applied. Total rules applied 138 place count 1532 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 139 place count 1532 transition count 1959
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 1526 transition count 1952
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 1526 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 1526 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 1523 transition count 1948
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 1520 transition count 1944
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 1520 transition count 1944
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 1518 transition count 1942
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 1518 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 1516 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 1516 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 1515 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 1514 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 1513 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 1512 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 1512 transition count 1935
Applied a total of 180 rules in 723 ms. Remains 1512 /1600 variables (removed 88) and now considering 1935/2033 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5676454374420708150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18239967195024118416.kers'
[2026-05-23 01:58:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5676454374420708150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18239967195024118416.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1935 rows 1512 cols 4043 entries
Finished phase 1 with 1507 SingleSign rule and 1 generalized
[2026-05-23 01:58:20] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-18239967195024118416.kers
Total runtime 16 ms.
[2026-05-23 01:58:21] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 01:58:21] [INFO ] Invariant cache hit.
[2026-05-23 01:58:21] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 1934 sub problems to find dead transitions.
[2026-05-23 01:58:21] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30043 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1934/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3447 variables, and 4 constraints, problems are : Problem set: 0 solved, 1934 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1934 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 1934 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1600 places, 1935/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62265 ms. Remains : 1512/1600 places, 1935/2033 transitions.
[2026-05-23 01:59:22] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:59:22] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:59:22] [INFO ] Input system was already deterministic with 1935 transitions.
[2026-05-23 01:59:22] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:59:22] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:59:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5584527064398704156.gal : 6 ms
[2026-05-23 01:59:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15245193286513023095.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5584527064398704156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15245193286513023095.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.61444e+10,11.2863,289544,2,24594,5,823009,6,0,7985,1.44603e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:59:52] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:59:52] [INFO ] Applying decomposition
[2026-05-23 01:59:52] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11982083587633771463.txt' '-o' '/tmp/graph11982083587633771463.bin' '-w' '/tmp/graph11982083587633771463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11982083587633771463.bin' '-l' '-1' '-v' '-w' '/tmp/graph11982083587633771463.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:59:52] [INFO ] Decomposing Gal with order
[2026-05-23 01:59:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:59:52] [INFO ] Removed a total of 523 redundant transitions.
[2026-05-23 01:59:52] [INFO ] Flatten gal took : 55 ms
[2026-05-23 01:59:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 25 ms.
[2026-05-23 01:59:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14773734077682813362.gal : 14 ms
[2026-05-23 01:59:52] [INFO ] Time to serialize properties into /tmp/CTLFireability5143914602268721596.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14773734077682813362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5143914602268721596.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.61444e+10,2.28693,84468,2911,205,140589,6356,2174,353172,121,52017,0


Converting to forward existential form...Done !
original formula: A(EX(!(((i18.u105.p572==1)&&(i25.u438.p1845==1)))) U A(((i25.u341.p1440==1)||(i2.u54.p302==1)) U (((i8.i0.i1.i3.u470.p1964==1) + AF(((i21...365
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((((i8.i0.i1.i3.u470.p1964==1) + !(EG(!(((i21.u356.p1489==1)||(i26.u426.p1742==1)))))) + ...2657
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t291, t369, t440, t492, t648, t677, t729, t791, t912, t1116, t1197, t1228, t...1661
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1551 transition count 1984
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1551 transition count 1984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 1551 transition count 1982
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 124 place count 1527 transition count 1955
Iterating global reduction 1 with 24 rules applied. Total rules applied 148 place count 1527 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 149 place count 1527 transition count 1954
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 1521 transition count 1947
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 1521 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 1521 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 1518 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 1518 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 171 place count 1515 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 174 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 1513 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 1513 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 1511 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 1510 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 1509 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 1508 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 1508 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 1507 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 1507 transition count 1930
Applied a total of 190 rules in 707 ms. Remains 1507 /1600 variables (removed 93) and now considering 1930/2033 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-737896316946407236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7708896257170125335.kers'
[2026-05-23 02:00:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-737896316946407236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7708896257170125335.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1507 cols 4031 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 02:00:23] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-7708896257170125335.kers
Total runtime 13 ms.
[2026-05-23 02:00:24] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 02:00:24] [INFO ] Invariant cache hit.
[2026-05-23 02:00:24] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 02:00:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3437 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1600 places, 1930/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62206 ms. Remains : 1507/1600 places, 1930/2033 transitions.
[2026-05-23 02:01:25] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:01:25] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:01:25] [INFO ] Input system was already deterministic with 1930 transitions.
[2026-05-23 02:01:25] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:01:25] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:01:25] [INFO ] Time to serialize gal into /tmp/CTLFireability2651567623978766224.gal : 6 ms
[2026-05-23 02:01:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3308094199248456309.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2651567623978766224.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3308094199248456309.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.59916e+10,10.3263,267180,2,23726,5,708481,6,0,7960,1.38822e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:01:55] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:01:55] [INFO ] Applying decomposition
[2026-05-23 02:01:55] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13936936961395693504.txt' '-o' '/tmp/graph13936936961395693504.bin' '-w' '/tmp/graph13936936961395693504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13936936961395693504.bin' '-l' '-1' '-v' '-w' '/tmp/graph13936936961395693504.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:01:55] [INFO ] Decomposing Gal with order
[2026-05-23 02:01:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:01:55] [INFO ] Removed a total of 523 redundant transitions.
[2026-05-23 02:01:55] [INFO ] Flatten gal took : 49 ms
[2026-05-23 02:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 21 ms.
[2026-05-23 02:01:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4257866871026751323.gal : 13 ms
[2026-05-23 02:01:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16779074579071843401.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4257866871026751323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16779074579071843401.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.59916e+10,1.31378,50048,2182,203,79978,7613,2595,156307,122,58640,0


Converting to forward existential form...Done !
original formula: AX(AF(EX(((AX((i28.i2.i1.u433.p1857==1)) + A((i18.i3.i4.u226.p979==1) U (i16.i0.i1.u223.p965==1))) + ((i37.i2.i0.u484.p2559==1)||(i18.i3....177
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(((!(EX(!((i28.i2.i1.u433.p1857==1)))) + !((E(!((i16.i0.i1.u223.p965==1)) U (!((i18.i3.i4.u22...305
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t260, t320, t369, t440, t492, t645, t726, t757, t786, t835, t906, t1112, t11...1986
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Graph (trivial) has 1941 edges and 1600 vertex of which 715 / 1600 are part of one of the 63 SCC in 3 ms
Free SCC test removed 652 places
Ensure Unique test removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Graph (complete) has 1453 edges and 948 vertex of which 938 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 524 transitions
Trivial Post-agglo rules discarded 524 transitions
Performed 524 trivial Post agglomeration. Transition count delta: 524
Iterating post reduction 0 with 524 rules applied. Total rules applied 526 place count 937 transition count 746
Reduce places removed 524 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 548 rules applied. Total rules applied 1074 place count 413 transition count 722
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 1086 place count 402 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1087 place count 401 transition count 721
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1087 place count 401 transition count 676
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1177 place count 356 transition count 676
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1196 place count 337 transition count 649
Iterating global reduction 4 with 19 rules applied. Total rules applied 1215 place count 337 transition count 649
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1215 place count 337 transition count 647
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1219 place count 335 transition count 647
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1232 place count 322 transition count 629
Iterating global reduction 4 with 13 rules applied. Total rules applied 1245 place count 322 transition count 629
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1251 place count 322 transition count 623
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1253 place count 320 transition count 619
Iterating global reduction 5 with 2 rules applied. Total rules applied 1255 place count 320 transition count 619
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1257 place count 318 transition count 615
Iterating global reduction 5 with 2 rules applied. Total rules applied 1259 place count 318 transition count 615
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1261 place count 316 transition count 611
Iterating global reduction 5 with 2 rules applied. Total rules applied 1263 place count 316 transition count 611
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1265 place count 314 transition count 607
Iterating global reduction 5 with 2 rules applied. Total rules applied 1267 place count 314 transition count 607
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1269 place count 312 transition count 603
Iterating global reduction 5 with 2 rules applied. Total rules applied 1271 place count 312 transition count 603
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1353 place count 271 transition count 562
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 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 5 with 26 rules applied. Total rules applied 1379 place count 271 transition count 536
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 14 rules applied. Total rules applied 1393 place count 264 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1396 place count 261 transition count 529
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1407 place count 250 transition count 507
Iterating global reduction 8 with 11 rules applied. Total rules applied 1418 place count 250 transition count 507
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1424 place count 244 transition count 495
Iterating global reduction 8 with 6 rules applied. Total rules applied 1430 place count 244 transition count 495
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1438 place count 240 transition count 491
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 7 rules applied. Total rules applied 1445 place count 240 transition count 484
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1448 place count 237 transition count 484
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 1453 place count 232 transition count 472
Iterating global reduction 10 with 5 rules applied. Total rules applied 1458 place count 232 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 10 with 73 rules applied. Total rules applied 1531 place count 232 transition count 399
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 10 with 32 rules applied. Total rules applied 1563 place count 232 transition count 367
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 11 with 32 rules applied. Total rules applied 1595 place count 200 transition count 367
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 1595 place count 200 transition count 364
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1601 place count 197 transition count 364
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1609 place count 193 transition count 360
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 1612 place count 190 transition count 357
Iterating global reduction 12 with 3 rules applied. Total rules applied 1615 place count 190 transition count 357
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 1622 place count 190 transition count 350
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1623 place count 189 transition count 349
Applied a total of 1623 rules in 129 ms. Remains 189 /1600 variables (removed 1411) and now considering 349/2033 (removed 1684) transitions.
[2026-05-23 02:02:26] [INFO ] Flow matrix only has 299 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9872057236251630537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13551436972285290001.kers'
[2026-05-23 02:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9872057236251630537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13551436972285290001.kers]
Normalized transition count is 298 out of 299 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 298 rows 189 cols 718 entries
Finished phase 1 with 189 SingleSign rule and 0 generalized
[2026-05-23 02:02:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13551436972285290001.kers
Total runtime 1 ms.
[2026-05-23 02:02:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-23 02:02:26] [INFO ] Flow matrix only has 299 transitions (discarded 50 similar events)
[2026-05-23 02:02:26] [INFO ] Invariant cache hit.
[2026-05-23 02:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 02:02:26] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [66, 126]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 223 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 187/1600 places, 349/2033 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 347
Applied a total of 2 rules in 9 ms. Remains 185 /187 variables (removed 2) and now considering 347/349 (removed 2) transitions.
[2026-05-23 02:02:26] [INFO ] Flow matrix only has 297 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15171453369342527037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8422858654649891501.kers'
[2026-05-23 02:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15171453369342527037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8422858654649891501.kers]
Normalized transition count is 296 out of 297 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 296 rows 185 cols 711 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-23 02:02:26] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8422858654649891501.kers
Total runtime 10 ms.
[2026-05-23 02:02:26] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-23 02:02:26] [INFO ] Flow matrix only has 297 transitions (discarded 50 similar events)
[2026-05-23 02:02:26] [INFO ] Invariant cache hit.
[2026-05-23 02:02:26] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 185/1600 places, 347/2033 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 677 ms. Remains : 185/1600 places, 347/2033 transitions.
[2026-05-23 02:02:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 02:02:26] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:02:26] [INFO ] Input system was already deterministic with 347 transitions.
[2026-05-23 02:02:26] [INFO ] Flatten gal took : 4 ms
[2026-05-23 02:02:26] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:02:26] [INFO ] Time to serialize gal into /tmp/CTLFireability18058094403954913941.gal : 2 ms
[2026-05-23 02:02:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12555863704137460391.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18058094403954913941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12555863704137460391.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.6711e+06,0.232598,14308,2,1899,5,36880,6,0,1031,51897,0


Converting to forward existential form...Done !
original formula: AF(AG(AF((p1334!=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!((p1334!=1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t13, t15, t30, t55, t61, t64, t69, t70, t72, t87, t113, t119, t120, t123, t128, ...472
(forward)formula 0,0,3.59254,135436,1,0,531,652842,656,319,6233,726031,756
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1553 transition count 1985
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1553 transition count 1985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 1553 transition count 1984
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 119 place count 1529 transition count 1957
Iterating global reduction 1 with 24 rules applied. Total rules applied 143 place count 1529 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 144 place count 1529 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 150 place count 1523 transition count 1949
Iterating global reduction 2 with 6 rules applied. Total rules applied 156 place count 1523 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 1523 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 1520 transition count 1945
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 1520 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 1517 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 1517 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 1515 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 1515 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 1513 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 1513 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 1512 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 1512 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 1511 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 1511 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 1510 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 1510 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 184 place count 1509 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 185 place count 1509 transition count 1932
Applied a total of 185 rules in 664 ms. Remains 1509 /1600 variables (removed 91) and now considering 1932/2033 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15843238473355857612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16586846060262631292.kers'
[2026-05-23 02:02:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15843238473355857612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16586846060262631292.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1932 rows 1509 cols 4035 entries
Finished phase 1 with 1504 SingleSign rule and 1 generalized
[2026-05-23 02:02:30] [INFO ] Computed 4 invariants in 8 ms
Computed 4 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16586846060262631292.kers
Total runtime 9 ms.
[2026-05-23 02:02:31] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-23 02:02:31] [INFO ] Invariant cache hit.
[2026-05-23 02:02:31] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2026-05-23 02:02:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60413ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1600 places, 1932/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62184 ms. Remains : 1509/1600 places, 1932/2033 transitions.
[2026-05-23 02:03:32] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:03:32] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:03:32] [INFO ] Input system was already deterministic with 1932 transitions.
[2026-05-23 02:03:32] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:03:32] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:03:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5738732074630765849.gal : 7 ms
[2026-05-23 02:03:32] [INFO ] Time to serialize properties into /tmp/CTLFireability199173471813146481.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5738732074630765849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability199173471813146481.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.61182e+10,10.7358,270808,2,23981,5,719793,6,0,7970,1.40193e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:04:02] [INFO ] Flatten gal took : 21 ms
[2026-05-23 02:04:02] [INFO ] Applying decomposition
[2026-05-23 02:04:02] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15703642366335016183.txt' '-o' '/tmp/graph15703642366335016183.bin' '-w' '/tmp/graph15703642366335016183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15703642366335016183.bin' '-l' '-1' '-v' '-w' '/tmp/graph15703642366335016183.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:04:02] [INFO ] Decomposing Gal with order
[2026-05-23 02:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:04:02] [INFO ] Removed a total of 513 redundant transitions.
[2026-05-23 02:04:02] [INFO ] Flatten gal took : 48 ms
[2026-05-23 02:04:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 11 ms.
[2026-05-23 02:04:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14966185326152206643.gal : 12 ms
[2026-05-23 02:04:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10501099394393717416.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14966185326152206643.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10501099394393717416.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61182e+10,1.36507,50456,2076,217,72212,5773,2585,176660,125,63256,0


Converting to forward existential form...Done !
original formula: A(EG(EX(!((((!((i27.i0.i0.u105.p572==1)&&(i36.i1.i2.u586.p2399==1)))&&(i17.i0.i1.u285.p1264==1))&&(i11.u163.p760==1))))) U ((i35.i2.i3.u5...230
=> equivalent forward existential formula: [((Init * !(EG(!(((i35.i2.i3.u560.p2274!=1) * !(EX(!(!(EG(!(((i16.i0.i1.u233.p1006==1) + EX((i0.u42.p207==1)))))...519
Reverse transition relation is NOT exact ! Due to transitions t26, t209, t261, t292, t321, t370, t441, t493, t646, t675, t727, t787, t836, t907, t1111, t11...2041
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1553 transition count 1985
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1553 transition count 1985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 96 place count 1553 transition count 1983
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 117 place count 1532 transition count 1959
Iterating global reduction 1 with 21 rules applied. Total rules applied 138 place count 1532 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 139 place count 1532 transition count 1958
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 1526 transition count 1951
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 1526 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 1526 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 1523 transition count 1947
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 1523 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 1520 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 1520 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 1518 transition count 1941
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 1518 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 1516 transition count 1938
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 1516 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 1515 transition count 1937
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 1515 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 1514 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 1514 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 1513 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 1513 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 1512 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 1512 transition count 1934
Applied a total of 180 rules in 719 ms. Remains 1512 /1600 variables (removed 88) and now considering 1934/2033 (removed 99) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12357880884288161522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-374822953843256627.kers'
[2026-05-23 02:04:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12357880884288161522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-374822953843256627.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1934 rows 1512 cols 4039 entries
Finished phase 1 with 1507 SingleSign rule and 1 generalized
[2026-05-23 02:04:33] [INFO ] Computed 4 invariants in 11 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-374822953843256627.kers
Total runtime 15 ms.
[2026-05-23 02:04:33] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 02:04:33] [INFO ] Invariant cache hit.
[2026-05-23 02:04:34] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 1933 sub problems to find dead transitions.
[2026-05-23 02:04:34] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1511/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 1933/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1933 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1511 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1933 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1511/3446 variables, and 4 constraints, problems are : Problem set: 0 solved, 1933 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1512 constraints, PredecessorRefiner: 0/1933 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 1933 unsolved
Search for dead transitions found 0 dead transitions in 60395ms
Starting structural reductions in LTL mode, iteration 1 : 1512/1600 places, 1934/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62217 ms. Remains : 1512/1600 places, 1934/2033 transitions.
[2026-05-23 02:05:35] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:05:35] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:05:35] [INFO ] Input system was already deterministic with 1934 transitions.
[2026-05-23 02:05:35] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:05:35] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:05:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7079196736846308902.gal : 5 ms
[2026-05-23 02:05:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16814667508780263925.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7079196736846308902.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16814667508780263925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.62498e+10,11.6173,288496,2,24519,5,832853,6,0,7984,1.43003e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:06:05] [INFO ] Flatten gal took : 22 ms
[2026-05-23 02:06:05] [INFO ] Applying decomposition
[2026-05-23 02:06:05] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3934168320152742371.txt' '-o' '/tmp/graph3934168320152742371.bin' '-w' '/tmp/graph3934168320152742371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3934168320152742371.bin' '-l' '-1' '-v' '-w' '/tmp/graph3934168320152742371.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:06:05] [INFO ] Decomposing Gal with order
[2026-05-23 02:06:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:06:05] [INFO ] Removed a total of 499 redundant transitions.
[2026-05-23 02:06:05] [INFO ] Flatten gal took : 61 ms
[2026-05-23 02:06:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 13 ms.
[2026-05-23 02:06:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10604355154859505022.gal : 12 ms
[2026-05-23 02:06:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11426243906651551496.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10604355154859505022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11426243906651551496.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62498e+10,1.70267,59988,1976,258,85806,14000,2474,219873,126,95622,0


Converting to forward existential form...Done !
original formula: E(AF((!(EX(AX((i21.u328.p1386==1)))) * EX(AF((i11.u157.p734==1))))) U AX(E(AX((i16.i2.i0.u219.p928==1)) U (i34.u534.p2235==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((!(EX(!(EX(!((i21.u328.p1386==1)))))) * EX(!(EG(!((i11.u157.p734==1)))))))))) * !(EX(!(E(!(EX...222
Reverse transition relation is NOT exact ! Due to transitions t26, t208, t262, t293, t322, t371, t442, t494, t647, t676, t728, t759, t837, t908, t1112, t11...2049
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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1557 transition count 1989
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1557 transition count 1989
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 1557 transition count 1987
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 106 place count 1539 transition count 1966
Iterating global reduction 1 with 18 rules applied. Total rules applied 124 place count 1539 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 1539 transition count 1965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 130 place count 1534 transition count 1960
Iterating global reduction 2 with 5 rules applied. Total rules applied 135 place count 1534 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 1534 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 139 place count 1531 transition count 1956
Iterating global reduction 3 with 3 rules applied. Total rules applied 142 place count 1531 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 1529 transition count 1954
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 1529 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 1527 transition count 1952
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 1527 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 152 place count 1525 transition count 1949
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 1525 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 1524 transition count 1948
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 1524 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 1523 transition count 1947
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 1523 transition count 1947
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 1522 transition count 1946
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 1522 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 1521 transition count 1945
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 1521 transition count 1945
Applied a total of 162 rules in 693 ms. Remains 1521 /1600 variables (removed 79) and now considering 1945/2033 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9242080610941683077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13321304821673850036.kers'
[2026-05-23 02:06:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9242080610941683077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13321304821673850036.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1945 rows 1521 cols 4063 entries
Finished phase 1 with 1516 SingleSign rule and 1 generalized
[2026-05-23 02:06:36] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13321304821673850036.kers
Total runtime 14 ms.
[2026-05-23 02:06:36] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-23 02:06:36] [INFO ] Invariant cache hit.
[2026-05-23 02:06:37] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 1944 sub problems to find dead transitions.
[2026-05-23 02:06:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1520/3466 variables, and 4 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 1944/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1944 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1520 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1520/3466 variables, and 4 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1521 constraints, PredecessorRefiner: 0/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60423ms problems are : Problem set: 0 solved, 1944 unsolved
Search for dead transitions found 0 dead transitions in 60426ms
Starting structural reductions in LTL mode, iteration 1 : 1521/1600 places, 1945/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62251 ms. Remains : 1521/1600 places, 1945/2033 transitions.
[2026-05-23 02:07:38] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:07:38] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:07:38] [INFO ] Input system was already deterministic with 1945 transitions.
[2026-05-23 02:07:38] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:07:38] [INFO ] Flatten gal took : 27 ms
[2026-05-23 02:07:38] [INFO ] Time to serialize gal into /tmp/CTLFireability315535019687399930.gal : 6 ms
[2026-05-23 02:07:38] [INFO ] Time to serialize properties into /tmp/CTLFireability16461892742655402012.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability315535019687399930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16461892742655402012.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.64378e+10,10.7848,275056,2,25411,5,721298,6,0,8031,1.43932e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:08:08] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:08:08] [INFO ] Applying decomposition
[2026-05-23 02:08:08] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9071994982641049292.txt' '-o' '/tmp/graph9071994982641049292.bin' '-w' '/tmp/graph9071994982641049292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9071994982641049292.bin' '-l' '-1' '-v' '-w' '/tmp/graph9071994982641049292.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:08:08] [INFO ] Decomposing Gal with order
[2026-05-23 02:08:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:08:08] [INFO ] Removed a total of 504 redundant transitions.
[2026-05-23 02:08:08] [INFO ] Flatten gal took : 39 ms
[2026-05-23 02:08:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 8 ms.
[2026-05-23 02:08:08] [INFO ] Time to serialize gal into /tmp/CTLFireability1687682885736905044.gal : 12 ms
[2026-05-23 02:08:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7377971306762482827.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1687682885736905044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7377971306762482827.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.64378e+10,1.82626,63176,1799,211,104312,6476,2466,219414,142,68469,0


Converting to forward existential form...Done !
original formula: A((EG(EX(((E((i28.i0.i2.u395.p1636==1) U (i29.i0.i2.u457.p1934==1)) * (i3.u45.p271==1)) * (i18.i0.i3.u262.p1167==1)))) * !(((EX((i21.i0.i...466
=> equivalent forward existential formula: [((Init * !(EG(!((((i10.u275.p634==1)&&(i6.i2.i1.u85.p500==1)) + (!((E(TRUE U ((i24.u321.p1387==1)&&(i10.u259.p1...951
Reverse transition relation is NOT exact ! Due to transitions t26, t183, t212, t264, t295, t324, t373, t444, t493, t496, t651, t732, t792, t841, t914, t105...2141
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1552 transition count 1984
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1552 transition count 1984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 1552 transition count 1982
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 120 place count 1530 transition count 1957
Iterating global reduction 1 with 22 rules applied. Total rules applied 142 place count 1530 transition count 1957
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 143 place count 1530 transition count 1956
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 149 place count 1524 transition count 1949
Iterating global reduction 2 with 6 rules applied. Total rules applied 155 place count 1524 transition count 1949
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 1524 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 1521 transition count 1945
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 1521 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 1518 transition count 1941
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 1518 transition count 1941
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 1516 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 1516 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 1514 transition count 1936
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 1514 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 1513 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 1513 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 1512 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 1512 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 1511 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 1510 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 1510 transition count 1932
Applied a total of 184 rules in 676 ms. Remains 1510 /1600 variables (removed 90) and now considering 1932/2033 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17239745558993305102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4385090745886567139.kers'
[2026-05-23 02:08:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17239745558993305102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4385090745886567139.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1932 rows 1510 cols 4035 entries
Finished phase 1 with 1505 SingleSign rule and 1 generalized
[2026-05-23 02:08:39] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-4385090745886567139.kers
Total runtime 13 ms.
[2026-05-23 02:08:39] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-23 02:08:39] [INFO ] Invariant cache hit.
[2026-05-23 02:08:40] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2026-05-23 02:08:40] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1509 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1509/3442 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1510 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60411ms
Starting structural reductions in LTL mode, iteration 1 : 1510/1600 places, 1932/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62149 ms. Remains : 1510/1600 places, 1932/2033 transitions.
[2026-05-23 02:09:40] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:09:40] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:09:40] [INFO ] Input system was already deterministic with 1932 transitions.
[2026-05-23 02:09:40] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:09:40] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:09:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1874201780539749428.gal : 6 ms
[2026-05-23 02:09:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12304009795150591127.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1874201780539749428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12304009795150591127.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.61857e+10,11.6393,287820,2,24475,5,821509,6,0,7974,1.43651e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:10:10] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:10:10] [INFO ] Applying decomposition
[2026-05-23 02:10:10] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15324265778433176706.txt' '-o' '/tmp/graph15324265778433176706.bin' '-w' '/tmp/graph15324265778433176706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15324265778433176706.bin' '-l' '-1' '-v' '-w' '/tmp/graph15324265778433176706.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:10:11] [INFO ] Decomposing Gal with order
[2026-05-23 02:10:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:10:11] [INFO ] Removed a total of 509 redundant transitions.
[2026-05-23 02:10:11] [INFO ] Flatten gal took : 38 ms
[2026-05-23 02:10:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2026-05-23 02:10:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4159525631540861104.gal : 12 ms
[2026-05-23 02:10:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7560313495274567892.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4159525631540861104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7560313495274567892.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61857e+10,1.24465,45296,3002,255,74450,5167,2144,132685,135,25219,0


Converting to forward existential form...Done !
original formula: (EF(((i6.u214.p928==1) * (EX((i29.u502.p2076==1)) + !(A(AF((i15.u255.p1133==1)) U (i18.u330.p1422!=1)))))) * AG(AF((i33.u563.p2288==1))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((i6.u214.p928==1) * (EX((i29.u502.p2076==1)) + !(!((E(!((i18.u330.p1422!=1)) U (!(!(EG(!((...308
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 5
Fast SCC detection found a local 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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
(forward)formula 0,0,2.11752,60756,1,0,101573,5585,11983,226373,557,25219,239883
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1551 transition count 1983
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1551 transition count 1983
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 1551 transition count 1981
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 124 place count 1527 transition count 1954
Iterating global reduction 1 with 24 rules applied. Total rules applied 148 place count 1527 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 149 place count 1527 transition count 1953
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 1521 transition count 1946
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 1521 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 1521 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 1518 transition count 1942
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 1518 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 1516 transition count 1939
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 1516 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 1515 transition count 1938
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 1514 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 1514 transition count 1936
Applied a total of 176 rules in 473 ms. Remains 1514 /1600 variables (removed 86) and now considering 1936/2033 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15758686211679834392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10863774851671569244.kers'
[2026-05-23 02:10:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15758686211679834392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10863774851671569244.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1936 rows 1514 cols 4043 entries
Finished phase 1 with 1509 SingleSign rule and 1 generalized
[2026-05-23 02:10:13] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10863774851671569244.kers
Total runtime 14 ms.
[2026-05-23 02:10:14] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-23 02:10:14] [INFO ] Invariant cache hit.
[2026-05-23 02:10:14] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1086 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2026-05-23 02:10:14] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3450 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60400ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60403ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1600 places, 1936/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61968 ms. Remains : 1514/1600 places, 1936/2033 transitions.
[2026-05-23 02:11:15] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:11:15] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:11:15] [INFO ] Input system was already deterministic with 1936 transitions.
[2026-05-23 02:11:15] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:11:15] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:11:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3842600400426341098.gal : 6 ms
[2026-05-23 02:11:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2938637885351155765.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3842600400426341098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2938637885351155765.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.62118e+10,10.5443,268896,2,23799,5,710224,6,0,7994,1.38983e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:11:45] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:11:45] [INFO ] Applying decomposition
[2026-05-23 02:11:45] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2450211197563540065.txt' '-o' '/tmp/graph2450211197563540065.bin' '-w' '/tmp/graph2450211197563540065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2450211197563540065.bin' '-l' '-1' '-v' '-w' '/tmp/graph2450211197563540065.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:11:45] [INFO ] Decomposing Gal with order
[2026-05-23 02:11:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:11:45] [INFO ] Removed a total of 500 redundant transitions.
[2026-05-23 02:11:45] [INFO ] Flatten gal took : 39 ms
[2026-05-23 02:11:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 11 ms.
[2026-05-23 02:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6031537053460317754.gal : 11 ms
[2026-05-23 02:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1956576256298937580.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6031537053460317754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1956576256298937580.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.62118e+10,1.10739,38516,1893,204,59073,4532,2550,111299,131,31403,0


Converting to forward existential form...Done !
original formula: E(EF(AX((i24.i0.i1.u345.p1471==1))) U (i38.i0.i4.u597.p2485==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(EX(!((i24.i0.i1.u345.p1471==1)))))) * (i38.i0.i4.u597.p2485==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t215, t267, t298, t327, t376, t447, t499, t652, t681, t733, t764, t843, t914, t1118, t11...2067
(forward)formula 0,1,5.45544,199660,1,0,367821,12058,25557,756347,626,70357,1396867
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1554 transition count 1986
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1554 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 1554 transition count 1984
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 115 place count 1533 transition count 1960
Iterating global reduction 1 with 21 rules applied. Total rules applied 136 place count 1533 transition count 1960
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 142 place count 1527 transition count 1953
Iterating global reduction 1 with 6 rules applied. Total rules applied 148 place count 1527 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 149 place count 1527 transition count 1952
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 152 place count 1524 transition count 1949
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 1524 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 158 place count 1521 transition count 1945
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 1521 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 163 place count 1519 transition count 1943
Iterating global reduction 2 with 2 rules applied. Total rules applied 165 place count 1519 transition count 1943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 167 place count 1517 transition count 1940
Iterating global reduction 2 with 2 rules applied. Total rules applied 169 place count 1517 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 1516 transition count 1939
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 1516 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 1515 transition count 1938
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 1515 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 1514 transition count 1937
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 1514 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 1513 transition count 1936
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 1513 transition count 1936
Applied a total of 177 rules in 700 ms. Remains 1513 /1600 variables (removed 87) and now considering 1936/2033 (removed 97) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9413750201911585924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17311976543254556940.kers'
[2026-05-23 02:11:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9413750201911585924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17311976543254556940.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1936 rows 1513 cols 4043 entries
Finished phase 1 with 1508 SingleSign rule and 1 generalized
[2026-05-23 02:11:51] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17311976543254556940.kers
Total runtime 12 ms.
[2026-05-23 02:11:52] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-23 02:11:52] [INFO ] Invariant cache hit.
[2026-05-23 02:11:53] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
Running 1935 sub problems to find dead transitions.
[2026-05-23 02:11:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 1935/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1935 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1512 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1935 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/3449 variables, and 4 constraints, problems are : Problem set: 0 solved, 1935 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1513 constraints, PredecessorRefiner: 0/1935 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60399ms problems are : Problem set: 0 solved, 1935 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Starting structural reductions in LTL mode, iteration 1 : 1513/1600 places, 1936/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62240 ms. Remains : 1513/1600 places, 1936/2033 transitions.
[2026-05-23 02:12:53] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:12:53] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:12:53] [INFO ] Input system was already deterministic with 1936 transitions.
[2026-05-23 02:12:53] [INFO ] Flatten gal took : 18 ms
[2026-05-23 02:12:53] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:12:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7030947213137619128.gal : 5 ms
[2026-05-23 02:12:53] [INFO ] Time to serialize properties into /tmp/CTLFireability1823922451854890455.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7030947213137619128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1823922451854890455.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.62679e+10,10.8627,275904,2,24386,5,786339,6,0,7990,1.35953e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:13:23] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:13:23] [INFO ] Applying decomposition
[2026-05-23 02:13:23] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7534476860768326898.txt' '-o' '/tmp/graph7534476860768326898.bin' '-w' '/tmp/graph7534476860768326898.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7534476860768326898.bin' '-l' '-1' '-v' '-w' '/tmp/graph7534476860768326898.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:13:23] [INFO ] Decomposing Gal with order
[2026-05-23 02:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:13:23] [INFO ] Removed a total of 504 redundant transitions.
[2026-05-23 02:13:23] [INFO ] Flatten gal took : 35 ms
[2026-05-23 02:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2026-05-23 02:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability7530555349095352040.gal : 9 ms
[2026-05-23 02:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10352879971612900947.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7530555349095352040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10352879971612900947.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.62679e+10,2.37559,89056,2587,249,148074,14993,2146,365459,127,108204,0


Converting to forward existential form...Done !
original formula: (AG((((i31.u495.p2084==0) * EX((i5.u74.p440==1))) * (AF((i18.u289.p1301==0)) * AX((i21.u328.p1419==0))))) + (EX((EF((i22.u349.p1483==1)) ...301
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !((((i31.u495.p2084==0) * EX((i5.u74.p440==1))) * (!(EG(!((i18.u289.p1301==0)))) * !(EX(...950
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t262, t294, t372, t443, t495, t677, t729, t790, t840, t911, t1144, t1196, t1227, t...1598
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
(forward)formula 0,1,13.1485,481632,1,0,772448,16259,18145,2.9739e+06,613,108204,2240071
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1554 transition count 1986
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1554 transition count 1986
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 94 place count 1554 transition count 1984
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 115 place count 1533 transition count 1960
Iterating global reduction 1 with 21 rules applied. Total rules applied 136 place count 1533 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 137 place count 1533 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 1530 transition count 1955
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 1530 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 1529 transition count 1954
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 1529 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 1528 transition count 1953
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 1528 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 1527 transition count 1952
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 1527 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 150 place count 1526 transition count 1950
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 1526 transition count 1950
Applied a total of 151 rules in 469 ms. Remains 1526 /1600 variables (removed 74) and now considering 1950/2033 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10408961080486007944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12998966088997001392.kers'
[2026-05-23 02:13:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10408961080486007944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12998966088997001392.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1950 rows 1526 cols 4073 entries
Finished phase 1 with 1521 SingleSign rule and 1 generalized
[2026-05-23 02:13:37] [INFO ] Computed 4 invariants in 11 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12998966088997001392.kers
Total runtime 15 ms.
[2026-05-23 02:13:37] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-23 02:13:37] [INFO ] Invariant cache hit.
[2026-05-23 02:13:38] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2026-05-23 02:13:38] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1525 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1949 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1525/3476 variables, and 4 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1526 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1525 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1949 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1525/3476 variables, and 4 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1526 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Starting structural reductions in LTL mode, iteration 1 : 1526/1600 places, 1950/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61999 ms. Remains : 1526/1600 places, 1950/2033 transitions.
[2026-05-23 02:14:39] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:14:39] [INFO ] Flatten gal took : 23 ms
[2026-05-23 02:14:39] [INFO ] Input system was already deterministic with 1950 transitions.
[2026-05-23 02:14:39] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:14:39] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:14:39] [INFO ] Time to serialize gal into /tmp/CTLFireability6950341504730928414.gal : 5 ms
[2026-05-23 02:14:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14628672820215175542.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6950341504730928414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14628672820215175542.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.66724e+10,11.0566,276092,2,23942,5,725480,6,0,8056,1.44692e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:15:09] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:15:09] [INFO ] Applying decomposition
[2026-05-23 02:15:09] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2676310297376543797.txt' '-o' '/tmp/graph2676310297376543797.bin' '-w' '/tmp/graph2676310297376543797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2676310297376543797.bin' '-l' '-1' '-v' '-w' '/tmp/graph2676310297376543797.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:15:09] [INFO ] Decomposing Gal with order
[2026-05-23 02:15:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:15:09] [INFO ] Removed a total of 530 redundant transitions.
[2026-05-23 02:15:09] [INFO ] Flatten gal took : 36 ms
[2026-05-23 02:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 8 ms.
[2026-05-23 02:15:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8343290463877794423.gal : 11 ms
[2026-05-23 02:15:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7703405157470076444.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8343290463877794423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7703405157470076444.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.66724e+10,1.02875,36512,1713,206,54140,5053,2595,103961,123,33811,0


Converting to forward existential form...Done !
original formula: AG(((E((i1.u35.p126==1) U (((((i34.i1.i1.u529.p2129==1)||(i18.i0.i0.u611.p2481==1))||((i28.i0.i2.u447.p1887==1)||(i4.u63.p317==1))) * EX(...399
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(((i24.i1.i2.u358.p1475==1)||(i19.i2.i0.u292.p1269==1)))) * !(!((E(!(E(TRUE U (i30.i0.i1....570
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t188, t217, t269, t300, t329, t378, t450, t502, t655, t684, t736, t796, t845, t916,...2153
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1552 transition count 1984
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1552 transition count 1984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 1552 transition count 1982
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 122 place count 1528 transition count 1955
Iterating global reduction 1 with 24 rules applied. Total rules applied 146 place count 1528 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 147 place count 1528 transition count 1954
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 1522 transition count 1947
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 1522 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 1522 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 163 place count 1519 transition count 1943
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 1519 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 1516 transition count 1939
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 1516 transition count 1939
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 174 place count 1514 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 1514 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 178 place count 1512 transition count 1934
Iterating global reduction 3 with 2 rules applied. Total rules applied 180 place count 1512 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 1511 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 1511 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 183 place count 1510 transition count 1932
Iterating global reduction 3 with 1 rules applied. Total rules applied 184 place count 1510 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 185 place count 1509 transition count 1931
Iterating global reduction 3 with 1 rules applied. Total rules applied 186 place count 1509 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 187 place count 1508 transition count 1930
Iterating global reduction 3 with 1 rules applied. Total rules applied 188 place count 1508 transition count 1930
Applied a total of 188 rules in 688 ms. Remains 1508 /1600 variables (removed 92) and now considering 1930/2033 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1310325729429369196.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9027354481826008718.kers'
[2026-05-23 02:15:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1310325729429369196.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9027354481826008718.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1508 cols 4031 entries
Finished phase 1 with 1503 SingleSign rule and 1 generalized
[2026-05-23 02:15:40] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9027354481826008718.kers
Total runtime 13 ms.
[2026-05-23 02:15:40] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-23 02:15:40] [INFO ] Invariant cache hit.
[2026-05-23 02:15:41] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 02:15:41] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1600 places, 1930/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62195 ms. Remains : 1508/1600 places, 1930/2033 transitions.
[2026-05-23 02:16:41] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:16:41] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:16:41] [INFO ] Input system was already deterministic with 1930 transitions.
[2026-05-23 02:16:41] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:16:41] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:16:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5928256286443049309.gal : 5 ms
[2026-05-23 02:16:41] [INFO ] Time to serialize properties into /tmp/CTLFireability4815813821554701249.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5928256286443049309.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4815813821554701249.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.60148e+10,10.7755,268696,2,23879,5,720217,6,0,7964,1.38763e+06,0


Converting to forward existential form...Done !
original formula: (EF((p1328==1)) + EX(E(EG((p1038==1)) U AX((p954==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p1328==1))] != FALSE + [(FwdU(EY(Init),EG((p1038==1))) * !(EX(!((p954==1)))))] != FALSE)
(forward)formula 0,1,10.7855,268696,1,0,7,720217,8,1,7967,1.38763e+06,1
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-12 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 : 1600/1600 places, 2033/2033 transitions.
Graph (trivial) has 1927 edges and 1600 vertex of which 715 / 1600 are part of one of the 63 SCC in 6 ms
Free SCC test removed 652 places
Ensure Unique test removed 756 transitions
Reduce isomorphic transitions removed 756 transitions.
Graph (complete) has 1453 edges and 948 vertex of which 938 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 516 transitions
Trivial Post-agglo rules discarded 516 transitions
Performed 516 trivial Post agglomeration. Transition count delta: 516
Iterating post reduction 0 with 516 rules applied. Total rules applied 518 place count 937 transition count 754
Reduce places removed 516 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 540 rules applied. Total rules applied 1058 place count 421 transition count 730
Reduce places removed 11 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 17 rules applied. Total rules applied 1075 place count 410 transition count 724
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1081 place count 404 transition count 724
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 1081 place count 404 transition count 679
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 1171 place count 359 transition count 679
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1190 place count 340 transition count 652
Iterating global reduction 4 with 19 rules applied. Total rules applied 1209 place count 340 transition count 652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1209 place count 340 transition count 651
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 1211 place count 339 transition count 651
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 1224 place count 326 transition count 633
Iterating global reduction 4 with 13 rules applied. Total rules applied 1237 place count 326 transition count 633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1243 place count 326 transition count 627
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1245 place count 324 transition count 623
Iterating global reduction 5 with 2 rules applied. Total rules applied 1247 place count 324 transition count 623
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1249 place count 322 transition count 619
Iterating global reduction 5 with 2 rules applied. Total rules applied 1251 place count 322 transition count 619
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1253 place count 320 transition count 615
Iterating global reduction 5 with 2 rules applied. Total rules applied 1255 place count 320 transition count 615
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1257 place count 318 transition count 611
Iterating global reduction 5 with 2 rules applied. Total rules applied 1259 place count 318 transition count 611
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1261 place count 316 transition count 607
Iterating global reduction 5 with 2 rules applied. Total rules applied 1263 place count 316 transition count 607
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 1345 place count 275 transition count 566
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 25 rules applied. Total rules applied 1370 place count 275 transition count 541
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 12 rules applied. Total rules applied 1382 place count 269 transition count 535
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 1386 place count 267 transition count 533
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1388 place count 265 transition count 533
Discarding 11 places :
Symmetric choice reduction at 9 with 11 rule applications. Total rules 1399 place count 254 transition count 511
Iterating global reduction 9 with 11 rules applied. Total rules applied 1410 place count 254 transition count 511
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1416 place count 248 transition count 499
Iterating global reduction 9 with 6 rules applied. Total rules applied 1422 place count 248 transition count 499
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1430 place count 244 transition count 495
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 7 rules applied. Total rules applied 1437 place count 244 transition count 488
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1440 place count 241 transition count 488
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1445 place count 236 transition count 476
Iterating global reduction 11 with 5 rules applied. Total rules applied 1450 place count 236 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 11 with 72 rules applied. Total rules applied 1522 place count 236 transition count 404
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 11 with 27 rules applied. Total rules applied 1549 place count 236 transition count 377
Reduce places removed 27 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 12 with 31 rules applied. Total rules applied 1580 place count 209 transition count 373
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1584 place count 205 transition count 373
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 3 Pre rules applied. Total rules applied 1584 place count 205 transition count 370
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1590 place count 202 transition count 370
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 1598 place count 198 transition count 366
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 1601 place count 195 transition count 363
Iterating global reduction 14 with 3 rules applied. Total rules applied 1604 place count 195 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 1611 place count 195 transition count 356
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1612 place count 194 transition count 355
Applied a total of 1612 rules in 112 ms. Remains 194 /1600 variables (removed 1406) and now considering 355/2033 (removed 1678) transitions.
[2026-05-23 02:16:52] [INFO ] Flow matrix only has 305 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14414828551096222775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7401308939071320771.kers'
[2026-05-23 02:16:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14414828551096222775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7401308939071320771.kers]
Normalized transition count is 304 out of 305 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 304 rows 194 cols 730 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-23 02:16:52] [INFO ] Computed 0 invariants in 3 ms
Computed 0 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7401308939071320771.kers
Total runtime 5 ms.
[2026-05-23 02:16:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 02:16:52] [INFO ] Flow matrix only has 305 transitions (discarded 50 similar events)
[2026-05-23 02:16:52] [INFO ] Invariant cache hit.
[2026-05-23 02:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 02:16:53] [INFO ] Implicit Places using invariants and state equation in 182 ms returned [68, 130]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 255 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 192/1600 places, 355/2033 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 190 transition count 353
Applied a total of 2 rules in 8 ms. Remains 190 /192 variables (removed 2) and now considering 353/355 (removed 2) transitions.
[2026-05-23 02:16:53] [INFO ] Flow matrix only has 303 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5180306593945488532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15168772689158051050.kers'
[2026-05-23 02:16:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5180306593945488532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15168772689158051050.kers]
Normalized transition count is 302 out of 303 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 302 rows 190 cols 723 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-05-23 02:16:53] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15168772689158051050.kers
Total runtime 3 ms.
[2026-05-23 02:16:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 02:16:53] [INFO ] Flow matrix only has 303 transitions (discarded 50 similar events)
[2026-05-23 02:16:53] [INFO ] Invariant cache hit.
[2026-05-23 02:16:53] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 190/1600 places, 353/2033 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 564 ms. Remains : 190/1600 places, 353/2033 transitions.
[2026-05-23 02:16:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:16:53] [INFO ] Flatten gal took : 4 ms
[2026-05-23 02:16:53] [INFO ] Input system was already deterministic with 353 transitions.
[2026-05-23 02:16:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:16:53] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:16:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6812454950546060294.gal : 1 ms
[2026-05-23 02:16:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8814310092138330791.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6812454950546060294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8814310092138330791.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.95763e+06,0.292506,15100,2,1948,5,38791,6,0,1057,55671,0


Converting to forward existential form...Done !
original formula: AF(AG((((p980==0)&&(p1831==0))&&((p2039==0)||(p1896==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p980==0)&&(p1831==0))&&((p2039==0)||(p1896==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t12, t13, t15, t30, t55, t61, t66, t71, t72, t74, t89, t104, t116, t122, t123, t126, ...478
(forward)formula 0,0,13.6277,338496,1,0,543,1.62001e+06,664,336,6235,2.07621e+06,767
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1555 transition count 1987
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1555 transition count 1987
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 1555 transition count 1985
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 116 place count 1531 transition count 1958
Iterating global reduction 1 with 24 rules applied. Total rules applied 140 place count 1531 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 141 place count 1531 transition count 1957
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 1525 transition count 1950
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 1525 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 1525 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 1522 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 1522 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 163 place count 1519 transition count 1942
Iterating global reduction 3 with 3 rules applied. Total rules applied 166 place count 1519 transition count 1942
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 1517 transition count 1940
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 1517 transition count 1940
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 1515 transition count 1937
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 1515 transition count 1937
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 1514 transition count 1936
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 1514 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 1513 transition count 1935
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 1513 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 179 place count 1512 transition count 1934
Iterating global reduction 3 with 1 rules applied. Total rules applied 180 place count 1512 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 1511 transition count 1933
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 1511 transition count 1933
Applied a total of 182 rules in 703 ms. Remains 1511 /1600 variables (removed 89) and now considering 1933/2033 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1923558472787418633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5317955543377443417.kers'
[2026-05-23 02:17:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1923558472787418633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5317955543377443417.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1933 rows 1511 cols 4037 entries
Finished phase 1 with 1506 SingleSign rule and 1 generalized
[2026-05-23 02:17:07] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-5317955543377443417.kers
Total runtime 18 ms.
[2026-05-23 02:17:08] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 02:17:08] [INFO ] Invariant cache hit.
[2026-05-23 02:17:08] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Running 1932 sub problems to find dead transitions.
[2026-05-23 02:17:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1510/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 1932/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1932 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1510 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1932 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1510/3444 variables, and 4 constraints, problems are : Problem set: 0 solved, 1932 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1511 constraints, PredecessorRefiner: 0/1932 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60391ms problems are : Problem set: 0 solved, 1932 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Starting structural reductions in LTL mode, iteration 1 : 1511/1600 places, 1933/2033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62228 ms. Remains : 1511/1600 places, 1933/2033 transitions.
[2026-05-23 02:18:09] [INFO ] Flatten gal took : 16 ms
[2026-05-23 02:18:09] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:18:09] [INFO ] Input system was already deterministic with 1933 transitions.
[2026-05-23 02:18:09] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:18:09] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:18:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13584085473771176737.gal : 5 ms
[2026-05-23 02:18:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1311744850780072062.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13584085473771176737.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1311744850780072062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,1.6163e+10,13.3747,271548,2,23802,5,710377,6,0,7979,1.42322e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 02:18:39] [INFO ] Flatten gal took : 20 ms
[2026-05-23 02:18:39] [INFO ] Applying decomposition
[2026-05-23 02:18:39] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10397281910289296881.txt' '-o' '/tmp/graph10397281910289296881.bin' '-w' '/tmp/graph10397281910289296881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10397281910289296881.bin' '-l' '-1' '-v' '-w' '/tmp/graph10397281910289296881.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:18:39] [INFO ] Decomposing Gal with order
[2026-05-23 02:18:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:18:39] [INFO ] Removed a total of 481 redundant transitions.
[2026-05-23 02:18:39] [INFO ] Flatten gal took : 35 ms
[2026-05-23 02:18:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 7 ms.
[2026-05-23 02:18:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10153826831676508448.gal : 10 ms
[2026-05-23 02:18:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15734759766799652251.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10153826831676508448.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15734759766799652251.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6163e+10,1.38583,44712,1759,285,71248,9204,2474,119272,151,48444,0


Converting to forward existential form...Done !
original formula: EX(((EG((i12.u144.p733==1)) + EG((i35.u524.p2226==1))) + (((i9.i2.i0.u109.p618==1)&&((i17.i0.i10.u257.p1172==0)||(i37.i1.i1.u534.p2283==0...277
=> equivalent forward existential formula: (([FwdG(EY(Init),(i12.u144.p733==1))] != FALSE + [FwdG(EY(Init),(i35.u524.p2226==1))] != FALSE) + ([(EY(Init) * ...409
Using 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 a local 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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t261, t321, t371, t442, t494, t676, t728, t759, t837, t908, t992, t1114, t11...2079
(forward)formula 0,1,6.90819,218284,1,0,426840,16363,25354,794548,853,59554,1380694
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 2033/2033 transitions.
Graph (trivial) has 1904 edges and 1600 vertex of which 684 / 1600 are part of one of the 61 SCC in 3 ms
Free SCC test removed 623 places
Ensure Unique test removed 720 transitions
Reduce isomorphic transitions removed 720 transitions.
Graph (complete) has 1489 edges and 977 vertex of which 968 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 518 transitions
Trivial Post-agglo rules discarded 518 transitions
Performed 518 trivial Post agglomeration. Transition count delta: 518
Iterating post reduction 0 with 518 rules applied. Total rules applied 520 place count 967 transition count 789
Reduce places removed 518 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 539 rules applied. Total rules applied 1059 place count 449 transition count 768
Reduce places removed 10 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 22 rules applied. Total rules applied 1081 place count 439 transition count 756
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1093 place count 427 transition count 756
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 1093 place count 427 transition count 708
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 1189 place count 379 transition count 708
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1206 place count 362 transition count 685
Iterating global reduction 4 with 17 rules applied. Total rules applied 1223 place count 362 transition count 685
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1223 place count 362 transition count 683
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1227 place count 360 transition count 683
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 1239 place count 348 transition count 667
Iterating global reduction 4 with 12 rules applied. Total rules applied 1251 place count 348 transition count 667
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1257 place count 348 transition count 661
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1258 place count 347 transition count 659
Iterating global reduction 5 with 1 rules applied. Total rules applied 1259 place count 347 transition count 659
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1260 place count 346 transition count 657
Iterating global reduction 5 with 1 rules applied. Total rules applied 1261 place count 346 transition count 657
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1262 place count 345 transition count 655
Iterating global reduction 5 with 1 rules applied. Total rules applied 1263 place count 345 transition count 655
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1264 place count 344 transition count 653
Iterating global reduction 5 with 1 rules applied. Total rules applied 1265 place count 344 transition count 653
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1351 place count 301 transition count 610
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 26 rules applied. Total rules applied 1377 place count 301 transition count 584
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 13 rules applied. Total rules applied 1390 place count 295 transition count 577
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 1395 place count 292 transition count 575
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1398 place count 290 transition count 574
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1408 place count 280 transition count 557
Iterating global reduction 9 with 10 rules applied. Total rules applied 1418 place count 280 transition count 557
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1424 place count 274 transition count 545
Iterating global reduction 9 with 6 rules applied. Total rules applied 1430 place count 274 transition count 545
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1438 place count 270 transition count 541
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 9 with 8 rules applied. Total rules applied 1446 place count 270 transition count 533
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1449 place count 267 transition count 533
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1453 place count 263 transition count 525
Iterating global reduction 11 with 4 rules applied. Total rules applied 1457 place count 263 transition count 525
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 11 with 76 rules applied. Total rules applied 1533 place count 263 transition count 449
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 11 with 30 rules applied. Total rules applied 1563 place count 263 transition count 419
Reduce places removed 30 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 12 with 34 rules applied. Total rules applied 1597 place count 233 transition count 415
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1601 place count 229 transition count 415
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 3 Pre rules applied. Total rules applied 1601 place count 229 transition count 412
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 1607 place count 226 transition count 412
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1617 place count 221 transition count 407
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 1619 place count 219 transition count 405
Iterating global reduction 14 with 2 rules applied. Total rules applied 1621 place count 219 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 1628 place count 219 transition count 398
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1629 place count 219 transition count 398
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 1630 place count 219 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1631 place count 218 transition count 396
Applied a total of 1631 rules in 123 ms. Remains 218 /1600 variables (removed 1382) and now considering 396/2033 (removed 1637) transitions.
[2026-05-23 02:18:46] [INFO ] Flow matrix only has 344 transitions (discarded 52 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15372101844140817642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18382815876028779446.kers'
[2026-05-23 02:18:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15372101844140817642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18382815876028779446.kers]
Normalized transition count is 343 out of 344 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 343 rows 218 cols 808 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-23 02:18:46] [INFO ] Computed 0 invariants in 5 ms
Computed 0 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18382815876028779446.kers
Total runtime 6 ms.
[2026-05-23 02:18:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-23 02:18:46] [INFO ] Flow matrix only has 344 transitions (discarded 52 similar events)
[2026-05-23 02:18:46] [INFO ] Invariant cache hit.
[2026-05-23 02:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 02:18:47] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [82, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 244 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 216/1600 places, 396/2033 transitions.
Reduce places removed 1 places and 1 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 214 transition count 394
Applied a total of 2 rules in 8 ms. Remains 214 /216 variables (removed 2) and now considering 394/396 (removed 2) transitions.
[2026-05-23 02:18:47] [INFO ] Flow matrix only has 342 transitions (discarded 52 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9834305913242711974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1874447156537213008.kers'
[2026-05-23 02:18:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9834305913242711974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1874447156537213008.kers]
Normalized transition count is 341 out of 342 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 214 cols 801 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-23 02:18:47] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1874447156537213008.kers
Total runtime 2 ms.
[2026-05-23 02:18:47] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 02:18:47] [INFO ] Flow matrix only has 342 transitions (discarded 52 similar events)
[2026-05-23 02:18:47] [INFO ] Invariant cache hit.
[2026-05-23 02:18:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 214/1600 places, 394/2033 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 573 ms. Remains : 214/1600 places, 394/2033 transitions.
[2026-05-23 02:18:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:18:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:18:47] [INFO ] Input system was already deterministic with 394 transitions.
[2026-05-23 02:18:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:18:47] [INFO ] Flatten gal took : 3 ms
[2026-05-23 02:18:47] [INFO ] Time to serialize gal into /tmp/CTLFireability18297743481672318756.gal : 1 ms
[2026-05-23 02:18:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15741211800721750339.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18297743481672318756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15741211800721750339.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,5.60674e+06,0.379493,18164,2,2524,5,48220,6,0,1190,75533,0


Converting to forward existential form...Done !
original formula: AG(E(((!(((p2201==1) * AG((p1996==1)))) + ((!((p438==1)||(p1517==1)))&&(p959==1))) * ((!(A((p1060==1) U (p2034==1))) + EF((p235==1))) + (...250
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((!(((p2201==1) * !(E(TRUE U !((p1996==1)))))) + ((!((p438==1)||(p1517==1)))&&(p959==1))...438
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t8, t17, t18, t20, t37, t66, t72, t75, t80, t81, t83, t101, t116, t128, t133, t134, t...549
(forward)formula 0,1,10.5509,294656,1,0,906,1.83959e+06,776,486,7101,1.67501e+06,1214
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 02:18:58] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:18:58] [INFO ] Flatten gal took : 17 ms
[2026-05-23 02:18:58] [INFO ] Applying decomposition
[2026-05-23 02:18:58] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15463556959384325897.txt' '-o' '/tmp/graph15463556959384325897.bin' '-w' '/tmp/graph15463556959384325897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15463556959384325897.bin' '-l' '-1' '-v' '-w' '/tmp/graph15463556959384325897.weights' '-q' '0' '-e' '0.001'
[2026-05-23 02:18:58] [INFO ] Decomposing Gal with order
[2026-05-23 02:18:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:18:58] [INFO ] Removed a total of 489 redundant transitions.
[2026-05-23 02:18:58] [INFO ] Flatten gal took : 37 ms
[2026-05-23 02:18:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 10 ms.
[2026-05-23 02:18:58] [INFO ] Time to serialize gal into /tmp/CTLFireability16750612501476445401.gal : 10 ms
[2026-05-23 02:18:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3349660031360963001.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16750612501476445401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3349660031360963001.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99977e+10,1.91761,58820,2089,315,81638,12789,2651,219942,144,85660,0


Converting to forward existential form...Done !
original formula: A(EX(!(((i9.i0.i0.u47.p572==1)&&(i27.i2.i5.u476.p1845==1)))) U A(((i27.i2.i1.u375.p1440==1)||(i4.u60.p302==1)) U (((i0.i1.i0.u507.p1964==...414
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((((i0.i1.i0.u507.p1964==1) + !(EG(!(((i23.i0.i2.u392.p1489==1)||(i27.i2.i5.u463.p1742==1...2982
Reverse transition relation is NOT exact ! Due to transitions t27, t209, t234, t289, t350, t401, t474, t525, t528, t558, t718, t742, t771, t835, t855, t862...2525
Using 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 a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Using 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 a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Using 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 a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Using 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 a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
(forward)formula 0,0,866.192,3280244,1,0,4.72279e+06,24361,6039,1.87991e+07,368,100871,3010710
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(EX(((AX((i28.u480.p1857==1)) + A((i18.i2.i3.u251.p979==1) U (i15.i0.i2.u246.p965==1))) + ((i37.i0.i1.u535.p2559==1)||(i18.i2.i4.u30...171
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(((!(EX(!((i28.u480.p1857==1)))) + !((E(!((i15.i0.i2.u246.p965==1)) U (!((i18.i2.i3.u251.p979...299
(forward)formula 1,0,1220.75,3994184,1,0,5.30702e+06,24361,5569,2.31151e+07,327,154014,2751956
FORMULA CloudReconfiguration-PT-305-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(EG(EX(!((((!((i9.i0.i0.u47.p572==1)&&(i37.i0.i4.u644.p2399==1)))&&(i19.i0.i1.u314.p1264==1))&&(i11.u183.p760==1))))) U ((i36.i1.i0.u607...234
=> equivalent forward existential formula: [((Init * !(EG(!(((i36.i1.i0.u607.p2274!=1) * !(EX(!(!(EG(!(((i18.i2.i4.u258.p1006==1) + EX((i3.i0.i3.u45.p207==...535
Using 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 a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Detected timeout of ITS tools.
[2026-05-23 02:46:50] [INFO ] Applying decomposition
[2026-05-23 02:46:50] [INFO ] Flatten gal took : 19 ms
[2026-05-23 02:46:50] [INFO ] Decomposing Gal with order
[2026-05-23 02:46:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 02:46:50] [INFO ] Removed a total of 75 redundant transitions.
[2026-05-23 02:46:50] [INFO ] Flatten gal took : 25 ms
[2026-05-23 02:46:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 1 ms.
[2026-05-23 02:46:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13585310557671310039.gal : 6 ms
[2026-05-23 02:46:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14343976291294112655.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13585310557671310039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14343976291294112655.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99977e+10,3.56489,99056,226,12074,4258,216534,164,9185,3668,864675,0


Converting to forward existential form...Done !
original formula: A(EG(EX(!((((!((i0.u2.p572==1)&&(i0.i1.u7.p2399==1)))&&(i0.i1.i0.u6.p1264==1))&&(i0.i1.i0.u5.p760==1))))) U ((i0.i1.u7.p2274!=1) * AX(AF(...205
=> equivalent forward existential formula: [((Init * !(EG(!(((i0.i1.u7.p2274!=1) * !(EX(!(!(EG(!(((i0.i1.i0.u5.p1006==1) + EX((i0.u2.p207==1)))))))))))))) ...474
Reverse transition relation is NOT exact ! Due to transitions t1884, t1885, t1891, i0.u2.t1, i0.u2.t1529, i0.u2.t1547, i0.u2.t1591, i0.u2.t1607, i0.u2.t161...3018

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="CloudReconfiguration-PT-305"
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-5973"
echo " Executing tool itstools"
echo " Input is CloudReconfiguration-PT-305, 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 r066-tall-177946967500146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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