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-177946967500130.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-303, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967500130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Mar 6 08:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 08:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 08:55 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 4.0K Mar 15 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 18K Mar 15 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 6 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 6 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Mar 6 08:55 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-303-CTLFireability-2024-00
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-01
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-02
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-03
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-04
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-05
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-06
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-07
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-08
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-09
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-10
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-11
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-12
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-13
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-14
FORMULA_NAME CloudReconfiguration-PT-303-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779499596338

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-303
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 01:26:37] [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:26:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 01:26:37] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2026-05-23 01:26:37] [INFO ] Transformed 2584 places.
[2026-05-23 01:26:37] [INFO ] Transformed 3094 transitions.
[2026-05-23 01:26:37] [INFO ] Found NUPN structural information;
[2026-05-23 01:26:37] [INFO ] Parsed PT model containing 2584 places and 3094 transitions and 6459 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 104 out of 2584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2584/2584 places, 3094/3094 transitions.
Discarding 497 places :
Symmetric choice reduction at 0 with 497 rule applications. Total rules 497 place count 2087 transition count 2597
Iterating global reduction 0 with 497 rules applied. Total rules applied 994 place count 2087 transition count 2597
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 1020 place count 2087 transition count 2571
Discarding 217 places :
Symmetric choice reduction at 1 with 217 rule applications. Total rules 1237 place count 1870 transition count 2354
Iterating global reduction 1 with 217 rules applied. Total rules applied 1454 place count 1870 transition count 2354
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 1532 place count 1792 transition count 2276
Iterating global reduction 1 with 78 rules applied. Total rules applied 1610 place count 1792 transition count 2276
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 1624 place count 1792 transition count 2262
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1666 place count 1750 transition count 2220
Iterating global reduction 2 with 42 rules applied. Total rules applied 1708 place count 1750 transition count 2220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1714 place count 1750 transition count 2214
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1745 place count 1719 transition count 2181
Iterating global reduction 3 with 31 rules applied. Total rules applied 1776 place count 1719 transition count 2181
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1796 place count 1699 transition count 2161
Iterating global reduction 3 with 20 rules applied. Total rules applied 1816 place count 1699 transition count 2161
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1835 place count 1680 transition count 2142
Iterating global reduction 3 with 19 rules applied. Total rules applied 1854 place count 1680 transition count 2142
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1873 place count 1661 transition count 2123
Iterating global reduction 3 with 19 rules applied. Total rules applied 1892 place count 1661 transition count 2123
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1906 place count 1647 transition count 2101
Iterating global reduction 3 with 14 rules applied. Total rules applied 1920 place count 1647 transition count 2101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1923 place count 1644 transition count 2096
Iterating global reduction 3 with 3 rules applied. Total rules applied 1926 place count 1644 transition count 2096
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1928 place count 1642 transition count 2093
Iterating global reduction 3 with 2 rules applied. Total rules applied 1930 place count 1642 transition count 2093
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1931 place count 1641 transition count 2092
Iterating global reduction 3 with 1 rules applied. Total rules applied 1932 place count 1641 transition count 2092
Applied a total of 1932 rules in 1439 ms. Remains 1641 /2584 variables (removed 943) and now considering 2092/3094 (removed 1002) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10190816317793371812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6963275053242475772.kers'
[2026-05-23 01:26:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10190816317793371812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6963275053242475772.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2092 rows 1641 cols 4363 entries
Finished phase 1 with 1636 SingleSign rule and 1 generalized
[2026-05-23 01:26:39] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-6963275053242475772.kers
Total runtime 13 ms.
[2026-05-23 01:26:39] [INFO ] Implicit Places using invariants in 493 ms returned []
[2026-05-23 01:26:39] [INFO ] Invariant cache hit.
[2026-05-23 01:26:40] [INFO ] Implicit Places using invariants and state equation in 1078 ms returned [1630]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1607 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1640/2584 places, 2092/3094 transitions.
Applied a total of 0 rules in 46 ms. Remains 1640 /1640 variables (removed 0) and now considering 2092/2092 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3117 ms. Remains : 1640/2584 places, 2092/3094 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Applied a total of 0 rules in 48 ms. Remains 1640 /1640 variables (removed 0) and now considering 2092/2092 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14763397245314179362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3407844506725673184.kers'
[2026-05-23 01:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14763397245314179362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3407844506725673184.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2092 rows 1640 cols 4361 entries
Finished phase 1 with 1636 SingleSign rule and 1 generalized
[2026-05-23 01:26:41] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-3407844506725673184.kers
Total runtime 17 ms.
[2026-05-23 01:26:41] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-23 01:26:41] [INFO ] Invariant cache hit.
[2026-05-23 01:26:42] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
Running 2091 sub problems to find dead transitions.
[2026-05-23 01:26:42] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1639 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1639/3732 variables, and 3 constraints, problems are : Problem set: 0 solved, 2091 unsolved in 30061 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1640 constraints, PredecessorRefiner: 2091/2091 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2091 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1639 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2091 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1639/3732 variables, and 3 constraints, problems are : Problem set: 0 solved, 2091 unsolved in 30066 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1640 constraints, PredecessorRefiner: 0/2091 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60730ms problems are : Problem set: 0 solved, 2091 unsolved
Search for dead transitions found 0 dead transitions in 60751ms
Finished structural reductions in LTL mode , in 1 iterations and 62094 ms. Remains : 1640/1640 places, 2092/2092 transitions.
Support contains 104 out of 1640 places after structural reductions.
[2026-05-23 01:27:43] [INFO ] Flatten gal took : 120 ms
[2026-05-23 01:27:43] [INFO ] Flatten gal took : 66 ms
[2026-05-23 01:27:43] [INFO ] Input system was already deterministic with 2092 transitions.
RANDOM walk for 40000 steps (438 resets) in 2200 ms. (18 steps per ms) remains 58/76 properties
BEST_FIRST walk for 4001 steps (17 resets) in 79 ms. (50 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 67 ms. (58 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (14 resets) in 56 ms. (70 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (12 resets) in 64 ms. (61 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (11 resets) in 47 ms. (83 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (12 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (14 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (13 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (15 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (13 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (16 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (14 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (11 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (21 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (15 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (17 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (12 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (16 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (17 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 26 ms. (148 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (13 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (12 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (16 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (15 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4003 steps (11 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (17 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (11 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (16 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (20 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (18 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4000 steps (16 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (14 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (16 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (11 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (16 resets) in 16 ms. (235 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
[2026-05-23 01:27:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1544/1617 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1617 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 2074/3691 variables, 1617/1620 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3691 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 7/3698 variables, 5/1625 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3698/3732 variables, and 1625 constraints, problems are : Problem set: 0 solved, 56 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1622/1640 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1544/1617 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1617 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 2074/3691 variables, 1617/1620 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3691 variables, 56/1676 constraints. Problems are: Problem set: 0 solved, 56 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3691/3732 variables, and 1676 constraints, problems are : Problem set: 0 solved, 56 unsolved in 5024 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 1617/1640 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10101ms problems are : Problem set: 0 solved, 56 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 73 out of 1640 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Graph (trivial) has 1832 edges and 1640 vertex of which 505 / 1640 are part of one of the 55 SCC in 12 ms
Free SCC test removed 450 places
Drop transitions (Empty/Sink Transition effects.) removed 559 transitions
Reduce isomorphic transitions removed 559 transitions.
Graph (complete) has 1713 edges and 1190 vertex of which 1182 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 582 rules applied. Total rules applied 584 place count 1182 transition count 947
Reduce places removed 576 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 634 rules applied. Total rules applied 1218 place count 606 transition count 889
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 41 rules applied. Total rules applied 1259 place count 571 transition count 883
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 9 rules applied. Total rules applied 1268 place count 568 transition count 877
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 6 rules applied. Total rules applied 1274 place count 565 transition count 874
Reduce places removed 2 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 5 with 28 rules applied. Total rules applied 1302 place count 563 transition count 848
Reduce places removed 26 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 6 with 33 rules applied. Total rules applied 1335 place count 537 transition count 841
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 1340 place count 534 transition count 839
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1341 place count 533 transition count 839
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 68 Pre rules applied. Total rules applied 1341 place count 533 transition count 771
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 9 with 136 rules applied. Total rules applied 1477 place count 465 transition count 771
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1481 place count 461 transition count 767
Iterating global reduction 9 with 4 rules applied. Total rules applied 1485 place count 461 transition count 767
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1487 place count 459 transition count 765
Iterating global reduction 9 with 2 rules applied. Total rules applied 1489 place count 459 transition count 765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1491 place count 459 transition count 763
Performed 192 Post agglomeration using F-continuation condition with reduction of 95 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 10 with 384 rules applied. Total rules applied 1875 place count 267 transition count 476
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 27 rules applied. Total rules applied 1902 place count 267 transition count 449
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1904 place count 266 transition count 448
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1908 place count 262 transition count 444
Iterating global reduction 12 with 4 rules applied. Total rules applied 1912 place count 262 transition count 444
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1913 place count 261 transition count 443
Iterating global reduction 12 with 1 rules applied. Total rules applied 1914 place count 261 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1915 place count 261 transition count 442
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 1927 place count 255 transition count 436
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 1931 place count 255 transition count 432
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1932 place count 254 transition count 430
Iterating global reduction 14 with 1 rules applied. Total rules applied 1933 place count 254 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1934 place count 254 transition count 429
Performed 36 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 15 with 72 rules applied. Total rules applied 2006 place count 218 transition count 477
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 15 with 25 rules applied. Total rules applied 2031 place count 218 transition count 452
Discarding 10 places :
Symmetric choice reduction at 16 with 10 rule applications. Total rules 2041 place count 208 transition count 432
Iterating global reduction 16 with 10 rules applied. Total rules applied 2051 place count 208 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2052 place count 208 transition count 431
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2053 place count 207 transition count 429
Iterating global reduction 17 with 1 rules applied. Total rules applied 2054 place count 207 transition count 429
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2055 place count 207 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 18 with 24 rules applied. Total rules applied 2079 place count 207 transition count 404
Free-agglomeration rule applied 17 times.
Iterating global reduction 18 with 17 rules applied. Total rules applied 2096 place count 207 transition count 387
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 18 rules applied. Total rules applied 2114 place count 190 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 19 with 5 rules applied. Total rules applied 2119 place count 190 transition count 381
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 19 with 6 rules applied. Total rules applied 2125 place count 190 transition count 381
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2126 place count 190 transition count 381
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 2129 place count 190 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2130 place count 190 transition count 380
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 2131 place count 189 transition count 379
Applied a total of 2131 rules in 247 ms. Remains 189 /1640 variables (removed 1451) and now considering 379/2092 (removed 1713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 189/1640 places, 379/2092 transitions.
RANDOM walk for 40000 steps (5070 resets) in 886 ms. (45 steps per ms) remains 11/56 properties
BEST_FIRST walk for 40004 steps (979 resets) in 109 ms. (363 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (839 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1175 resets) in 81 ms. (487 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (1207 resets) in 82 ms. (481 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1246 resets) in 81 ms. (487 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (1155 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1229 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1278 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
[2026-05-23 01:27:55] [INFO ] Flow matrix only has 368 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11206553816512036421.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10013061168757602264.kers'
[2026-05-23 01:27:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11206553816512036421.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10013061168757602264.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 189 cols 1029 entries
Finished phase 1 with 186 SingleSign rule and 0 generalized
[2026-05-23 01:27:55] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10013061168757602264.kers
Total runtime 2 ms.
[2026-05-23 01:27:55] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (OVERLAPS) 126/144 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 309/453 variables, 144/147 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 3/150 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 41/494 variables, 15/165 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 2/167 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 41/535 variables, 16/183 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 18/553 variables, 10/193 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/553 variables, 0/193 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 13 (OVERLAPS) 4/557 variables, 4/197 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/198 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/557 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 198 constraints, problems are : Problem set: 4 solved, 4 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 189/189 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 131/140 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 292/432 variables, 140/143 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 2/145 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 0/145 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 45/477 variables, 12/157 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 5/162 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 2/164 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 1/165 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/477 variables, 1/166 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/477 variables, 0/166 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 41/518 variables, 15/181 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 0/181 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 28/546 variables, 14/195 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/546 variables, 0/195 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 8/554 variables, 6/201 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/554 variables, 0/201 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 3/557 variables, 2/203 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 203 constraints, problems are : Problem set: 5 solved, 3 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 189/189 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1236ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 261 ms.
Support contains 8 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 379/379 transitions.
Graph (trivial) has 186 edges and 189 vertex of which 50 / 189 are part of one of the 20 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 56 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 159 transition count 292
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 40 rules applied. Total rules applied 72 place count 128 transition count 283
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 126 transition count 282
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 75 place count 126 transition count 271
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 97 place count 115 transition count 271
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 110 transition count 264
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 110 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 110 transition count 263
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 144 place count 92 transition count 241
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 153 place count 92 transition count 232
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 157 place count 88 transition count 225
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 88 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 163 place count 88 transition count 223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 87 transition count 222
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 87 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 167 place count 87 transition count 220
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 7 with 2 rules applied. Total rules applied 169 place count 86 transition count 219
Performed 10 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 189 place count 76 transition count 217
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 216 place count 76 transition count 190
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 226 place count 66 transition count 176
Iterating global reduction 8 with 10 rules applied. Total rules applied 236 place count 66 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 243 place count 66 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 247 place count 64 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 250 place count 64 transition count 164
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 251 place count 63 transition count 163
Iterating global reduction 10 with 1 rules applied. Total rules applied 252 place count 63 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 253 place count 63 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 11 with 29 rules applied. Total rules applied 282 place count 63 transition count 133
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 283 place count 62 transition count 130
Iterating global reduction 11 with 1 rules applied. Total rules applied 284 place count 62 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 285 place count 62 transition count 129
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 286 place count 61 transition count 128
Iterating global reduction 12 with 1 rules applied. Total rules applied 287 place count 61 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 288 place count 61 transition count 127
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 13 with 2 rules applied. Total rules applied 290 place count 60 transition count 126
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 291 place count 60 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 293 place count 60 transition count 123
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 294 place count 59 transition count 120
Iterating global reduction 14 with 1 rules applied. Total rules applied 295 place count 59 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 296 place count 59 transition count 119
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 297 place count 58 transition count 118
Iterating global reduction 15 with 1 rules applied. Total rules applied 298 place count 58 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 300 place count 58 transition count 116
Free-agglomeration rule applied 3 times.
Iterating global reduction 16 with 3 rules applied. Total rules applied 303 place count 58 transition count 113
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 307 place count 55 transition count 112
Applied a total of 307 rules in 77 ms. Remains 55 /189 variables (removed 134) and now considering 112/379 (removed 267) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 55/189 places, 112/379 transitions.
RANDOM walk for 40000 steps (9 resets) in 83 ms. (476 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (10 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2026-05-23 01:27:57] [INFO ] Flow matrix only has 107 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10729579493149284556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2462408883815928547.kers'
[2026-05-23 01:27:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10729579493149284556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2462408883815928547.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 55 cols 294 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-23 01:27:57] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2462408883815928547.kers
Total runtime 0 ms.
[2026-05-23 01:27:57] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/73 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/84 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 34/118 variables, 10/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/138 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 24/162 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/162 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/162 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 55/55 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp35 is UNSAT
After SMT solving in domain Int declared 22/162 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/4 constraints, State Equation: 0/55 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2026-05-23 01:27:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 01:27:57] [INFO ] Flatten gal took : 52 ms
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 01:27:57] [INFO ] Flatten gal took : 42 ms
[2026-05-23 01:27:57] [INFO ] Input system was already deterministic with 2092 transitions.
Support contains 82 out of 1640 places (down from 91) after GAL structural reductions.
Computed a total of 30 stabilizing places and 32 stable transitions
Graph (complete) has 2273 edges and 1640 vertex of which 1632 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.30 ms
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 1590 transition count 2040
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 1590 transition count 2040
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 105 place count 1590 transition count 2035
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 133 place count 1562 transition count 2006
Iterating global reduction 1 with 28 rules applied. Total rules applied 161 place count 1562 transition count 2006
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 163 place count 1562 transition count 2004
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 181 place count 1544 transition count 1983
Iterating global reduction 2 with 18 rules applied. Total rules applied 199 place count 1544 transition count 1983
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 203 place count 1544 transition count 1979
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 215 place count 1532 transition count 1963
Iterating global reduction 3 with 12 rules applied. Total rules applied 227 place count 1532 transition count 1963
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 234 place count 1525 transition count 1955
Iterating global reduction 3 with 7 rules applied. Total rules applied 241 place count 1525 transition count 1955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 1525 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 245 place count 1522 transition count 1951
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 1522 transition count 1951
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 250 place count 1520 transition count 1948
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 1520 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 1518 transition count 1945
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 1518 transition count 1945
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 258 place count 1516 transition count 1942
Iterating global reduction 4 with 2 rules applied. Total rules applied 260 place count 1516 transition count 1942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 1516 transition count 1941
Applied a total of 261 rules in 780 ms. Remains 1516 /1640 variables (removed 124) and now considering 1941/2092 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11586182978557590769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1260040745605834209.kers'
[2026-05-23 01:28:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11586182978557590769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1260040745605834209.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1941 rows 1516 cols 4049 entries
Finished phase 1 with 1512 SingleSign rule and 1 generalized
[2026-05-23 01:28:00] [INFO ] Computed 3 invariants in 13 ms
Computed 3 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-1260040745605834209.kers
Total runtime 15 ms.
[2026-05-23 01:28:00] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 01:28:00] [INFO ] Invariant cache hit.
[2026-05-23 01:28:01] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1158 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2026-05-23 01:28:01] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1515/3457 variables, and 3 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1515 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1515/3457 variables, and 3 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1516 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 1516/1640 places, 1941/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62414 ms. Remains : 1516/1640 places, 1941/2092 transitions.
[2026-05-23 01:29:02] [INFO ] Flatten gal took : 32 ms
[2026-05-23 01:29:02] [INFO ] Flatten gal took : 34 ms
[2026-05-23 01:29:02] [INFO ] Input system was already deterministic with 1941 transitions.
[2026-05-23 01:29:02] [INFO ] Flatten gal took : 27 ms
[2026-05-23 01:29:02] [INFO ] Flatten gal took : 29 ms
[2026-05-23 01:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability2231460283932336918.gal : 24 ms
[2026-05-23 01:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13933836415265176438.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2231460283932336918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13933836415265176438.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,6.75258e+09,7.0252,167320,2,18701,5,439907,6,0,8007,804799,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:29:32] [INFO ] Flatten gal took : 28 ms
[2026-05-23 01:29:32] [INFO ] Applying decomposition
[2026-05-23 01:29:32] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6839319263258686696.txt' '-o' '/tmp/graph6839319263258686696.bin' '-w' '/tmp/graph6839319263258686696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6839319263258686696.bin' '-l' '-1' '-v' '-w' '/tmp/graph6839319263258686696.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:29:32] [INFO ] Decomposing Gal with order
[2026-05-23 01:29:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:29:33] [INFO ] Removed a total of 529 redundant transitions.
[2026-05-23 01:29:33] [INFO ] Flatten gal took : 127 ms
[2026-05-23 01:29:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 33 ms.
[2026-05-23 01:29:33] [INFO ] Time to serialize gal into /tmp/CTLFireability6071785653096417894.gal : 25 ms
[2026-05-23 01:29:33] [INFO ] Time to serialize properties into /tmp/CTLFireability7699261920804890606.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/CTLFireability6071785653096417894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7699261920804890606.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,6.75258e+09,0.824605,32280,1810,208,49087,4085,2555,78476,121,24007,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((AF((i38.i0.i4.u599.p2434==1)) + (i30.i0.i2.u488.p2025==1)) + ((i5.u65.p361==1)&&(i32.i1.i2.u518.p2121==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((!(EG(!((i38.i0.i4.u599.p2434==1)))) + (i30.i0.i2.u488.p2025==1)) + ((i5.u65...205
Reverse transition relation is NOT exact ! Due to transitions t26, t188, t217, t269, t330, t379, t452, t686, t738, t798, t847, t1122, t1151, t1203, t1234, ...2073
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 39
(forward)formula 0,0,7.6564,295464,1,0,538886,10811,25679,1.22818e+06,599,51490,1687177
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Graph (trivial) has 1982 edges and 1640 vertex of which 678 / 1640 are part of one of the 62 SCC in 5 ms
Free SCC test removed 616 places
Ensure Unique test removed 718 transitions
Reduce isomorphic transitions removed 718 transitions.
Graph (complete) has 1553 edges and 1024 vertex of which 1016 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 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 571 transitions
Trivial Post-agglo rules discarded 571 transitions
Performed 571 trivial Post agglomeration. Transition count delta: 571
Iterating post reduction 0 with 571 rules applied. Total rules applied 573 place count 1015 transition count 797
Reduce places removed 571 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 604 rules applied. Total rules applied 1177 place count 444 transition count 764
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 19 rules applied. Total rules applied 1196 place count 429 transition count 760
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1200 place count 425 transition count 760
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1200 place count 425 transition count 713
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1294 place count 378 transition count 713
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1311 place count 361 transition count 686
Iterating global reduction 4 with 17 rules applied. Total rules applied 1328 place count 361 transition count 686
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1328 place count 361 transition count 685
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1330 place count 360 transition count 685
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1337 place count 353 transition count 675
Iterating global reduction 4 with 7 rules applied. Total rules applied 1344 place count 353 transition count 675
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 1348 place count 353 transition count 671
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1349 place count 352 transition count 671
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1350 place count 351 transition count 669
Iterating global reduction 6 with 1 rules applied. Total rules applied 1351 place count 351 transition count 669
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1352 place count 350 transition count 667
Iterating global reduction 6 with 1 rules applied. Total rules applied 1353 place count 350 transition count 667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1354 place count 349 transition count 665
Iterating global reduction 6 with 1 rules applied. Total rules applied 1355 place count 349 transition count 665
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1356 place count 348 transition count 663
Iterating global reduction 6 with 1 rules applied. Total rules applied 1357 place count 348 transition count 663
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 1443 place count 305 transition count 620
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 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 6 with 29 rules applied. Total rules applied 1472 place count 305 transition count 591
Reduce places removed 7 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 7 with 11 rules applied. Total rules applied 1483 place count 298 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1485 place count 296 transition count 587
Discarding 14 places :
Symmetric choice reduction at 9 with 14 rule applications. Total rules 1499 place count 282 transition count 564
Iterating global reduction 9 with 14 rules applied. Total rules applied 1513 place count 282 transition count 564
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1523 place count 272 transition count 546
Iterating global reduction 9 with 10 rules applied. Total rules applied 1533 place count 272 transition count 546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1535 place count 272 transition count 544
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 10 with 8 rules applied. Total rules applied 1543 place count 268 transition count 540
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 10 with 9 rules applied. Total rules applied 1552 place count 268 transition count 531
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1555 place count 265 transition count 531
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1559 place count 261 transition count 523
Iterating global reduction 12 with 4 rules applied. Total rules applied 1563 place count 261 transition count 523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1564 place count 261 transition count 522
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1565 place count 260 transition count 520
Iterating global reduction 13 with 1 rules applied. Total rules applied 1566 place count 260 transition count 520
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1567 place count 259 transition count 516
Iterating global reduction 13 with 1 rules applied. Total rules applied 1568 place count 259 transition count 516
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 13 with 74 rules applied. Total rules applied 1642 place count 259 transition count 442
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 13 with 33 rules applied. Total rules applied 1675 place count 259 transition count 409
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 14 with 33 rules applied. Total rules applied 1708 place count 226 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 3 Pre rules applied. Total rules applied 1708 place count 226 transition count 406
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 1714 place count 223 transition count 406
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 15 with 8 rules applied. Total rules applied 1722 place count 219 transition count 402
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1725 place count 216 transition count 399
Iterating global reduction 15 with 3 rules applied. Total rules applied 1728 place count 216 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 15 with 8 rules applied. Total rules applied 1736 place count 216 transition count 391
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1737 place count 216 transition count 391
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 1738 place count 216 transition count 390
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1739 place count 215 transition count 389
Applied a total of 1739 rules in 178 ms. Remains 215 /1640 variables (removed 1425) and now considering 389/2092 (removed 1703) transitions.
[2026-05-23 01:29:41] [INFO ] Flow matrix only has 338 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15231187719496184949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12959978019931068785.kers'
[2026-05-23 01:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15231187719496184949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12959978019931068785.kers]
Normalized transition count is 337 out of 338 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 337 rows 215 cols 805 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-23 01:29:41] [INFO ] Computed 0 invariants in 3 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12959978019931068785.kers
Total runtime 4 ms.
[2026-05-23 01:29:41] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 01:29:41] [INFO ] Flow matrix only has 338 transitions (discarded 51 similar events)
[2026-05-23 01:29:41] [INFO ] Invariant cache hit.
[2026-05-23 01:29:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 01:29:41] [INFO ] Implicit Places using invariants and state equation in 188 ms returned [16, 83, 147]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 264 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 212/1640 places, 389/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 209 transition count 386
Applied a total of 4 rules in 14 ms. Remains 209 /212 variables (removed 3) and now considering 386/389 (removed 3) transitions.
[2026-05-23 01:29:41] [INFO ] Flow matrix only has 335 transitions (discarded 51 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17291074073049912120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10108053181677826224.kers'
[2026-05-23 01:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17291074073049912120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10108053181677826224.kers]
Normalized transition count is 334 out of 335 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 209 cols 794 entries
Finished phase 1 with 209 SingleSign rule and 0 generalized
[2026-05-23 01:29:41] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10108053181677826224.kers
Total runtime 2 ms.
[2026-05-23 01:29:41] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-23 01:29:41] [INFO ] Flow matrix only has 335 transitions (discarded 51 similar events)
[2026-05-23 01:29:41] [INFO ] Invariant cache hit.
[2026-05-23 01:29:41] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 209/1640 places, 386/2092 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 658 ms. Remains : 209/1640 places, 386/2092 transitions.
[2026-05-23 01:29:41] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:29:41] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:29:41] [INFO ] Input system was already deterministic with 386 transitions.
[2026-05-23 01:29:41] [INFO ] Flatten gal took : 8 ms
[2026-05-23 01:29:41] [INFO ] Flatten gal took : 5 ms
[2026-05-23 01:29:41] [INFO ] Time to serialize gal into /tmp/CTLFireability6241313992685432483.gal : 5 ms
[2026-05-23 01:29:41] [INFO ] Time to serialize properties into /tmp/CTLFireability12675361620531475610.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/CTLFireability6241313992685432483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12675361620531475610.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,2.25063e+06,0.236412,12436,2,1765,5,27825,6,0,1163,41290,0


Converting to forward existential form...Done !
original formula: EG(((A((p1501==1) U AF(((p2343==1)&&(p1240==1)))) + AG(((p1824==0) + !(A((p1423==1) U (p358==1)))))) + ((p572==1)&&(p2310==1))))
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(EG(!(((p2343==1)&&(p1240==1)))))) U (!((p1501==1)) * !(!(EG(!(((p2343==1)&&(p1240==1))))))...351
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t12, t20, t35, t59, t65, t72, t77, t78, t80, t97, t122, t128, t131, t137, t138, ...496
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.94245,173552,1,0,661,984595,730,387,7122,1.07078e+06,987
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1588 transition count 2038
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1588 transition count 2038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 109 place count 1588 transition count 2033
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 139 place count 1558 transition count 2002
Iterating global reduction 1 with 30 rules applied. Total rules applied 169 place count 1558 transition count 2002
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 171 place count 1558 transition count 2000
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 1540 transition count 1979
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 1540 transition count 1979
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 211 place count 1540 transition count 1975
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 223 place count 1528 transition count 1959
Iterating global reduction 3 with 12 rules applied. Total rules applied 235 place count 1528 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 1521 transition count 1951
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 1521 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 254 place count 1517 transition count 1946
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 1517 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 261 place count 1514 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 264 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 1511 transition count 1938
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 1511 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 273 place count 1508 transition count 1934
Iterating global reduction 4 with 3 rules applied. Total rules applied 276 place count 1508 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 277 place count 1508 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 278 place count 1507 transition count 1931
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1506 transition count 1929
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1506 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1505 transition count 1928
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1505 transition count 1928
Applied a total of 283 rules in 788 ms. Remains 1505 /1640 variables (removed 135) and now considering 1928/2092 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14849087700307614637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8902951024776096079.kers'
[2026-05-23 01:29:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14849087700307614637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8902951024776096079.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1928 rows 1505 cols 4023 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 01:29:47] [INFO ] Computed 3 invariants in 14 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-8902951024776096079.kers
Total runtime 16 ms.
[2026-05-23 01:29:47] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-23 01:29:47] [INFO ] Invariant cache hit.
[2026-05-23 01:29:48] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2026-05-23 01:29:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 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 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1640 places, 1928/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62462 ms. Remains : 1505/1640 places, 1928/2092 transitions.
[2026-05-23 01:30:49] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:30:49] [INFO ] Flatten gal took : 51 ms
[2026-05-23 01:30:49] [INFO ] Input system was already deterministic with 1928 transitions.
[2026-05-23 01:30:49] [INFO ] Flatten gal took : 38 ms
[2026-05-23 01:30:49] [INFO ] Flatten gal took : 37 ms
[2026-05-23 01:30:49] [INFO ] Time to serialize gal into /tmp/CTLFireability1391290737428625774.gal : 9 ms
[2026-05-23 01:30:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10697214469620830325.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/CTLFireability1391290737428625774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10697214469620830325.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,6.57203e+09,7.45214,182932,2,18985,5,495243,6,0,7950,866740,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:31:19] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:31:19] [INFO ] Applying decomposition
[2026-05-23 01:31:19] [INFO ] Flatten gal took : 21 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/graph2247056072172417909.txt' '-o' '/tmp/graph2247056072172417909.bin' '-w' '/tmp/graph2247056072172417909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2247056072172417909.bin' '-l' '-1' '-v' '-w' '/tmp/graph2247056072172417909.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:31:19] [INFO ] Decomposing Gal with order
[2026-05-23 01:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:31:20] [INFO ] Removed a total of 517 redundant transitions.
[2026-05-23 01:31:20] [INFO ] Flatten gal took : 105 ms
[2026-05-23 01:31:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 35 ms.
[2026-05-23 01:31:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14478281563146911935.gal : 14 ms
[2026-05-23 01:31:20] [INFO ] Time to serialize properties into /tmp/CTLFireability18383131490663387068.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/CTLFireability14478281563146911935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18383131490663387068.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,6.57203e+09,0.846093,28988,1749,207,39000,4389,2480,71028,123,27224,0


Converting to forward existential form...Done !
original formula: A(A(AX(AG((i38.i3.i0.u610.p2514!=1))) U AX(!(EF((i1.u76.p414==1))))) U (i4.u53.p299==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i4.u53.p299==1))))) * !(E(!((i4.u53.p299==1)) U (!(!((E(!(!(EX(!(!(E(TRUE U (i1.u76.p414==1)))...352
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t291, t369, t440, t489, t645, t726, t757, t786, t835, t1110, t1191, t1222, t...2032
Using 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 6
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
Using 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 6
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 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 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,7.28696,270524,1,0,501640,7490,21364,1.17138e+06,572,31317,1540668
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1593 transition count 2043
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1593 transition count 2043
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 98 place count 1593 transition count 2039
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 124 place count 1567 transition count 2013
Iterating global reduction 1 with 26 rules applied. Total rules applied 150 place count 1567 transition count 2013
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 152 place count 1567 transition count 2011
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 168 place count 1551 transition count 1993
Iterating global reduction 2 with 16 rules applied. Total rules applied 184 place count 1551 transition count 1993
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 188 place count 1551 transition count 1989
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 198 place count 1541 transition count 1976
Iterating global reduction 3 with 10 rules applied. Total rules applied 208 place count 1541 transition count 1976
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 215 place count 1534 transition count 1968
Iterating global reduction 3 with 7 rules applied. Total rules applied 222 place count 1534 transition count 1968
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 223 place count 1534 transition count 1967
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 226 place count 1531 transition count 1964
Iterating global reduction 4 with 3 rules applied. Total rules applied 229 place count 1531 transition count 1964
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 1529 transition count 1962
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 1529 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 235 place count 1527 transition count 1960
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 1527 transition count 1960
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 239 place count 1525 transition count 1957
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 1525 transition count 1957
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 242 place count 1524 transition count 1955
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 1524 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 1523 transition count 1953
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 1523 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 1522 transition count 1952
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 1522 transition count 1952
Applied a total of 247 rules in 793 ms. Remains 1522 /1640 variables (removed 118) and now considering 1952/2092 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-558188410757242802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12618197084016369658.kers'
[2026-05-23 01:31:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-558188410757242802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12618197084016369658.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1952 rows 1522 cols 4071 entries
Finished phase 1 with 1518 SingleSign rule and 1 generalized
[2026-05-23 01:31:28] [INFO ] Computed 3 invariants in 10 ms
Computed 3 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12618197084016369658.kers
Total runtime 14 ms.
[2026-05-23 01:31:29] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-23 01:31:29] [INFO ] Invariant cache hit.
[2026-05-23 01:31:29] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2026-05-23 01:31:30] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1521/3474 variables, and 3 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1521 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1521/3474 variables, and 3 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60448ms
Starting structural reductions in LTL mode, iteration 1 : 1522/1640 places, 1952/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62444 ms. Remains : 1522/1640 places, 1952/2092 transitions.
[2026-05-23 01:32:30] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:32:30] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:32:30] [INFO ] Input system was already deterministic with 1952 transitions.
[2026-05-23 01:32:30] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:32:30] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:32:30] [INFO ] Time to serialize gal into /tmp/CTLFireability477044968144653952.gal : 5 ms
[2026-05-23 01:32:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3236179995460654718.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/CTLFireability477044968144653952.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3236179995460654718.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,6.80098e+09,6.78167,174028,2,18746,5,464571,6,0,8042,833419,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:33:00] [INFO ] Flatten gal took : 30 ms
[2026-05-23 01:33:00] [INFO ] Applying decomposition
[2026-05-23 01:33:00] [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/graph10775985559969747310.txt' '-o' '/tmp/graph10775985559969747310.bin' '-w' '/tmp/graph10775985559969747310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10775985559969747310.bin' '-l' '-1' '-v' '-w' '/tmp/graph10775985559969747310.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:33:00] [INFO ] Decomposing Gal with order
[2026-05-23 01:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:33:01] [INFO ] Removed a total of 481 redundant transitions.
[2026-05-23 01:33:01] [INFO ] Flatten gal took : 46 ms
[2026-05-23 01:33:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 29 ms.
[2026-05-23 01:33:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6514178729961067991.gal : 12 ms
[2026-05-23 01:33:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2296411096768650593.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/CTLFireability6514178729961067991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2296411096768650593.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,6.80098e+09,1.05709,39504,1880,219,63769,7628,2533,96824,148,29532,0


Converting to forward existential form...Done !
original formula: (AX(A(!(((EX((i37.i0.i0.u554.p2273==1)) * ((i9.u185.p849==1)||(i19.i0.i4.u432.p1841==1))) * (i37.i0.i0.u554.p2273!=1))) U !(((i19.i0.i3.u...344
=> equivalent forward existential formula: ((([(((FwdU(EY(Init),!(!(((i19.i0.i3.u400.p1693!=1) * ((i4.u64.p368==1) + E((i0.u44.p280==1) U (i30.i0.i2.u420.p...1018
Using 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 4
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 39
(forward)formula 0,0,2.72223,91164,1,0,150193,9293,11199,431022,620,31856,316775
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1591 transition count 2041
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1591 transition count 2041
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 103 place count 1591 transition count 2036
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 129 place count 1565 transition count 2009
Iterating global reduction 1 with 26 rules applied. Total rules applied 155 place count 1565 transition count 2009
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 157 place count 1565 transition count 2007
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 173 place count 1549 transition count 1988
Iterating global reduction 2 with 16 rules applied. Total rules applied 189 place count 1549 transition count 1988
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 192 place count 1549 transition count 1985
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 203 place count 1538 transition count 1970
Iterating global reduction 3 with 11 rules applied. Total rules applied 214 place count 1538 transition count 1970
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 220 place count 1532 transition count 1963
Iterating global reduction 3 with 6 rules applied. Total rules applied 226 place count 1532 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 1532 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 230 place count 1529 transition count 1959
Iterating global reduction 4 with 3 rules applied. Total rules applied 233 place count 1529 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 236 place count 1526 transition count 1955
Iterating global reduction 4 with 3 rules applied. Total rules applied 239 place count 1526 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 242 place count 1523 transition count 1951
Iterating global reduction 4 with 3 rules applied. Total rules applied 245 place count 1523 transition count 1951
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 248 place count 1520 transition count 1947
Iterating global reduction 4 with 3 rules applied. Total rules applied 251 place count 1520 transition count 1947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 1520 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 253 place count 1519 transition count 1944
Iterating global reduction 5 with 1 rules applied. Total rules applied 254 place count 1519 transition count 1944
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 255 place count 1518 transition count 1942
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 1518 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 257 place count 1517 transition count 1941
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 1517 transition count 1941
Applied a total of 258 rules in 779 ms. Remains 1517 /1640 variables (removed 123) and now considering 1941/2092 (removed 151) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10283218650587929376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12667008922445285877.kers'
[2026-05-23 01:33:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10283218650587929376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12667008922445285877.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1941 rows 1517 cols 4049 entries
Finished phase 1 with 1513 SingleSign rule and 1 generalized
[2026-05-23 01:33:04] [INFO ] Computed 3 invariants in 16 ms
Computed 3 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-12667008922445285877.kers
Total runtime 21 ms.
[2026-05-23 01:33:04] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-23 01:33:04] [INFO ] Invariant cache hit.
[2026-05-23 01:33:06] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
Running 1940 sub problems to find dead transitions.
[2026-05-23 01:33:06] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1516/3458 variables, and 3 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 1940/1940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1940 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1516 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1940 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1516/3458 variables, and 3 constraints, problems are : Problem set: 0 solved, 1940 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1517 constraints, PredecessorRefiner: 0/1940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 1940 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Starting structural reductions in LTL mode, iteration 1 : 1517/1640 places, 1941/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62627 ms. Remains : 1517/1640 places, 1941/2092 transitions.
[2026-05-23 01:34:06] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:34:06] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:34:06] [INFO ] Input system was already deterministic with 1941 transitions.
[2026-05-23 01:34:06] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:34:06] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:34:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8112730897433644754.gal : 9 ms
[2026-05-23 01:34:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14068845404975372854.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/CTLFireability8112730897433644754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14068845404975372854.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,6.77048e+09,8.66506,175848,2,18740,5,463223,6,0,8011,850418,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:34:36] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:34:36] [INFO ] Applying decomposition
[2026-05-23 01:34:36] [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/graph7328477828111185927.txt' '-o' '/tmp/graph7328477828111185927.bin' '-w' '/tmp/graph7328477828111185927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7328477828111185927.bin' '-l' '-1' '-v' '-w' '/tmp/graph7328477828111185927.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:34:36] [INFO ] Decomposing Gal with order
[2026-05-23 01:34:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:34:36] [INFO ] Removed a total of 487 redundant transitions.
[2026-05-23 01:34:37] [INFO ] Flatten gal took : 54 ms
[2026-05-23 01:34:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 11 ms.
[2026-05-23 01:34:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14092406459558503978.gal : 13 ms
[2026-05-23 01:34:37] [INFO ] Time to serialize properties into /tmp/CTLFireability15392952691613514541.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/CTLFireability14092406459558503978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15392952691613514541.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,6.77048e+09,0.871823,28648,1710,178,40766,4788,2499,63403,146,24184,0


Converting to forward existential form...Done !
original formula: AG(((!(E(AX(((i3.u12.p79==1)||(i28.i0.i4.u432.p1669==1))) U AG(E((i16.u205.p957==1) U (i18.i0.i3.u249.p1160==1))))) * (i36.i1.i3.u541.p22...223
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),!(EX(!(((i3.u12.p79==1)||(i28.i0.i4.u432.p1669==1)))))) * !(E(TRUE U !(E((i16.u205.p957...374
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t262, t322, t371, t442, t491, t676, t728, t759, t837, t1147, t1201, t1232, t1261, ...2060
(forward)formula 0,0,5.2591,178860,1,0,339951,6833,20700,616769,694,24184,1294510
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1587 transition count 2037
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1587 transition count 2037
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 111 place count 1587 transition count 2032
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 141 place count 1557 transition count 2001
Iterating global reduction 1 with 30 rules applied. Total rules applied 171 place count 1557 transition count 2001
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 1557 transition count 1999
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 191 place count 1539 transition count 1978
Iterating global reduction 2 with 18 rules applied. Total rules applied 209 place count 1539 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 213 place count 1539 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 225 place count 1527 transition count 1958
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 1527 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 1520 transition count 1950
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 1520 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 1520 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 256 place count 1516 transition count 1945
Iterating global reduction 4 with 4 rules applied. Total rules applied 260 place count 1516 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 263 place count 1513 transition count 1941
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 1513 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 1510 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 1510 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 1507 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 1507 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 279 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1506 transition count 1930
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1505 transition count 1928
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1505 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 1504 transition count 1927
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 1504 transition count 1927
Applied a total of 285 rules in 750 ms. Remains 1504 /1640 variables (removed 136) and now considering 1927/2092 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1646766658706544371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5631137172444613477.kers'
[2026-05-23 01:34:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1646766658706544371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5631137172444613477.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1927 rows 1504 cols 4021 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 01:34:43] [INFO ] Computed 3 invariants in 10 ms
Computed 3 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-5631137172444613477.kers
Total runtime 12 ms.
[2026-05-23 01:34:43] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 01:34:43] [INFO ] Invariant cache hit.
[2026-05-23 01:34:44] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1161 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 01:34:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60402ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60407ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1640 places, 1927/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62327 ms. Remains : 1504/1640 places, 1927/2092 transitions.
[2026-05-23 01:35:44] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:35:44] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:35:44] [INFO ] Input system was already deterministic with 1927 transitions.
[2026-05-23 01:35:44] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:35:44] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability3724856625403061972.gal : 5 ms
[2026-05-23 01:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14871970647044072830.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/CTLFireability3724856625403061972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14871970647044072830.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,6.54949e+09,7.71599,175440,2,18655,5,466142,6,0,7945,843154,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:36:14] [INFO ] Flatten gal took : 35 ms
[2026-05-23 01:36:14] [INFO ] Applying decomposition
[2026-05-23 01:36:14] [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/graph6581692123556872313.txt' '-o' '/tmp/graph6581692123556872313.bin' '-w' '/tmp/graph6581692123556872313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6581692123556872313.bin' '-l' '-1' '-v' '-w' '/tmp/graph6581692123556872313.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:36:14] [INFO ] Decomposing Gal with order
[2026-05-23 01:36:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:36:15] [INFO ] Removed a total of 502 redundant transitions.
[2026-05-23 01:36:15] [INFO ] Flatten gal took : 61 ms
[2026-05-23 01:36:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 11 ms.
[2026-05-23 01:36:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15935897222607824896.gal : 15 ms
[2026-05-23 01:36:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1537387810200938928.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/CTLFireability15935897222607824896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1537387810200938928.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,6.54949e+09,0.736565,25852,1757,181,35660,2246,2500,56426,123,12355,0


Converting to forward existential form...Done !
original formula: AF(AX((i14.i1.i0.u210.p957==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((i14.i1.i0.u210.p957==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t260, t291, t369, t440, t674, t726, t786, t835, t1110, t1139, t1191, t1222, t1300,...2009
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
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 LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 1589 transition count 2039
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 1589 transition count 2039
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 1589 transition count 2034
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 135 place count 1561 transition count 2005
Iterating global reduction 1 with 28 rules applied. Total rules applied 163 place count 1561 transition count 2005
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 165 place count 1561 transition count 2003
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 181 place count 1545 transition count 1984
Iterating global reduction 2 with 16 rules applied. Total rules applied 197 place count 1545 transition count 1984
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 201 place count 1545 transition count 1980
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 210 place count 1536 transition count 1969
Iterating global reduction 3 with 9 rules applied. Total rules applied 219 place count 1536 transition count 1969
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 225 place count 1530 transition count 1962
Iterating global reduction 3 with 6 rules applied. Total rules applied 231 place count 1530 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 235 place count 1526 transition count 1958
Iterating global reduction 3 with 4 rules applied. Total rules applied 239 place count 1526 transition count 1958
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 242 place count 1523 transition count 1954
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 1523 transition count 1954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 248 place count 1520 transition count 1950
Iterating global reduction 3 with 3 rules applied. Total rules applied 251 place count 1520 transition count 1950
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 254 place count 1517 transition count 1946
Iterating global reduction 3 with 3 rules applied. Total rules applied 257 place count 1517 transition count 1946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 258 place count 1517 transition count 1945
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 259 place count 1516 transition count 1943
Iterating global reduction 4 with 1 rules applied. Total rules applied 260 place count 1516 transition count 1943
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 261 place count 1515 transition count 1941
Iterating global reduction 4 with 1 rules applied. Total rules applied 262 place count 1515 transition count 1941
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 263 place count 1514 transition count 1940
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 1514 transition count 1940
Applied a total of 264 rules in 797 ms. Remains 1514 /1640 variables (removed 126) and now considering 1940/2092 (removed 152) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17834616805587490985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-589715127161025231.kers'
[2026-05-23 01:36:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17834616805587490985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-589715127161025231.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1940 rows 1514 cols 4047 entries
Finished phase 1 with 1510 SingleSign rule and 1 generalized
[2026-05-23 01:36:46] [INFO ] Computed 3 invariants in 17 ms
Computed 3 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-589715127161025231.kers
Total runtime 21 ms.
[2026-05-23 01:36:46] [INFO ] Implicit Places using invariants in 281 ms returned []
[2026-05-23 01:36:46] [INFO ] Invariant cache hit.
[2026-05-23 01:36:47] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1175 ms to find 0 implicit places.
Running 1939 sub problems to find dead transitions.
[2026-05-23 01:36:47] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1513/3454 variables, and 3 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 1939/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1513 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1939 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/3454 variables, and 3 constraints, problems are : Problem set: 0 solved, 1939 unsolved in 30050 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1514 constraints, PredecessorRefiner: 0/1939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 1939 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Starting structural reductions in LTL mode, iteration 1 : 1514/1640 places, 1940/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62455 ms. Remains : 1514/1640 places, 1940/2092 transitions.
[2026-05-23 01:37:47] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:37:47] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:37:47] [INFO ] Input system was already deterministic with 1940 transitions.
[2026-05-23 01:37:47] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:37:47] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:37:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9162957188236755550.gal : 5 ms
[2026-05-23 01:37:47] [INFO ] Time to serialize properties into /tmp/CTLFireability1379313188615691327.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/CTLFireability9162957188236755550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1379313188615691327.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,6.72035e+09,7.0863,174864,2,18678,5,461170,6,0,7998,843364,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:38:17] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:38:17] [INFO ] Applying decomposition
[2026-05-23 01:38:17] [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/graph13642502314592147897.txt' '-o' '/tmp/graph13642502314592147897.bin' '-w' '/tmp/graph13642502314592147897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13642502314592147897.bin' '-l' '-1' '-v' '-w' '/tmp/graph13642502314592147897.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:38:18] [INFO ] Decomposing Gal with order
[2026-05-23 01:38:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:38:18] [INFO ] Removed a total of 532 redundant transitions.
[2026-05-23 01:38:18] [INFO ] Flatten gal took : 93 ms
[2026-05-23 01:38:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 10 ms.
[2026-05-23 01:38:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8542102447270200474.gal : 17 ms
[2026-05-23 01:38:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8222620264779295093.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/CTLFireability8542102447270200474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8222620264779295093.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,6.72035e+09,0.816289,28332,1765,220,37902,4351,2590,66920,133,24331,0


Converting to forward existential form...Done !
original formula: AG((((i34.u529.p2143==1) + (EF(EG(A((i29.i2.i10.u411.p1666==1) U (i6.i0.i1.u17.p97==1)))) * EF(((i38.i0.i2.u588.p2360==1)||(i17.u274.p120...252
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((EX((i9.i0.i0.u44.p571==0)) * (i6.i0.i6.u78.p418==0)) * (i19.i1.i2.u295.p1288==0)))) *...546
Reverse transition relation is NOT exact ! Due to transitions t26, t212, t264, t295, t373, t444, t493, t649, t678, t730, t765, t839, t1119, t1200, t1231, t...2053
(forward)formula 0,0,5.7103,205408,1,0,367053,9720,21096,808456,653,37247,1395653
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 1592 transition count 2042
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 1592 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 100 place count 1592 transition count 2038
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 126 place count 1566 transition count 2011
Iterating global reduction 1 with 26 rules applied. Total rules applied 152 place count 1566 transition count 2011
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 154 place count 1566 transition count 2009
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 170 place count 1550 transition count 1990
Iterating global reduction 2 with 16 rules applied. Total rules applied 186 place count 1550 transition count 1990
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 189 place count 1550 transition count 1987
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 199 place count 1540 transition count 1974
Iterating global reduction 3 with 10 rules applied. Total rules applied 209 place count 1540 transition count 1974
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 215 place count 1534 transition count 1968
Iterating global reduction 3 with 6 rules applied. Total rules applied 221 place count 1534 transition count 1968
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 1534 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 226 place count 1530 transition count 1963
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 1530 transition count 1963
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 233 place count 1527 transition count 1959
Iterating global reduction 4 with 3 rules applied. Total rules applied 236 place count 1527 transition count 1959
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 239 place count 1524 transition count 1955
Iterating global reduction 4 with 3 rules applied. Total rules applied 242 place count 1524 transition count 1955
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 245 place count 1521 transition count 1951
Iterating global reduction 4 with 3 rules applied. Total rules applied 248 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 249 place count 1521 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 250 place count 1520 transition count 1948
Iterating global reduction 5 with 1 rules applied. Total rules applied 251 place count 1520 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 252 place count 1519 transition count 1946
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 1519 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 254 place count 1518 transition count 1945
Iterating global reduction 5 with 1 rules applied. Total rules applied 255 place count 1518 transition count 1945
Applied a total of 255 rules in 811 ms. Remains 1518 /1640 variables (removed 122) and now considering 1945/2092 (removed 147) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16563359093874081677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15254204421268116760.kers'
[2026-05-23 01:38:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16563359093874081677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15254204421268116760.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1945 rows 1518 cols 4057 entries
Finished phase 1 with 1514 SingleSign rule and 1 generalized
[2026-05-23 01:38:24] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15254204421268116760.kers
Total runtime 9 ms.
[2026-05-23 01:38:25] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-23 01:38:25] [INFO ] Invariant cache hit.
[2026-05-23 01:38:26] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Running 1944 sub problems to find dead transitions.
[2026-05-23 01:38:26] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1944 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1517/3463 variables, and 3 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1518 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/1517 variables, 3/3 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 1517/3463 variables, and 3 constraints, problems are : Problem set: 0 solved, 1944 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 0/1944 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 1944 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in LTL mode, iteration 1 : 1518/1640 places, 1945/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62472 ms. Remains : 1518/1640 places, 1945/2092 transitions.
[2026-05-23 01:39:26] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:39:26] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:39:26] [INFO ] Input system was already deterministic with 1945 transitions.
[2026-05-23 01:39:26] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:39:26] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:39:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13420868352780198421.gal : 5 ms
[2026-05-23 01:39:26] [INFO ] Time to serialize properties into /tmp/CTLFireability11543823211040864710.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/CTLFireability13420868352780198421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11543823211040864710.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,6.77951e+09,8.81804,176332,2,18741,5,467522,6,0,8019,847538,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:39:56] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:39:56] [INFO ] Applying decomposition
[2026-05-23 01:39:56] [INFO ] Flatten gal took : 24 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/graph16733152651712090742.txt' '-o' '/tmp/graph16733152651712090742.bin' '-w' '/tmp/graph16733152651712090742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16733152651712090742.bin' '-l' '-1' '-v' '-w' '/tmp/graph16733152651712090742.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:39:56] [INFO ] Decomposing Gal with order
[2026-05-23 01:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:39:56] [INFO ] Removed a total of 515 redundant transitions.
[2026-05-23 01:39:56] [INFO ] Flatten gal took : 56 ms
[2026-05-23 01:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 8 ms.
[2026-05-23 01:39:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15767415464824171873.gal : 12 ms
[2026-05-23 01:39:57] [INFO ] Time to serialize properties into /tmp/CTLFireability5225630461454612605.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/CTLFireability15767415464824171873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5225630461454612605.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,6.77951e+09,0.932432,32496,1932,209,46977,4791,2529,82246,126,31842,0


Converting to forward existential form...Done !
original formula: A(AX(!(((((i33.i1.i1.u569.p2371==1)||(i26.i0.i0.u334.p1500==1))&&(i19.u333.p1440!=1))||(((i21.i0.i0.u337.p1447==1)&&(i33.i0.i3.u591.p2474...257
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(!(EX(!(FALSE)))) + (i19.u332.p1438==1))) * E(TRUE U (i11.i1.i2.u179.p816!=1))))))) * !(E(...520
Reverse transition relation is NOT exact ! Due to transitions t26, t187, t268, t299, t377, t448, t497, t653, t734, t765, t794, t845, t1120, t1149, t1201, t...2061
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1587 transition count 2037
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1587 transition count 2037
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 111 place count 1587 transition count 2032
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 141 place count 1557 transition count 2001
Iterating global reduction 1 with 30 rules applied. Total rules applied 171 place count 1557 transition count 2001
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 1557 transition count 1999
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 191 place count 1539 transition count 1978
Iterating global reduction 2 with 18 rules applied. Total rules applied 209 place count 1539 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 213 place count 1539 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 225 place count 1527 transition count 1958
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 1527 transition count 1958
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 243 place count 1521 transition count 1952
Iterating global reduction 3 with 6 rules applied. Total rules applied 249 place count 1521 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 1521 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 254 place count 1517 transition count 1947
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 1517 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 261 place count 1514 transition count 1943
Iterating global reduction 4 with 3 rules applied. Total rules applied 264 place count 1514 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 1511 transition count 1939
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 1511 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 273 place count 1508 transition count 1935
Iterating global reduction 4 with 3 rules applied. Total rules applied 276 place count 1508 transition count 1935
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 277 place count 1508 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 278 place count 1507 transition count 1932
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1506 transition count 1930
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1505 transition count 1929
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1505 transition count 1929
Applied a total of 283 rules in 833 ms. Remains 1505 /1640 variables (removed 135) and now considering 1929/2092 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-105134349119299043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5804780356316719322.kers'
[2026-05-23 01:40:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-105134349119299043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5804780356316719322.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1929 rows 1505 cols 4025 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 01:40:27] [INFO ] Computed 3 invariants in 17 ms
Computed 3 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-5804780356316719322.kers
Total runtime 21 ms.
[2026-05-23 01:40:28] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 01:40:28] [INFO ] Invariant cache hit.
[2026-05-23 01:40:29] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 01:40:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3434 variables, and 3 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60456ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60461ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1640 places, 1929/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 1505/1640 places, 1929/2092 transitions.
[2026-05-23 01:41:29] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:41:29] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:41:29] [INFO ] Input system was already deterministic with 1929 transitions.
[2026-05-23 01:41:29] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:41:29] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:41:29] [INFO ] Time to serialize gal into /tmp/CTLFireability1744585376378603948.gal : 7 ms
[2026-05-23 01:41:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10750813992056005490.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/CTLFireability1744585376378603948.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10750813992056005490.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,6.56225e+09,7.06145,171880,2,18552,5,454535,6,0,7951,827553,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:41:59] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:41:59] [INFO ] Applying decomposition
[2026-05-23 01:41:59] [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/graph17790672518433202606.txt' '-o' '/tmp/graph17790672518433202606.bin' '-w' '/tmp/graph17790672518433202606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17790672518433202606.bin' '-l' '-1' '-v' '-w' '/tmp/graph17790672518433202606.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:41:59] [INFO ] Decomposing Gal with order
[2026-05-23 01:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:42:00] [INFO ] Removed a total of 513 redundant transitions.
[2026-05-23 01:42:00] [INFO ] Flatten gal took : 43 ms
[2026-05-23 01:42:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2026-05-23 01:42:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10727883071182314909.gal : 12 ms
[2026-05-23 01:42:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13527474179044462493.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/CTLFireability10727883071182314909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13527474179044462493.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,6.56225e+09,1.24905,44212,1715,162,76733,3138,2375,118630,125,15339,0


Converting to forward existential form...Done !
original formula: (EF(AX((i39.i1.i5.u589.p2480==1))) * EG(AF(AG((i5.i1.i1.u59.p323==1)))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(EX(!((i39.i1.i5.u589.p2480==1)))))),!(EG(!(!(E(TRUE U !((i5.i1.i1.u59.p323==1))))))))] ...163
Reverse transition relation is NOT exact ! Due to transitions t26, t181, t262, t293, t371, t442, t491, t676, t728, t759, t837, t1141, t1193, t1224, t1253, ...2014
Using 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 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
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
(forward)formula 0,0,5.59669,197600,1,0,364647,3559,20804,870209,568,15339,1170921
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1588 transition count 2038
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1588 transition count 2038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 109 place count 1588 transition count 2033
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 139 place count 1558 transition count 2002
Iterating global reduction 1 with 30 rules applied. Total rules applied 169 place count 1558 transition count 2002
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 171 place count 1558 transition count 2000
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 189 place count 1540 transition count 1979
Iterating global reduction 2 with 18 rules applied. Total rules applied 207 place count 1540 transition count 1979
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 211 place count 1540 transition count 1975
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 223 place count 1528 transition count 1959
Iterating global reduction 3 with 12 rules applied. Total rules applied 235 place count 1528 transition count 1959
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 242 place count 1521 transition count 1951
Iterating global reduction 3 with 7 rules applied. Total rules applied 249 place count 1521 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 1521 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 254 place count 1517 transition count 1946
Iterating global reduction 4 with 4 rules applied. Total rules applied 258 place count 1517 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 261 place count 1514 transition count 1942
Iterating global reduction 4 with 3 rules applied. Total rules applied 264 place count 1514 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 267 place count 1511 transition count 1938
Iterating global reduction 4 with 3 rules applied. Total rules applied 270 place count 1511 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 273 place count 1508 transition count 1934
Iterating global reduction 4 with 3 rules applied. Total rules applied 276 place count 1508 transition count 1934
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 277 place count 1508 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 278 place count 1507 transition count 1931
Iterating global reduction 5 with 1 rules applied. Total rules applied 279 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1506 transition count 1929
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1506 transition count 1929
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1505 transition count 1928
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1505 transition count 1928
Applied a total of 283 rules in 780 ms. Remains 1505 /1640 variables (removed 135) and now considering 1928/2092 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1375220377927347672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9861803882738218625.kers'
[2026-05-23 01:42:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1375220377927347672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9861803882738218625.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1928 rows 1505 cols 4023 entries
Finished phase 1 with 1501 SingleSign rule and 1 generalized
[2026-05-23 01:42:06] [INFO ] Computed 3 invariants in 12 ms
Computed 3 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9861803882738218625.kers
Total runtime 16 ms.
[2026-05-23 01:42:06] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-23 01:42:06] [INFO ] Invariant cache hit.
[2026-05-23 01:42:07] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Running 1927 sub problems to find dead transitions.
[2026-05-23 01:42:07] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 1927/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1927 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1504 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1927 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/3433 variables, and 3 constraints, problems are : Problem set: 0 solved, 1927 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1505 constraints, PredecessorRefiner: 0/1927 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1927 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 1505/1640 places, 1928/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62401 ms. Remains : 1505/1640 places, 1928/2092 transitions.
[2026-05-23 01:43:08] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:43:08] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:43:08] [INFO ] Input system was already deterministic with 1928 transitions.
[2026-05-23 01:43:08] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:43:08] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:43:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7699248294172382834.gal : 6 ms
[2026-05-23 01:43:08] [INFO ] Time to serialize properties into /tmp/CTLFireability8716691081240491629.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/CTLFireability7699248294172382834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8716691081240491629.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,6.57383e+09,7.87756,172684,2,18568,5,458020,6,0,7950,834979,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:43:38] [INFO ] Flatten gal took : 21 ms
[2026-05-23 01:43:38] [INFO ] Applying decomposition
[2026-05-23 01:43:38] [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/graph9330054825664258956.txt' '-o' '/tmp/graph9330054825664258956.bin' '-w' '/tmp/graph9330054825664258956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9330054825664258956.bin' '-l' '-1' '-v' '-w' '/tmp/graph9330054825664258956.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:43:38] [INFO ] Decomposing Gal with order
[2026-05-23 01:43:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:43:38] [INFO ] Removed a total of 489 redundant transitions.
[2026-05-23 01:43:38] [INFO ] Flatten gal took : 39 ms
[2026-05-23 01:43:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 10 ms.
[2026-05-23 01:43:38] [INFO ] Time to serialize gal into /tmp/CTLFireability3590439276419435540.gal : 11 ms
[2026-05-23 01:43:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12760964726672632586.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/CTLFireability3590439276419435540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12760964726672632586.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,6.57383e+09,0.859869,28388,1624,212,39762,4737,2519,65177,130,23615,0


Converting to forward existential form...Done !
original formula: AG(E(((!(((i22.u331.p1396==1)||(i11.u164.p753==1))) * E(((i14.u201.p903==1)||(i2.i1.i1.u65.p343==1)) U EX((i0.i0.i1.u26.p124==1)))) * !(A...215
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((!(((i22.u331.p1396==1)||(i11.u164.p753==1))) * E(((i14.u201.p903==1)||(i2.i1.i1.u65.p3...275
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t179, t208, t260, t291, t320, t369, t440, t489, t645, t674, t726, t757, t786, t836,...2080
(forward)formula 0,0,3.20536,108092,1,0,187747,6323,20707,327270,644,23615,903835
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 1591 transition count 2041
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 1591 transition count 2041
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 103 place count 1591 transition count 2036
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 130 place count 1564 transition count 2009
Iterating global reduction 1 with 27 rules applied. Total rules applied 157 place count 1564 transition count 2009
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 159 place count 1564 transition count 2007
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 173 place count 1550 transition count 1992
Iterating global reduction 2 with 14 rules applied. Total rules applied 187 place count 1550 transition count 1992
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 1550 transition count 1989
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 200 place count 1540 transition count 1976
Iterating global reduction 3 with 10 rules applied. Total rules applied 210 place count 1540 transition count 1976
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 216 place count 1534 transition count 1969
Iterating global reduction 3 with 6 rules applied. Total rules applied 222 place count 1534 transition count 1969
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 226 place count 1530 transition count 1965
Iterating global reduction 3 with 4 rules applied. Total rules applied 230 place count 1530 transition count 1965
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 233 place count 1527 transition count 1961
Iterating global reduction 3 with 3 rules applied. Total rules applied 236 place count 1527 transition count 1961
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 239 place count 1524 transition count 1957
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 1524 transition count 1957
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 1521 transition count 1953
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 1521 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 1521 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 1520 transition count 1950
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 1520 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 252 place count 1519 transition count 1948
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 1519 transition count 1948
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 254 place count 1518 transition count 1947
Iterating global reduction 4 with 1 rules applied. Total rules applied 255 place count 1518 transition count 1947
Applied a total of 255 rules in 792 ms. Remains 1518 /1640 variables (removed 122) and now considering 1947/2092 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15057749225910803491.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2610387628221195179.kers'
[2026-05-23 01:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15057749225910803491.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2610387628221195179.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1947 rows 1518 cols 4063 entries
Finished phase 1 with 1514 SingleSign rule and 1 generalized
[2026-05-23 01:43:42] [INFO ] Computed 3 invariants in 15 ms
Computed 3 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-2610387628221195179.kers
Total runtime 19 ms.
[2026-05-23 01:43:42] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-23 01:43:42] [INFO ] Invariant cache hit.
[2026-05-23 01:43:43] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
Running 1946 sub problems to find dead transitions.
[2026-05-23 01:43:43] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1946 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1517/3465 variables, and 3 constraints, problems are : Problem set: 0 solved, 1946 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 1946/1946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1946 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1517 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1946 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1517/3465 variables, and 3 constraints, problems are : Problem set: 0 solved, 1946 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1518 constraints, PredecessorRefiner: 0/1946 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 1946 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Starting structural reductions in LTL mode, iteration 1 : 1518/1640 places, 1947/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62410 ms. Remains : 1518/1640 places, 1947/2092 transitions.
[2026-05-23 01:44:44] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:44:44] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:44:44] [INFO ] Input system was already deterministic with 1947 transitions.
[2026-05-23 01:44:44] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:44:44] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:44:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14683241500999663323.gal : 7 ms
[2026-05-23 01:44:44] [INFO ] Time to serialize properties into /tmp/CTLFireability1306756628730803952.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/CTLFireability14683241500999663323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1306756628730803952.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,6.76526e+09,8.83256,186012,2,19238,5,500086,6,0,8021,882606,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:45:14] [INFO ] Flatten gal took : 19 ms
[2026-05-23 01:45:14] [INFO ] Applying decomposition
[2026-05-23 01:45:14] [INFO ] Flatten gal took : 16 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/graph2656116746689170473.txt' '-o' '/tmp/graph2656116746689170473.bin' '-w' '/tmp/graph2656116746689170473.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2656116746689170473.bin' '-l' '-1' '-v' '-w' '/tmp/graph2656116746689170473.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:45:14] [INFO ] Decomposing Gal with order
[2026-05-23 01:45:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:45:14] [INFO ] Removed a total of 518 redundant transitions.
[2026-05-23 01:45:14] [INFO ] Flatten gal took : 41 ms
[2026-05-23 01:45:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 8 ms.
[2026-05-23 01:45:14] [INFO ] Time to serialize gal into /tmp/CTLFireability7805579472643510465.gal : 12 ms
[2026-05-23 01:45:14] [INFO ] Time to serialize properties into /tmp/CTLFireability18309306681124259932.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/CTLFireability7805579472643510465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18309306681124259932.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,6.76526e+09,1.00484,32984,1825,216,48297,5133,2568,84312,141,30723,0


Converting to forward existential form...Done !
original formula: AF(!(A(((i5.u69.p372==1) + E(!(((i9.i0.i0.u101.p572==1)&&(i18.i0.i4.u230.p1002==1))) U AG((i3.u48.p271==1)))) U ((EX((i6.u11.p35==1)) + E...280
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((EX((i6.u11.p35==1)) + E(!(EG(!((i39.i0.i0.u570.p2345==1)))) U E(TRUE U (i29.i2.i0.u454.p...696
Reverse transition relation is NOT exact ! Due to transitions t27, t186, t215, t267, t298, t376, t447, t571, t658, t739, t799, t848, t1123, t1152, t1204, t...2180
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Fast SCC detection found an SCC at level 39
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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 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 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 39
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1588 transition count 2038
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1588 transition count 2038
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 109 place count 1588 transition count 2033
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 138 place count 1559 transition count 2003
Iterating global reduction 1 with 29 rules applied. Total rules applied 167 place count 1559 transition count 2003
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 168 place count 1559 transition count 2002
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 186 place count 1541 transition count 1981
Iterating global reduction 2 with 18 rules applied. Total rules applied 204 place count 1541 transition count 1981
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 208 place count 1541 transition count 1977
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 220 place count 1529 transition count 1961
Iterating global reduction 3 with 12 rules applied. Total rules applied 232 place count 1529 transition count 1961
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 239 place count 1522 transition count 1953
Iterating global reduction 3 with 7 rules applied. Total rules applied 246 place count 1522 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 1522 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 251 place count 1518 transition count 1948
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 1518 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 258 place count 1515 transition count 1944
Iterating global reduction 4 with 3 rules applied. Total rules applied 261 place count 1515 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 264 place count 1512 transition count 1940
Iterating global reduction 4 with 3 rules applied. Total rules applied 267 place count 1512 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 270 place count 1509 transition count 1936
Iterating global reduction 4 with 3 rules applied. Total rules applied 273 place count 1509 transition count 1936
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 1509 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 1508 transition count 1933
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 1508 transition count 1933
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 277 place count 1507 transition count 1931
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 1507 transition count 1931
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 279 place count 1506 transition count 1930
Iterating global reduction 5 with 1 rules applied. Total rules applied 280 place count 1506 transition count 1930
Applied a total of 280 rules in 801 ms. Remains 1506 /1640 variables (removed 134) and now considering 1930/2092 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12738052413841150155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13238804322565304761.kers'
[2026-05-23 01:45:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12738052413841150155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13238804322565304761.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1506 cols 4027 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 01:45:45] [INFO ] Computed 3 invariants in 16 ms
Computed 3 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13238804322565304761.kers
Total runtime 20 ms.
[2026-05-23 01:45:45] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-23 01:45:45] [INFO ] Invariant cache hit.
[2026-05-23 01:45:46] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1142 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 01:45:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1505/3436 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30057 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 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/1505 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1505/3436 variables, and 3 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1506 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Starting structural reductions in LTL mode, iteration 1 : 1506/1640 places, 1930/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62431 ms. Remains : 1506/1640 places, 1930/2092 transitions.
[2026-05-23 01:46:47] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:46:47] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:46:47] [INFO ] Input system was already deterministic with 1930 transitions.
[2026-05-23 01:46:47] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:46:47] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:46:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5034759014851518260.gal : 5 ms
[2026-05-23 01:46:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9093570499590367239.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/CTLFireability5034759014851518260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9093570499590367239.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,6.59244e+09,8.0065,180748,2,18820,5,483729,6,0,7956,860293,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:47:17] [INFO ] Flatten gal took : 20 ms
[2026-05-23 01:47:17] [INFO ] Applying decomposition
[2026-05-23 01:47:17] [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/graph17171733962207772244.txt' '-o' '/tmp/graph17171733962207772244.bin' '-w' '/tmp/graph17171733962207772244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17171733962207772244.bin' '-l' '-1' '-v' '-w' '/tmp/graph17171733962207772244.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:47:17] [INFO ] Decomposing Gal with order
[2026-05-23 01:47:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:47:17] [INFO ] Removed a total of 538 redundant transitions.
[2026-05-23 01:47:17] [INFO ] Flatten gal took : 43 ms
[2026-05-23 01:47:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 11 ms.
[2026-05-23 01:47:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10192596391001517886.gal : 13 ms
[2026-05-23 01:47:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8249272734892210506.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/CTLFireability10192596391001517886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8249272734892210506.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,6.59244e+09,1.01583,34956,2043,179,53147,3519,2437,91299,112,23265,0


Converting to forward existential form...Done !
original formula: EF(EG(((EX((i38.i0.i4.u609.p2467==0)) + (i6.i2.i3.u42.p202==1)) + ((i30.i0.i0.u113.p572==1)&&(i27.i2.i0.u433.p1794==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((EX((i38.i0.i4.u609.p2467==0)) + (i6.i2.i3.u42.p202==1)) + ((i30.i0.i0.u113.p572==1)&&(i2...190
Reverse transition relation is NOT exact ! Due to transitions t26, t179, t208, t260, t291, t369, t440, t489, t645, t674, t726, t757, t786, t835, t1110, t11...2151
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
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,1,4.47685,145852,1,0,244594,3519,18835,447806,455,23265,1405540
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Graph (trivial) has 1999 edges and 1640 vertex of which 678 / 1640 are part of one of the 62 SCC in 5 ms
Free SCC test removed 616 places
Ensure Unique test removed 718 transitions
Reduce isomorphic transitions removed 718 transitions.
Graph (complete) has 1553 edges and 1024 vertex of which 1016 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 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 580 transitions
Trivial Post-agglo rules discarded 580 transitions
Performed 580 trivial Post agglomeration. Transition count delta: 580
Iterating post reduction 0 with 580 rules applied. Total rules applied 582 place count 1015 transition count 788
Reduce places removed 580 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 613 rules applied. Total rules applied 1195 place count 435 transition count 755
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1210 place count 420 transition count 755
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 1210 place count 420 transition count 708
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1304 place count 373 transition count 708
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1323 place count 354 transition count 679
Iterating global reduction 3 with 19 rules applied. Total rules applied 1342 place count 354 transition count 679
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1342 place count 354 transition count 678
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1344 place count 353 transition count 678
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1352 place count 345 transition count 667
Iterating global reduction 3 with 8 rules applied. Total rules applied 1360 place count 345 transition count 667
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1364 place count 345 transition count 663
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1365 place count 344 transition count 663
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1369 place count 340 transition count 655
Iterating global reduction 5 with 4 rules applied. Total rules applied 1373 place count 340 transition count 655
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1377 place count 336 transition count 647
Iterating global reduction 5 with 4 rules applied. Total rules applied 1381 place count 336 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1382 place count 336 transition count 646
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1384 place count 334 transition count 642
Iterating global reduction 6 with 2 rules applied. Total rules applied 1386 place count 334 transition count 642
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1388 place count 332 transition count 638
Iterating global reduction 6 with 2 rules applied. Total rules applied 1390 place count 332 transition count 638
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1391 place count 331 transition count 636
Iterating global reduction 6 with 1 rules applied. Total rules applied 1392 place count 331 transition count 636
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1393 place count 330 transition count 629
Iterating global reduction 6 with 1 rules applied. Total rules applied 1394 place count 330 transition count 629
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 6 with 86 rules applied. Total rules applied 1480 place count 287 transition count 586
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 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 6 with 27 rules applied. Total rules applied 1507 place count 287 transition count 559
Reduce places removed 7 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 7 with 11 rules applied. Total rules applied 1518 place count 280 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1520 place count 278 transition count 555
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 1535 place count 263 transition count 530
Iterating global reduction 9 with 15 rules applied. Total rules applied 1550 place count 263 transition count 530
Discarding 10 places :
Symmetric choice reduction at 9 with 10 rule applications. Total rules 1560 place count 253 transition count 512
Iterating global reduction 9 with 10 rules applied. Total rules applied 1570 place count 253 transition count 512
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1572 place count 253 transition count 510
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 10 with 8 rules applied. Total rules applied 1580 place count 249 transition count 506
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 10 with 7 rules applied. Total rules applied 1587 place count 249 transition count 499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1589 place count 247 transition count 499
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1593 place count 243 transition count 491
Iterating global reduction 12 with 4 rules applied. Total rules applied 1597 place count 243 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1598 place count 243 transition count 490
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1599 place count 242 transition count 488
Iterating global reduction 13 with 1 rules applied. Total rules applied 1600 place count 242 transition count 488
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1601 place count 241 transition count 484
Iterating global reduction 13 with 1 rules applied. Total rules applied 1602 place count 241 transition count 484
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 13 with 2 rules applied. Total rules applied 1604 place count 240 transition count 483
Drop transitions (Redundant composition of simpler transitions.) removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 13 with 73 rules applied. Total rules applied 1677 place count 240 transition count 410
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 13 with 32 rules applied. Total rules applied 1709 place count 240 transition count 378
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 14 with 32 rules applied. Total rules applied 1741 place count 208 transition count 378
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 3 Pre rules applied. Total rules applied 1741 place count 208 transition count 375
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 1747 place count 205 transition count 375
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 1755 place count 201 transition count 371
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 1758 place count 198 transition count 368
Iterating global reduction 15 with 3 rules applied. Total rules applied 1761 place count 198 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 15 with 7 rules applied. Total rules applied 1768 place count 198 transition count 361
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 1769 place count 197 transition count 360
Applied a total of 1769 rules in 133 ms. Remains 197 /1640 variables (removed 1443) and now considering 360/2092 (removed 1732) transitions.
[2026-05-23 01:47:22] [INFO ] Flow matrix only has 311 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10652979181054240654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9049669135002508969.kers'
[2026-05-23 01:47:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10652979181054240654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9049669135002508969.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 197 cols 748 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-23 01:47:22] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9049669135002508969.kers
Total runtime 3 ms.
[2026-05-23 01:47:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 01:47:22] [INFO ] Flow matrix only has 311 transitions (discarded 49 similar events)
[2026-05-23 01:47:22] [INFO ] Invariant cache hit.
[2026-05-23 01:47:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 01:47:22] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [9, 77, 135]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 244 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 194/1640 places, 360/2092 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 191 transition count 357
Applied a total of 4 rules in 9 ms. Remains 191 /194 variables (removed 3) and now considering 357/360 (removed 3) transitions.
[2026-05-23 01:47:22] [INFO ] Flow matrix only has 308 transitions (discarded 49 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3330697243872302871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1392560622284145523.kers'
[2026-05-23 01:47:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3330697243872302871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1392560622284145523.kers]
Normalized transition count is 307 out of 308 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 191 cols 737 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-23 01:47:22] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1392560622284145523.kers
Total runtime 2 ms.
[2026-05-23 01:47:22] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 01:47:22] [INFO ] Flow matrix only has 308 transitions (discarded 49 similar events)
[2026-05-23 01:47:22] [INFO ] Invariant cache hit.
[2026-05-23 01:47:22] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 191/1640 places, 357/2092 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 571 ms. Remains : 191/1640 places, 357/2092 transitions.
[2026-05-23 01:47:22] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:47:22] [INFO ] Flatten gal took : 3 ms
[2026-05-23 01:47:22] [INFO ] Input system was already deterministic with 357 transitions.
[2026-05-23 01:47:22] [INFO ] Flatten gal took : 3 ms
[2026-05-23 01:47:22] [INFO ] Flatten gal took : 4 ms
[2026-05-23 01:47:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6890471414010894016.gal : 1 ms
[2026-05-23 01:47:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10361141856182609001.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/CTLFireability6890471414010894016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10361141856182609001.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.35631e+06,0.176919,10336,2,1275,5,22288,6,0,1065,29997,0


Converting to forward existential form...Done !
original formula: AF(AG((p625==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p625==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t11, t12, t15, t30, t54, t60, t64, t69, t70, t72, t87, t111, t117, t120, t126, t127, ...448
(forward)formula 0,0,1.22191,42448,1,0,402,166421,652,218,6425,160435,641
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 1587 transition count 2037
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 1587 transition count 2037
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 111 place count 1587 transition count 2032
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 141 place count 1557 transition count 2001
Iterating global reduction 1 with 30 rules applied. Total rules applied 171 place count 1557 transition count 2001
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 173 place count 1557 transition count 1999
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 191 place count 1539 transition count 1978
Iterating global reduction 2 with 18 rules applied. Total rules applied 209 place count 1539 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 213 place count 1539 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 225 place count 1527 transition count 1958
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 1527 transition count 1958
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 1520 transition count 1950
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 1520 transition count 1950
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 1520 transition count 1949
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 256 place count 1516 transition count 1945
Iterating global reduction 4 with 4 rules applied. Total rules applied 260 place count 1516 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 263 place count 1513 transition count 1941
Iterating global reduction 4 with 3 rules applied. Total rules applied 266 place count 1513 transition count 1941
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 269 place count 1510 transition count 1937
Iterating global reduction 4 with 3 rules applied. Total rules applied 272 place count 1510 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 275 place count 1507 transition count 1933
Iterating global reduction 4 with 3 rules applied. Total rules applied 278 place count 1507 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 279 place count 1507 transition count 1932
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 280 place count 1506 transition count 1930
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 1506 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 282 place count 1505 transition count 1928
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 1505 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 1504 transition count 1927
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 1504 transition count 1927
Applied a total of 285 rules in 762 ms. Remains 1504 /1640 variables (removed 136) and now considering 1927/2092 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5744681775402324290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11233253851370907120.kers'
[2026-05-23 01:47:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5744681775402324290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11233253851370907120.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1927 rows 1504 cols 4021 entries
Finished phase 1 with 1500 SingleSign rule and 1 generalized
[2026-05-23 01:47:24] [INFO ] Computed 3 invariants in 12 ms
Computed 3 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-11233253851370907120.kers
Total runtime 13 ms.
[2026-05-23 01:47:25] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-05-23 01:47:25] [INFO ] Invariant cache hit.
[2026-05-23 01:47:26] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 1926 sub problems to find dead transitions.
[2026-05-23 01:47:26] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 1926/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1926 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1503 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1926 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1503/3431 variables, and 3 constraints, problems are : Problem set: 0 solved, 1926 unsolved in 30059 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1504 constraints, PredecessorRefiner: 0/1926 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60435ms problems are : Problem set: 0 solved, 1926 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Starting structural reductions in LTL mode, iteration 1 : 1504/1640 places, 1927/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62393 ms. Remains : 1504/1640 places, 1927/2092 transitions.
[2026-05-23 01:48:26] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:48:26] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:48:26] [INFO ] Input system was already deterministic with 1927 transitions.
[2026-05-23 01:48:26] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:48:26] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:48:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1594789036204282060.gal : 5 ms
[2026-05-23 01:48:26] [INFO ] Time to serialize properties into /tmp/CTLFireability17784264269540303987.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/CTLFireability1594789036204282060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17784264269540303987.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,6.54949e+09,7.11508,175512,2,18655,5,466142,6,0,7945,843154,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:48:56] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:48:56] [INFO ] Applying decomposition
[2026-05-23 01:48:56] [INFO ] Flatten gal took : 16 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/graph7272402206386198253.txt' '-o' '/tmp/graph7272402206386198253.bin' '-w' '/tmp/graph7272402206386198253.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7272402206386198253.bin' '-l' '-1' '-v' '-w' '/tmp/graph7272402206386198253.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:48:56] [INFO ] Decomposing Gal with order
[2026-05-23 01:48:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:48:56] [INFO ] Removed a total of 509 redundant transitions.
[2026-05-23 01:48:56] [INFO ] Flatten gal took : 36 ms
[2026-05-23 01:48:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 10 ms.
[2026-05-23 01:48:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3634238660746061254.gal : 10 ms
[2026-05-23 01:48:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12360016252219909370.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/CTLFireability3634238660746061254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12360016252219909370.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,6.54949e+09,0.890837,32488,1718,207,49557,4099,2550,77999,122,24019,0


Converting to forward existential form...Done !
original formula: EX(EG((i0.i1.i2.u123.p639==0)))
=> equivalent forward existential formula: [FwdG(EY(Init),(i0.i1.i2.u123.p639==0))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
(forward)formula 0,1,2.06051,65096,1,0,118156,5444,11233,214040,475,29794,274287
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1640/1640 places, 2092/2092 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1593 transition count 2043
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1593 transition count 2043
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 1593 transition count 2040
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 125 place count 1565 transition count 2011
Iterating global reduction 1 with 28 rules applied. Total rules applied 153 place count 1565 transition count 2011
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 154 place count 1565 transition count 2010
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 170 place count 1549 transition count 1992
Iterating global reduction 2 with 16 rules applied. Total rules applied 186 place count 1549 transition count 1992
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 190 place count 1549 transition count 1988
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 201 place count 1538 transition count 1973
Iterating global reduction 3 with 11 rules applied. Total rules applied 212 place count 1538 transition count 1973
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 218 place count 1532 transition count 1966
Iterating global reduction 3 with 6 rules applied. Total rules applied 224 place count 1532 transition count 1966
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 225 place count 1532 transition count 1965
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 1529 transition count 1962
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 1529 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 1527 transition count 1959
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 1527 transition count 1959
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 1525 transition count 1956
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 1525 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 1523 transition count 1954
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 1523 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 1523 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 245 place count 1522 transition count 1951
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 1522 transition count 1951
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 247 place count 1521 transition count 1949
Iterating global reduction 5 with 1 rules applied. Total rules applied 248 place count 1521 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 249 place count 1520 transition count 1948
Iterating global reduction 5 with 1 rules applied. Total rules applied 250 place count 1520 transition count 1948
Applied a total of 250 rules in 774 ms. Remains 1520 /1640 variables (removed 120) and now considering 1948/2092 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13442891232591951643.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10405155767800223037.kers'
[2026-05-23 01:48:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13442891232591951643.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10405155767800223037.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1948 rows 1520 cols 4065 entries
Finished phase 1 with 1516 SingleSign rule and 1 generalized
[2026-05-23 01:48:59] [INFO ] Computed 3 invariants in 18 ms
Computed 3 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-10405155767800223037.kers
Total runtime 22 ms.
[2026-05-23 01:49:00] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-23 01:49:00] [INFO ] Invariant cache hit.
[2026-05-23 01:49:01] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
Running 1947 sub problems to find dead transitions.
[2026-05-23 01:49:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1519/3468 variables, and 3 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30056 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 1947/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1947 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1519 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1947 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1519/3468 variables, and 3 constraints, problems are : Problem set: 0 solved, 1947 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/1520 constraints, PredecessorRefiner: 0/1947 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1947 unsolved
Search for dead transitions found 0 dead transitions in 60422ms
Starting structural reductions in LTL mode, iteration 1 : 1520/1640 places, 1948/2092 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62442 ms. Remains : 1520/1640 places, 1948/2092 transitions.
[2026-05-23 01:50:01] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:50:01] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:50:01] [INFO ] Input system was already deterministic with 1948 transitions.
[2026-05-23 01:50:01] [INFO ] Flatten gal took : 17 ms
[2026-05-23 01:50:01] [INFO ] Flatten gal took : 16 ms
[2026-05-23 01:50:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15449428291540720727.gal : 5 ms
[2026-05-23 01:50:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4953697273440871245.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/CTLFireability15449428291540720727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4953697273440871245.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,6.83345e+09,7.55099,183480,2,19141,5,499361,6,0,8030,865902,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 01:50:31] [INFO ] Flatten gal took : 22 ms
[2026-05-23 01:50:31] [INFO ] Applying decomposition
[2026-05-23 01:50:31] [INFO ] Flatten gal took : 16 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/graph9761036426319015614.txt' '-o' '/tmp/graph9761036426319015614.bin' '-w' '/tmp/graph9761036426319015614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9761036426319015614.bin' '-l' '-1' '-v' '-w' '/tmp/graph9761036426319015614.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:50:31] [INFO ] Decomposing Gal with order
[2026-05-23 01:50:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:50:31] [INFO ] Removed a total of 512 redundant transitions.
[2026-05-23 01:50:31] [INFO ] Flatten gal took : 35 ms
[2026-05-23 01:50:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 9 ms.
[2026-05-23 01:50:31] [INFO ] Time to serialize gal into /tmp/CTLFireability3133453091131062808.gal : 11 ms
[2026-05-23 01:50:31] [INFO ] Time to serialize properties into /tmp/CTLFireability482361515739516960.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/CTLFireability3133453091131062808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability482361515739516960.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.83345e+09,1.01052,36744,1655,191,56384,4232,2453,94928,127,31843,0


Converting to forward existential form...Done !
original formula: EF(((i18.i0.i0.u447.p1847==1) * ((AF((i2.i4.i2.u50.p252==1)) + A(!(((i26.u384.p1549==1)&&((i21.i1.i0.u420.p1710==1)||(i15.i0.i3.u261.p102...360
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (i18.i0.i0.u447.p1847==1)) * !(EG(!((i2.i4.i2.u50.p252==1)))))] != FALSE + [(((FwdU(Init,...812
Reverse transition relation is NOT exact ! Due to transitions t26, t208, t260, t320, t440, t489, t646, t727, t758, t836, t1150, t1202, t1233, t1262, t1461,...2263
Using 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 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,5.37703,207816,1,0,396334,4759,22384,785601,617,31843,1328031
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2026-05-23 01:50:37] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:50:37] [INFO ] Flatten gal took : 18 ms
[2026-05-23 01:50:37] [INFO ] Applying decomposition
[2026-05-23 01:50:37] [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/graph3866864710487576934.txt' '-o' '/tmp/graph3866864710487576934.bin' '-w' '/tmp/graph3866864710487576934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3866864710487576934.bin' '-l' '-1' '-v' '-w' '/tmp/graph3866864710487576934.weights' '-q' '0' '-e' '0.001'
[2026-05-23 01:50:37] [INFO ] Decomposing Gal with order
[2026-05-23 01:50:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 01:50:37] [INFO ] Removed a total of 563 redundant transitions.
[2026-05-23 01:50:37] [INFO ] Flatten gal took : 41 ms
[2026-05-23 01:50:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 11 ms.
[2026-05-23 01:50:37] [INFO ] Time to serialize gal into /tmp/CTLFireability13716019498790006771.gal : 12 ms
[2026-05-23 01:50:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10428635405663752764.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/CTLFireability13716019498790006771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10428635405663752764.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 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.99799e+09,0.962637,36228,1832,190,52236,3741,2732,104341,127,30765,0


Converting to forward existential form...Done !
original formula: AF(AX((i18.i0.i2.u241.p957==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((i18.i0.i2.u241.p957==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t29, t213, t296, t327, t357, t406, t479, t529, t746, t799, t830, t912, t1239, t1293, t1310, t...2476
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
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 39
(forward)formula 0,0,213.419,2208124,1,0,3.24668e+06,6596,5677,1.07358e+07,281,61196,3646764
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(AX(!(((((i39.i1.i1.u627.p2371==1)||(i27.i0.i3.u383.p1500==1))&&(i22.i0.i0.u366.p1440!=1))||(((i23.i1.i0.u369.p1447==1)&&(i39.i0.i4.u655...275
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(!(EX(!(FALSE)))) + (i22.i0.i0.u366.p1438==1))) * E(TRUE U (i14.i1.i2.u202.p816!=1))))))) ...550
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 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 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 39
(forward)formula 1,0,261.304,2430112,1,0,3.6481e+06,7028,9374,1.12948e+07,348,61196,443450
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(!(A(((i5.i0.i2.u81.p372==1) + E(!(((i30.i0.i0.u120.p572==1)&&(i15.i0.i10.u251.p1002==1))) U AG((i4.u59.p271==1)))) U ((EX((i1.i0.i0.u8...293
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((EX((i1.i0.i0.u8.p35==1)) + E(!(EG(!((i39.i0.i4.u622.p2345==1)))) U E(TRUE U (i30.i1.i2.u...719
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 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 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 39
(forward)formula 2,0,477.11,2679404,1,0,4.07781e+06,9094,5677,1.3984e+07,281,78963,2974989
FORMULA CloudReconfiguration-PT-303-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1918317 ms.

BK_STOP 1779501515854

--------------------
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-303"
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-303, 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-177946967500130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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