Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000274.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.3K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 150K 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 MedleyA-PT-23-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-23-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779703482815

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 10:04:44] [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-25 10:04:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:04:44] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2026-05-25 10:04:44] [INFO ] Transformed 378 places.
[2026-05-25 10:04:44] [INFO ] Transformed 614 transitions.
[2026-05-25 10:04:44] [INFO ] Found NUPN structural information;
[2026-05-25 10:04:44] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 114 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 81 place count 297 transition count 536
Iterating global reduction 1 with 78 rules applied. Total rules applied 159 place count 297 transition count 536
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 211 place count 245 transition count 484
Iterating global reduction 1 with 52 rules applied. Total rules applied 263 place count 245 transition count 484
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 274 place count 234 transition count 471
Iterating global reduction 1 with 11 rules applied. Total rules applied 285 place count 234 transition count 471
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 288 place count 231 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 291 place count 231 transition count 462
Applied a total of 291 rules in 69 ms. Remains 231 /378 variables (removed 147) and now considering 462/614 (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-9303123523245324950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6251943657801076110.kers'
[2026-05-25 10:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9303123523245324950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6251943657801076110.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 231 cols 1620 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-25 10:04:45] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6251943657801076110.kers
Total runtime 2 ms.
[2026-05-25 10:04:45] [INFO ] Implicit Places using invariants in 318 ms returned []
[2026-05-25 10:04:45] [INFO ] Invariant cache hit.
[2026-05-25 10:04:45] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 10:04:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/693 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 693/693 variables, and 240 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 462/693 variables, 231/240 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 461/701 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/693 variables, and 702 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60358ms
Starting structural reductions in LTL mode, iteration 1 : 231/378 places, 462/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61188 ms. Remains : 231/378 places, 462/614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Applied a total of 0 rules in 3 ms. Remains 231 /231 variables (removed 0) and now considering 462/462 (removed 0) transitions.
[2026-05-25 10:05:46] [INFO ] Invariant cache hit.
[2026-05-25 10:05:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 10:05:46] [INFO ] Invariant cache hit.
[2026-05-25 10:05:46] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 231/231 places, 462/462 transitions.
Support contains 114 out of 231 places after structural reductions.
[2026-05-25 10:05:46] [INFO ] Flatten gal took : 63 ms
[2026-05-25 10:05:46] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:05:47] [INFO ] Input system was already deterministic with 462 transitions.
Support contains 113 out of 231 places (down from 114) after GAL structural reductions.
RANDOM walk for 40000 steps (54 resets) in 1900 ms. (21 steps per ms) remains 38/87 properties
BEST_FIRST walk for 4003 steps (13 resets) in 67 ms. (58 steps per ms) remains 35/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 61 ms. (64 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (9 resets) in 47 ms. (83 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (16 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (16 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (13 resets) in 30 ms. (129 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (15 resets) in 16 ms. (235 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (12 resets) in 18 ms. (210 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4003 steps (13 resets) in 34 ms. (114 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (13 resets) in 22 ms. (174 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (12 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (13 resets) in 18 ms. (210 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (15 resets) in 19 ms. (200 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (14 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2026-05-25 10:05:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 54/90 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 340/430 variables, 90/98 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 226/656 variables, 115/213 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/656 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 32/688 variables, 22/235 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp74 is UNSAT
At refinement iteration 9 (OVERLAPS) 5/693 variables, 4/239 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/693 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/693 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 239 constraints, problems are : Problem set: 1 solved, 19 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 55/88 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 339/427 variables, 88/96 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 229/656 variables, 117/214 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 18/232 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 1/233 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 32/688 variables, 22/255 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 0/255 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 5/693 variables, 4/259 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/693 variables, and 262 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 6947ms problems are : Problem set: 1 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 462/462 transitions.
Graph (trivial) has 142 edges and 231 vertex of which 15 / 231 are part of one of the 2 SCC in 32 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 218 transition count 418
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 199 transition count 417
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 40 place count 199 transition count 405
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 64 place count 187 transition count 405
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 92 place count 159 transition count 363
Iterating global reduction 2 with 28 rules applied. Total rules applied 120 place count 159 transition count 363
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 159 transition count 360
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 123 place count 159 transition count 358
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 127 place count 157 transition count 358
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 136 place count 148 transition count 333
Iterating global reduction 3 with 9 rules applied. Total rules applied 145 place count 148 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 148 transition count 331
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 146 transition count 327
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 146 transition count 327
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 152 place count 145 transition count 324
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 145 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 154 place count 145 transition count 323
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 196 place count 124 transition count 302
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 201 place count 124 transition count 297
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 207 place count 118 transition count 279
Iterating global reduction 6 with 6 rules applied. Total rules applied 213 place count 118 transition count 279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 117 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 225 place count 112 transition count 284
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 227 place count 112 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 232 place count 112 transition count 277
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 233 place count 111 transition count 274
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 111 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 235 place count 111 transition count 273
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 256 place count 111 transition count 252
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 277 place count 90 transition count 252
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 283 place count 90 transition count 246
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 284 place count 90 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 285 place count 89 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 288 place count 89 transition count 244
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 289 place count 89 transition count 244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 290 place count 88 transition count 243
Applied a total of 290 rules in 172 ms. Remains 88 /231 variables (removed 143) and now considering 243/462 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 88/231 places, 243/462 transitions.
RANDOM walk for 40000 steps (48 resets) in 637 ms. (62 steps per ms) remains 3/19 properties
BEST_FIRST walk for 40003 steps (19 resets) in 47 ms. (833 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (23 resets) in 99 ms. (400 steps per ms) remains 1/2 properties
BEST_FIRST walk for 26920 steps (6 resets) in 64 ms. (414 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2026-05-25 10:05:55] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:05:55] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:05:55] [INFO ] Input system was already deterministic with 462 transitions.
Computed a total of 19 stabilizing places and 24 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Graph (trivial) has 171 edges and 231 vertex of which 16 / 231 are part of one of the 2 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 216 transition count 409
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 186 transition count 407
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 63 place count 186 transition count 399
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 79 place count 178 transition count 399
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 119 place count 138 transition count 335
Iterating global reduction 2 with 40 rules applied. Total rules applied 159 place count 138 transition count 335
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 162 place count 138 transition count 332
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 162 place count 138 transition count 329
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 168 place count 135 transition count 329
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 183 place count 120 transition count 286
Iterating global reduction 3 with 15 rules applied. Total rules applied 198 place count 120 transition count 286
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 120 transition count 280
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 118 transition count 275
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 118 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 118 transition count 274
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 117 transition count 271
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 117 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 117 transition count 270
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 248 place count 99 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 99 transition count 251
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 256 place count 92 transition count 231
Iterating global reduction 7 with 7 rules applied. Total rules applied 263 place count 92 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 265 place count 92 transition count 229
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 8 with 2 rules applied. Total rules applied 267 place count 91 transition count 228
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 271 place count 91 transition count 224
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 8 with 4 rules applied. Total rules applied 275 place count 89 transition count 222
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 277 place count 87 transition count 216
Iterating global reduction 8 with 2 rules applied. Total rules applied 279 place count 87 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 281 place count 87 transition count 214
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 283 place count 85 transition count 212
Applied a total of 283 rules in 64 ms. Remains 85 /231 variables (removed 146) and now considering 212/462 (removed 250) transitions.
[2026-05-25 10:05:55] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17254672513262566755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13150607204846794798.kers'
[2026-05-25 10:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17254672513262566755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13150607204846794798.kers]
Normalized transition count is 202 out of 203 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 202 rows 84 cols 693 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 10:05:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13150607204846794798.kers
Total runtime 3 ms.
[2026-05-25 10:05:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 10:05:55] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
[2026-05-25 10:05:55] [INFO ] Invariant cache hit.
[2026-05-25 10:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 10:05:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2026-05-25 10:05:55] [INFO ] Redundant transitions in 5 ms returned []
Running 194 sub problems to find dead transitions.
[2026-05-25 10:05:55] [INFO ] Flow matrix only has 203 transitions (discarded 9 similar events)
[2026-05-25 10:05:55] [INFO ] Invariant cache hit.
[2026-05-25 10:05:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 202/284 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 3/287 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/288 variables, and 94 constraints, problems are : Problem set: 0 solved, 194 unsolved in 11185 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (OVERLAPS) 202/284 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (OVERLAPS) 3/287 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 161/290 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/288 variables, and 291 constraints, problems are : Problem set: 0 solved, 194 unsolved in 27281 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 38505ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 38506ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/231 places, 212/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38774 ms. Remains : 85/231 places, 212/462 transitions.
[2026-05-25 10:06:34] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:06:34] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:06:34] [INFO ] Input system was already deterministic with 212 transitions.
[2026-05-25 10:06:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:06:34] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:06:34] [INFO ] Time to serialize gal into /tmp/CTLFireability666838441962053383.gal : 4 ms
[2026-05-25 10:06:34] [INFO ] Time to serialize properties into /tmp/CTLFireability9944074728169058987.ctl : 10 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/CTLFireability666838441962053383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9944074728169058987.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48894e+07,9.52807,192428,2,8319,5,436998,6,0,549,688261,0


Converting to forward existential form...Done !
original formula: A(((p231==1)||(p198==1)) U AF(AG(AF(E((p194==1) U (p219==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(!(EG(!(E((p194==1) U (p219==1))))))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !(!(...303
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t12, t13, t16, t19, t20, t26, t28, t34, t35, t38, t42, t45, t46, t53, t54, t84, t...507
Detected timeout of ITS tools.
[2026-05-25 10:07:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:07:04] [INFO ] Applying decomposition
[2026-05-25 10:07:04] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12089052746208060115.txt' '-o' '/tmp/graph12089052746208060115.bin' '-w' '/tmp/graph12089052746208060115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12089052746208060115.bin' '-l' '-1' '-v' '-w' '/tmp/graph12089052746208060115.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:07:04] [INFO ] Decomposing Gal with order
[2026-05-25 10:07:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:07:04] [INFO ] Removed a total of 349 redundant transitions.
[2026-05-25 10:07:04] [INFO ] Flatten gal took : 80 ms
[2026-05-25 10:07:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-25 10:07:04] [INFO ] Time to serialize gal into /tmp/CTLFireability4383020051875859931.gal : 5 ms
[2026-05-25 10:07:04] [INFO ] Time to serialize properties into /tmp/CTLFireability15860476480674653219.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/CTLFireability4383020051875859931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15860476480674653219.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.48894e+07,0.143806,9932,311,58,10233,638,453,21140,78,2013,0


Converting to forward existential form...Done !
original formula: A(((i4.u14.p231==1)||(i4.u10.p198==1)) U AF(AG(AF(E((i4.u8.p194==1) U (i4.u12.p219==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(!(EG(!(E((i4.u8.p194==1) U (i4.u12.p219==1))))))))))))))) * !(E(!(!(EG(!(!(...356
Reverse transition relation is NOT exact ! Due to transitions t84, t86, t87, t88, t89, t102, t103, t104, t120, t121, t122, t123, t124, t125, t147, t148, t1...576
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,15.4997,450708,1,0,650278,10896,2754,1.86979e+06,446,66103,938794
FORMULA MedleyA-PT-23-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 198 transition count 415
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 198 transition count 415
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 68 place count 198 transition count 413
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 86 place count 180 transition count 383
Iterating global reduction 1 with 18 rules applied. Total rules applied 104 place count 180 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 106 place count 180 transition count 381
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 112 place count 174 transition count 369
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 174 transition count 369
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 174 transition count 367
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 171 transition count 359
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 171 transition count 359
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 169 transition count 354
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 169 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 169 transition count 352
Applied a total of 132 rules in 14 ms. Remains 169 /231 variables (removed 62) and now considering 352/462 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14536176232051003485.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12989574539204164674.kers'
[2026-05-25 10:07:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14536176232051003485.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12989574539204164674.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 352 rows 169 cols 1244 entries
Finished phase 1 with 161 SingleSign rule and 0 generalized
[2026-05-25 10:07:20] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12989574539204164674.kers
Total runtime 2 ms.
[2026-05-25 10:07:20] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 10:07:20] [INFO ] Invariant cache hit.
[2026-05-25 10:07:20] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2026-05-25 10:07:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (OVERLAPS) 352/521 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/521 variables, and 181 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/169 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 352/521 variables, 169/178 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 351/529 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 3/532 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/521 variables, and 535 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 169/231 places, 352/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60580 ms. Remains : 169/231 places, 352/462 transitions.
[2026-05-25 10:08:20] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:08:21] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:08:21] [INFO ] Input system was already deterministic with 352 transitions.
[2026-05-25 10:08:21] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:08:21] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:08:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5177355078560416687.gal : 7 ms
[2026-05-25 10:08:21] [INFO ] Time to serialize properties into /tmp/CTLFireability18042385014757532789.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/CTLFireability5177355078560416687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18042385014757532789.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.
Detected timeout of ITS tools.
[2026-05-25 10:08:51] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:08:51] [INFO ] Applying decomposition
[2026-05-25 10:08:51] [INFO ] Flatten gal took : 14 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/graph14607885531639685057.txt' '-o' '/tmp/graph14607885531639685057.bin' '-w' '/tmp/graph14607885531639685057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14607885531639685057.bin' '-l' '-1' '-v' '-w' '/tmp/graph14607885531639685057.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:08:51] [INFO ] Decomposing Gal with order
[2026-05-25 10:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:08:51] [INFO ] Removed a total of 532 redundant transitions.
[2026-05-25 10:08:51] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2026-05-25 10:08:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17001128129014104230.gal : 4 ms
[2026-05-25 10:08:51] [INFO ] Time to serialize properties into /tmp/CTLFireability10452627947259696902.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/CTLFireability17001128129014104230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10452627947259696902.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2746e+10,1.37803,48244,1177,87,74684,1206,719,149689,86,4753,0


Converting to forward existential form...Done !
original formula: (AG(((((((AF((i8.i1.u32.p272==0)) + EG((((i5.u1.p12==0)||(i5.u4.p25==0))||(i2.u13.p115==0)))) + (A(((u3.p19==1)&&(i6.u27.p226==1)) U (((i...881
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((((((!(EG(!((i8.i1.u32.p272==0)))) + EG((((i5.u1.p12==0)||(i5.u4.p25==0))||(i2.u13.p1...3595
Reverse transition relation is NOT exact ! Due to transitions t19, t63, t125, t152, t154, t155, t156, t189, t191, t192, t193, t214, t216, t217, t218, t223,...865
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Graph (trivial) has 189 edges and 231 vertex of which 26 / 231 are part of one of the 3 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 207 transition count 397
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 178 transition count 395
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 61 place count 178 transition count 388
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 171 transition count 388
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 116 place count 130 transition count 323
Iterating global reduction 2 with 41 rules applied. Total rules applied 157 place count 130 transition count 323
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 162 place count 130 transition count 318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 162 place count 130 transition count 316
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 166 place count 128 transition count 316
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 182 place count 112 transition count 271
Iterating global reduction 3 with 16 rules applied. Total rules applied 198 place count 112 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 112 transition count 265
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 206 place count 110 transition count 260
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 110 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 110 transition count 259
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 109 transition count 256
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 109 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 109 transition count 255
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 244 place count 93 transition count 239
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 249 place count 88 transition count 224
Iterating global reduction 6 with 5 rules applied. Total rules applied 254 place count 88 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 260 place count 88 transition count 218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 266 place count 85 transition count 215
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 269 place count 82 transition count 206
Iterating global reduction 6 with 3 rules applied. Total rules applied 272 place count 82 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 275 place count 82 transition count 203
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 277 place count 80 transition count 201
Applied a total of 277 rules in 92 ms. Remains 80 /231 variables (removed 151) and now considering 201/462 (removed 261) transitions.
[2026-05-25 10:09:21] [INFO ] Flow matrix only has 192 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7166020541745617934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16451737490031207616.kers'
[2026-05-25 10:09:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7166020541745617934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16451737490031207616.kers]
Normalized transition count is 191 out of 192 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 80 cols 727 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-25 10:09:21] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16451737490031207616.kers
Total runtime 1 ms.
[2026-05-25 10:09:21] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 10:09:21] [INFO ] Flow matrix only has 192 transitions (discarded 9 similar events)
[2026-05-25 10:09:21] [INFO ] Invariant cache hit.
[2026-05-25 10:09:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:09:21] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2026-05-25 10:09:21] [INFO ] Redundant transitions in 4 ms returned []
Running 175 sub problems to find dead transitions.
[2026-05-25 10:09:21] [INFO ] Flow matrix only has 192 transitions (discarded 9 similar events)
[2026-05-25 10:09:21] [INFO ] Invariant cache hit.
[2026-05-25 10:09:21] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 191/268 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 3/271 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/272 variables, and 91 constraints, problems are : Problem set: 0 solved, 175 unsolved in 11605 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 191/268 variables, 77/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 21/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 3/271 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 154/266 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/271 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/272 variables, and 266 constraints, problems are : Problem set: 0 solved, 175 unsolved in 12855 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24491ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 24492ms
Starting structural reductions in SI_CTL mode, iteration 1 : 80/231 places, 201/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24789 ms. Remains : 80/231 places, 201/462 transitions.
[2026-05-25 10:09:46] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:09:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:09:46] [INFO ] Input system was already deterministic with 201 transitions.
[2026-05-25 10:09:46] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:09:46] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:09:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8808269709942135552.gal : 2 ms
[2026-05-25 10:09:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1645023737722392721.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8808269709942135552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1645023737722392721.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 27083 steps (44 resets) in 248 ms. (108 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-23-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality1645023737722392721.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Graph (trivial) has 187 edges and 231 vertex of which 26 / 231 are part of one of the 3 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 207 transition count 398
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 179 transition count 396
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 59 place count 179 transition count 389
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 73 place count 172 transition count 389
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 113 place count 132 transition count 325
Iterating global reduction 2 with 40 rules applied. Total rules applied 153 place count 132 transition count 325
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 158 place count 132 transition count 320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 158 place count 132 transition count 318
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 130 transition count 318
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 177 place count 115 transition count 276
Iterating global reduction 3 with 15 rules applied. Total rules applied 192 place count 115 transition count 276
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 198 place count 115 transition count 270
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 200 place count 113 transition count 265
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 113 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 113 transition count 264
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 112 transition count 261
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 112 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 112 transition count 260
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 238 place count 96 transition count 244
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 243 place count 91 transition count 229
Iterating global reduction 6 with 5 rules applied. Total rules applied 248 place count 91 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 254 place count 91 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 260 place count 88 transition count 220
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 263 place count 85 transition count 211
Iterating global reduction 6 with 3 rules applied. Total rules applied 266 place count 85 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 269 place count 85 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 271 place count 83 transition count 206
Applied a total of 271 rules in 40 ms. Remains 83 /231 variables (removed 148) and now considering 206/462 (removed 256) transitions.
[2026-05-25 10:09:46] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17362422358413268016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4445320148906147881.kers'
[2026-05-25 10:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17362422358413268016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4445320148906147881.kers]
Normalized transition count is 196 out of 197 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 196 rows 83 cols 749 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-25 10:09:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4445320148906147881.kers
Total runtime 1 ms.
[2026-05-25 10:09:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 10:09:46] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:09:46] [INFO ] Invariant cache hit.
[2026-05-25 10:09:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:09:46] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2026-05-25 10:09:46] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-25 10:09:46] [INFO ] Flow matrix only has 197 transitions (discarded 9 similar events)
[2026-05-25 10:09:46] [INFO ] Invariant cache hit.
[2026-05-25 10:09:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 196/276 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 3/279 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/280 variables, and 93 constraints, problems are : Problem set: 0 solved, 180 unsolved in 9791 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (OVERLAPS) 196/276 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 22/112 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 3/279 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 158/274 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (OVERLAPS) 0/279 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/280 variables, and 274 constraints, problems are : Problem set: 0 solved, 180 unsolved in 14225 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 24040ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 24040ms
Starting structural reductions in SI_CTL mode, iteration 1 : 83/231 places, 206/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24235 ms. Remains : 83/231 places, 206/462 transitions.
[2026-05-25 10:10:10] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:10:10] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:10:10] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-25 10:10:10] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:10:10] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:10:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17419231949394159353.gal : 2 ms
[2026-05-25 10:10:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1999210351371425059.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/CTLFireability17419231949394159353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1999210351371425059.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.82088e+07,15.0741,270312,2,9038,5,593505,6,0,534,892132,0


Converting to forward existential form...Done !
original formula: EG((AG(AF((((p12==0)||(p30==0))||(p315==0)))) + ((p291==0)&&((p205==0)||(p366==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EG(!((((p12==0)||(p30==0))||(p315==0)))))))) + ((p291==0)&&((p205==0)||(p366==0)))))]...164
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t11, t12, t18, t21, t24, t25, t32, t33, t36, t39, t40, t47, t48, t82, t83, t84, t85, ...493
Detected timeout of ITS tools.
[2026-05-25 10:10:40] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:10:40] [INFO ] Applying decomposition
[2026-05-25 10:10:40] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15689857543925493015.txt' '-o' '/tmp/graph15689857543925493015.bin' '-w' '/tmp/graph15689857543925493015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15689857543925493015.bin' '-l' '-1' '-v' '-w' '/tmp/graph15689857543925493015.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:10:40] [INFO ] Decomposing Gal with order
[2026-05-25 10:10:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:10:40] [INFO ] Removed a total of 336 redundant transitions.
[2026-05-25 10:10:40] [INFO ] Flatten gal took : 27 ms
[2026-05-25 10:10:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 4 ms.
[2026-05-25 10:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6187612565465841465.gal : 2 ms
[2026-05-25 10:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8825558885991572850.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/CTLFireability6187612565465841465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8825558885991572850.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,2.82088e+07,0.095207,8076,266,97,7236,424,377,12708,111,1173,0


Converting to forward existential form...Done !
original formula: EG((AG(AF((((u0.p12==0)||(u3.p30==0))||(i6.u13.p315==0)))) + ((i6.u12.p291==0)&&((i4.u7.p205==0)||(i9.u19.p366==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(!(EG(!((((u0.p12==0)||(u3.p30==0))||(i6.u13.p315==0)))))))) + ((i6.u12.p291==0)&&((i4.u...197
Reverse transition relation is NOT exact ! Due to transitions t82, t83, t84, t94, t95, t96, t118, t119, t120, t142, t144, t151, t155, t157, t160, t164, t16...461
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,9.40213,284216,1,0,412397,45949,2175,1.2365e+06,550,345187,719333
FORMULA MedleyA-PT-23-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 193 transition count 404
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 193 transition count 404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 193 transition count 402
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 98 place count 173 transition count 367
Iterating global reduction 1 with 20 rules applied. Total rules applied 118 place count 173 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 121 place count 173 transition count 364
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 132 place count 162 transition count 340
Iterating global reduction 2 with 11 rules applied. Total rules applied 143 place count 162 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 162 transition count 336
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 159 transition count 329
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 159 transition count 329
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 156 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 156 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 162 place count 156 transition count 318
Applied a total of 162 rules in 52 ms. Remains 156 /231 variables (removed 75) and now considering 318/462 (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-13487379020340538833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6331140221972453432.kers'
[2026-05-25 10:10:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13487379020340538833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6331140221972453432.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 156 cols 1104 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-25 10:10:50] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6331140221972453432.kers
Total runtime 2 ms.
[2026-05-25 10:10:50] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 10:10:50] [INFO ] Invariant cache hit.
[2026-05-25 10:10:50] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2026-05-25 10:10:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 318/474 variables, 156/164 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 317 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 Real declared 474/474 variables, and 168 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/474 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 317/482 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 3/487 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 490 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 156/231 places, 318/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60412 ms. Remains : 156/231 places, 318/462 transitions.
[2026-05-25 10:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:11:50] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-25 10:11:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:11:50] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:11:50] [INFO ] Time to serialize gal into /tmp/CTLFireability12858414774020883128.gal : 1 ms
[2026-05-25 10:11:50] [INFO ] Time to serialize properties into /tmp/CTLFireability6126447481815680901.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/CTLFireability12858414774020883128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6126447481815680901.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.
Detected timeout of ITS tools.
[2026-05-25 10:12:20] [INFO ] Flatten gal took : 14 ms
[2026-05-25 10:12:20] [INFO ] Applying decomposition
[2026-05-25 10:12:20] [INFO ] Flatten gal took : 14 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/graph3584655060335584053.txt' '-o' '/tmp/graph3584655060335584053.bin' '-w' '/tmp/graph3584655060335584053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3584655060335584053.bin' '-l' '-1' '-v' '-w' '/tmp/graph3584655060335584053.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:12:21] [INFO ] Decomposing Gal with order
[2026-05-25 10:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:12:21] [INFO ] Removed a total of 457 redundant transitions.
[2026-05-25 10:12:21] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2026-05-25 10:12:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14522691877092629983.gal : 3 ms
[2026-05-25 10:12:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12450640564311671426.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/CTLFireability14522691877092629983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12450640564311671426.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,8.92164e+09,3.3059,96576,1593,44,157681,756,674,330198,72,2256,0


Converting to forward existential form...Done !
original formula: A(((EF(AG(EX(((i5.u3.p19==1)&&(i2.u13.p112==1))))) + !(EF((i2.u15.p124==1)))) * (E(!(EF(((i1.u1.p11==1)&&(i9.u49.p373==1)))) U EX((i4.i0....247
=> equivalent forward existential formula: [((Init * !(EG(!((i2.u8.p63==1))))) * !(E(!((i2.u8.p63==1)) U (!(((E(TRUE U !(E(TRUE U !(EX(((i5.u3.p19==1)&&(i2...394
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t139, t142, t143, t176, t179, t180, t201, t204, t205, t213, t214, t215, t216, t217,...929
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 195 transition count 410
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 195 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 74 place count 195 transition count 408
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 94 place count 175 transition count 371
Iterating global reduction 1 with 20 rules applied. Total rules applied 114 place count 175 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 117 place count 175 transition count 368
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 125 place count 167 transition count 351
Iterating global reduction 2 with 8 rules applied. Total rules applied 133 place count 167 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 167 transition count 349
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 138 place count 164 transition count 342
Iterating global reduction 3 with 3 rules applied. Total rules applied 141 place count 164 transition count 342
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 162 transition count 336
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 162 transition count 336
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 147 place count 162 transition count 334
Applied a total of 147 rules in 9 ms. Remains 162 /231 variables (removed 69) and now considering 334/462 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17245363291833237558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8070518482676223327.kers'
[2026-05-25 10:12:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17245363291833237558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8070518482676223327.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 334 rows 162 cols 1154 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-25 10:12:51] [INFO ] Computed 8 invariants in 5 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8070518482676223327.kers
Total runtime 6 ms.
[2026-05-25 10:12:51] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-25 10:12:51] [INFO ] Invariant cache hit.
[2026-05-25 10:12:51] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2026-05-25 10:12:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/496 variables, 162/171 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (OVERLAPS) 0/496 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 175 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 334/496 variables, 162/172 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 333/505 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 3/511 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 511 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 162/231 places, 334/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 162/231 places, 334/462 transitions.
[2026-05-25 10:13:51] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:13:51] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:13:51] [INFO ] Input system was already deterministic with 334 transitions.
[2026-05-25 10:13:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:13:51] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:13:51] [INFO ] Time to serialize gal into /tmp/CTLFireability371272734133419763.gal : 2 ms
[2026-05-25 10:13:51] [INFO ] Time to serialize properties into /tmp/CTLFireability793873125385653535.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/CTLFireability371272734133419763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability793873125385653535.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 10:14:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:14:21] [INFO ] Applying decomposition
[2026-05-25 10:14:21] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14237118200048580742.txt' '-o' '/tmp/graph14237118200048580742.bin' '-w' '/tmp/graph14237118200048580742.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14237118200048580742.bin' '-l' '-1' '-v' '-w' '/tmp/graph14237118200048580742.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:14:21] [INFO ] Decomposing Gal with order
[2026-05-25 10:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:14:21] [INFO ] Removed a total of 483 redundant transitions.
[2026-05-25 10:14:21] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2026-05-25 10:14:21] [INFO ] Time to serialize gal into /tmp/CTLFireability3793025945602139001.gal : 3 ms
[2026-05-25 10:14:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6183608230876350292.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/CTLFireability3793025945602139001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6183608230876350292.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14912e+10,5.51983,149732,1599,54,253325,716,751,497516,77,1947,0


Converting to forward existential form...Done !
original formula: (AG(EF(EX(((i5.u31.p305==1)&&(i7.u43.p338==1))))) * !(A((((A(!(E((i5.u32.p237==1) U (i5.u33.p241==1))) U EG(((i4.i1.u30.p230==1)&&(i8.u48...424
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EX(((i5.u31.p305==1)&&(i7.u43.p338==1))))))] = FALSE * [((Init * !(EG(!((!(EX(!(...1246
Reverse transition relation is NOT exact ! Due to transitions t20, t58, t149, t151, t152, t160, t161, t181, t182, t189, t191, t192, t207, t208, t215, t217,...932
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 192 transition count 405
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 192 transition count 405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 192 transition count 403
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 103 place count 169 transition count 363
Iterating global reduction 1 with 23 rules applied. Total rules applied 126 place count 169 transition count 363
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 169 transition count 360
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 140 place count 158 transition count 337
Iterating global reduction 2 with 11 rules applied. Total rules applied 151 place count 158 transition count 337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 158 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 154 transition count 324
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 154 transition count 324
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 151 transition count 316
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 151 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 151 transition count 313
Applied a total of 171 rules in 25 ms. Remains 151 /231 variables (removed 80) and now considering 313/462 (removed 149) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14982807472457801972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11746815082951132662.kers'
[2026-05-25 10:14:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14982807472457801972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11746815082951132662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 151 cols 1082 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-25 10:14:52] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11746815082951132662.kers
Total runtime 4 ms.
[2026-05-25 10:14:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 10:14:52] [INFO ] Invariant cache hit.
[2026-05-25 10:14:52] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2026-05-25 10:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 313/464 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (OVERLAPS) 0/464 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 163 constraints, problems are : Problem set: 0 solved, 312 unsolved in 28670 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/464 variables, 151/160 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 312/472 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 479 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 58745ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 58745ms
Starting structural reductions in LTL mode, iteration 1 : 151/231 places, 313/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59080 ms. Remains : 151/231 places, 313/462 transitions.
[2026-05-25 10:15:51] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:15:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:15:51] [INFO ] Input system was already deterministic with 313 transitions.
[2026-05-25 10:15:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:15:51] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:15:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5826601565593078943.gal : 2 ms
[2026-05-25 10:15:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6211759592170073693.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/CTLFireability5826601565593078943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6211759592170073693.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.
Detected timeout of ITS tools.
[2026-05-25 10:16:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:16:21] [INFO ] Applying decomposition
[2026-05-25 10:16:21] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3561490694391831051.txt' '-o' '/tmp/graph3561490694391831051.bin' '-w' '/tmp/graph3561490694391831051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3561490694391831051.bin' '-l' '-1' '-v' '-w' '/tmp/graph3561490694391831051.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:16:21] [INFO ] Decomposing Gal with order
[2026-05-25 10:16:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:16:21] [INFO ] Removed a total of 453 redundant transitions.
[2026-05-25 10:16:21] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:16:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2026-05-25 10:16:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7735059403687018058.gal : 2 ms
[2026-05-25 10:16:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10403343676590851521.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/CTLFireability7735059403687018058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10403343676590851521.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,8.31351e+09,5.19406,140672,1569,45,229437,630,633,465531,69,1943,0


Converting to forward existential form...Done !
original formula: (AX((AG((!(A((i5.u31.p259==1) U (i2.u10.p72==1))) * !(A(((i4.u5.p29==1)&&(i2.u13.p112==1)) U ((i5.u30.p305==1)&&(i8.u43.p352==1)))))) + A...412
=> equivalent forward existential formula: ([FwdG((EY(Init) * !(!(E(TRUE U !((!(!((E(!((i2.u10.p72==1)) U (!((i5.u31.p259==1)) * !((i2.u10.p72==1)))) + EG(...664
Reverse transition relation is NOT exact ! Due to transitions t20, t55, t119, t137, t139, t140, t147, t167, t175, t177, t178, t192, t200, t202, t203, t208,...925
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 191 transition count 404
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 191 transition count 404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 82 place count 191 transition count 402
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 105 place count 168 transition count 362
Iterating global reduction 1 with 23 rules applied. Total rules applied 128 place count 168 transition count 362
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 168 transition count 359
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 143 place count 156 transition count 334
Iterating global reduction 2 with 12 rules applied. Total rules applied 155 place count 156 transition count 334
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 159 place count 156 transition count 330
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 163 place count 152 transition count 320
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 152 transition count 320
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 170 place count 149 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 149 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 149 transition count 309
Applied a total of 176 rules in 20 ms. Remains 149 /231 variables (removed 82) and now considering 309/462 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12963634825529460209.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17112715549776069974.kers'
[2026-05-25 10:16:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12963634825529460209.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17112715549776069974.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 309 rows 149 cols 1080 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-25 10:16:51] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17112715549776069974.kers
Total runtime 5 ms.
[2026-05-25 10:16:51] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-25 10:16:51] [INFO ] Invariant cache hit.
[2026-05-25 10:16:51] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2026-05-25 10:16:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (OVERLAPS) 309/458 variables, 149/157 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/458 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 161 constraints, problems are : Problem set: 0 solved, 308 unsolved in 28905 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/458 variables, 149/158 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 308/466 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 472 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 59002ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 59003ms
Starting structural reductions in LTL mode, iteration 1 : 149/231 places, 309/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59397 ms. Remains : 149/231 places, 309/462 transitions.
[2026-05-25 10:17:50] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:17:50] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:17:50] [INFO ] Input system was already deterministic with 309 transitions.
[2026-05-25 10:17:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:17:50] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:17:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17915877696908060037.gal : 3 ms
[2026-05-25 10:17:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1380905400092970018.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/CTLFireability17915877696908060037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1380905400092970018.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.
Detected timeout of ITS tools.
[2026-05-25 10:18:20] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:18:20] [INFO ] Applying decomposition
[2026-05-25 10:18:20] [INFO ] Flatten gal took : 10 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/graph17527003525979300757.txt' '-o' '/tmp/graph17527003525979300757.bin' '-w' '/tmp/graph17527003525979300757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17527003525979300757.bin' '-l' '-1' '-v' '-w' '/tmp/graph17527003525979300757.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:18:20] [INFO ] Decomposing Gal with order
[2026-05-25 10:18:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:18:20] [INFO ] Removed a total of 454 redundant transitions.
[2026-05-25 10:18:20] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:18:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2026-05-25 10:18:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4283102619952489422.gal : 3 ms
[2026-05-25 10:18:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15263713782099465326.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/CTLFireability4283102619952489422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15263713782099465326.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,8.61263e+09,2.61552,75696,1238,47,124557,496,598,255024,76,1605,0


Converting to forward existential form...Done !
original formula: EX(AF((EG((((i2.u1.p12==1)&&(i3.u6.p30==1))&&(i3.u14.p115==1))) + (EX((i2.u4.p21==1)) * EG(((i5.u19.p205==1)&&(i9.u42.p366==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG((((i2.u1.p12==1)&&(i3.u6.p30==1))&&(i3.u14.p115==1))) + (EX((i2.u4.p21==1)) * EG(((i5.u1...201
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t133, t135, t136, t169, t171, t172, t193, t195, t196, t201, t202, t203, t204, t205,...822
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 193 transition count 404
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 193 transition count 404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 193 transition count 402
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 98 place count 173 transition count 367
Iterating global reduction 1 with 20 rules applied. Total rules applied 118 place count 173 transition count 367
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 121 place count 173 transition count 364
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 132 place count 162 transition count 340
Iterating global reduction 2 with 11 rules applied. Total rules applied 143 place count 162 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 162 transition count 336
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 150 place count 159 transition count 329
Iterating global reduction 3 with 3 rules applied. Total rules applied 153 place count 159 transition count 329
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 156 place count 156 transition count 321
Iterating global reduction 3 with 3 rules applied. Total rules applied 159 place count 156 transition count 321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 162 place count 156 transition count 318
Applied a total of 162 rules in 8 ms. Remains 156 /231 variables (removed 75) and now considering 318/462 (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-6793408119220369457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8467953660006898425.kers'
[2026-05-25 10:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6793408119220369457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8467953660006898425.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 156 cols 1104 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-25 10:18:51] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8467953660006898425.kers
Total runtime 6 ms.
[2026-05-25 10:18:51] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-25 10:18:51] [INFO ] Invariant cache hit.
[2026-05-25 10:18:51] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2026-05-25 10:18:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 318/474 variables, 156/164 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (OVERLAPS) 0/474 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 168 constraints, problems are : Problem set: 0 solved, 317 unsolved in 28894 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 318/474 variables, 156/165 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 317/482 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 3/486 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 489 constraints, problems are : Problem set: 0 solved, 317 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 59000ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 59002ms
Starting structural reductions in LTL mode, iteration 1 : 156/231 places, 318/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59459 ms. Remains : 156/231 places, 318/462 transitions.
[2026-05-25 10:19:50] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:19:50] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:19:50] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-25 10:19:50] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:19:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:19:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1587035307368415916.gal : 2 ms
[2026-05-25 10:19:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1039287739229723209.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/CTLFireability1587035307368415916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1039287739229723209.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.
Detected timeout of ITS tools.
[2026-05-25 10:20:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:20:20] [INFO ] Applying decomposition
[2026-05-25 10:20:20] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2687823997797776751.txt' '-o' '/tmp/graph2687823997797776751.bin' '-w' '/tmp/graph2687823997797776751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2687823997797776751.bin' '-l' '-1' '-v' '-w' '/tmp/graph2687823997797776751.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:20:20] [INFO ] Decomposing Gal with order
[2026-05-25 10:20:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:20:20] [INFO ] Removed a total of 461 redundant transitions.
[2026-05-25 10:20:20] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:20:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 2 ms.
[2026-05-25 10:20:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6101982961894960488.gal : 2 ms
[2026-05-25 10:20:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15055520606376257568.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/CTLFireability6101982961894960488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15055520606376257568.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,8.9343e+09,2.22323,69580,1524,47,112260,500,643,237694,75,1583,0


Converting to forward existential form...Done !
original formula: EF((EX((i5.u24.p178==1)) + E(EF((i5.u27.p224==1)) U A((i5.u24.p179==1) U ((((i3.u2.p12==1)&&(i3.u4.p20==1))&&((i2.i1.u11.p66==1)&&(i4.u20...189
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * (i5.u24.p178==1))] != FALSE + [((FwdU(FwdU(Init,TRUE),E(TRUE U (i5.u27.p224==1))) * !(E...499
(forward)formula 0,1,2.32242,69684,1,0,112260,500,939,237694,103,1583,31961
FORMULA MedleyA-PT-23-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 195 transition count 412
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 195 transition count 412
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 90 place count 177 transition count 383
Iterating global reduction 0 with 18 rules applied. Total rules applied 108 place count 177 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 177 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 117 place count 169 transition count 368
Iterating global reduction 1 with 8 rules applied. Total rules applied 125 place count 169 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 127 place count 169 transition count 366
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 167 transition count 360
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 167 transition count 360
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 166 transition count 358
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 166 transition count 358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 166 transition count 357
Applied a total of 134 rules in 20 ms. Remains 166 /231 variables (removed 65) and now considering 357/462 (removed 105) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5327182402440462624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12080629829163200142.kers'
[2026-05-25 10:20:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5327182402440462624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12080629829163200142.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 166 cols 1254 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-25 10:20:23] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12080629829163200142.kers
Total runtime 4 ms.
[2026-05-25 10:20:23] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 10:20:23] [INFO ] Invariant cache hit.
[2026-05-25 10:20:23] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2026-05-25 10:20:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (OVERLAPS) 357/523 variables, 166/174 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 178 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 357/523 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 356/532 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 523/523 variables, and 538 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 166/231 places, 357/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60471 ms. Remains : 166/231 places, 357/462 transitions.
[2026-05-25 10:21:23] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:21:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:21:23] [INFO ] Input system was already deterministic with 357 transitions.
[2026-05-25 10:21:23] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:21:23] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:21:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14521306647236947021.gal : 2 ms
[2026-05-25 10:21:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3882353256707317461.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/CTLFireability14521306647236947021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3882353256707317461.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.
Detected timeout of ITS tools.
[2026-05-25 10:21:53] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:21:53] [INFO ] Applying decomposition
[2026-05-25 10:21:53] [INFO ] Flatten gal took : 12 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/graph12015384791107888188.txt' '-o' '/tmp/graph12015384791107888188.bin' '-w' '/tmp/graph12015384791107888188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12015384791107888188.bin' '-l' '-1' '-v' '-w' '/tmp/graph12015384791107888188.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:21:53] [INFO ] Decomposing Gal with order
[2026-05-25 10:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:21:53] [INFO ] Removed a total of 542 redundant transitions.
[2026-05-25 10:21:53] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2026-05-25 10:21:53] [INFO ] Time to serialize gal into /tmp/CTLFireability4662888584772153589.gal : 6 ms
[2026-05-25 10:21:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9988488746613660093.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/CTLFireability4662888584772153589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9988488746613660093.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42472e+10,2.33449,63488,1192,73,88149,1081,717,226079,99,3133,0


Converting to forward existential form...Done !
original formula: A(EG(AX(((((!((i7.u41.p331==1)||(i4.u14.p119==1)))&&(i6.i1.u18.p187==1))&&((i8.u45.p347==1)&&(i5.u49.p364==1)))&&(!(((i0.u1.p12==1)&&(i1....618
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(((i6.i1.u18.p211==1)&&(!((((i0.u1.p12==1)&&(i1.u5.p30==1))&&(i7.u39.p315==1))||(((i0.u1.p1...1782
Reverse transition relation is NOT exact ! Due to transitions t19, t59, t154, t155, t157, t158, t165, t185, t193, t194, t196, t197, t211, t219, t220, t222,...911
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Graph (trivial) has 190 edges and 231 vertex of which 26 / 231 are part of one of the 3 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 207 transition count 396
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 177 transition count 394
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 63 place count 177 transition count 389
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 73 place count 172 transition count 389
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 114 place count 131 transition count 324
Iterating global reduction 2 with 41 rules applied. Total rules applied 155 place count 131 transition count 324
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 160 place count 131 transition count 319
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 160 place count 131 transition count 316
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 166 place count 128 transition count 316
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 182 place count 112 transition count 271
Iterating global reduction 3 with 16 rules applied. Total rules applied 198 place count 112 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 203 place count 112 transition count 266
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 206 place count 109 transition count 259
Iterating global reduction 4 with 3 rules applied. Total rules applied 209 place count 109 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 210 place count 109 transition count 258
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 212 place count 107 transition count 252
Iterating global reduction 5 with 2 rules applied. Total rules applied 214 place count 107 transition count 252
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 216 place count 107 transition count 250
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 248 place count 91 transition count 234
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 253 place count 86 transition count 219
Iterating global reduction 6 with 5 rules applied. Total rules applied 258 place count 86 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 264 place count 86 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 270 place count 83 transition count 210
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 273 place count 80 transition count 201
Iterating global reduction 6 with 3 rules applied. Total rules applied 276 place count 80 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 279 place count 80 transition count 198
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 281 place count 80 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 283 place count 78 transition count 196
Applied a total of 283 rules in 33 ms. Remains 78 /231 variables (removed 153) and now considering 196/462 (removed 266) transitions.
[2026-05-25 10:22:23] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14694127919595195937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10953117479152728034.kers'
[2026-05-25 10:22:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14694127919595195937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10953117479152728034.kers]
Normalized transition count is 186 out of 187 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 78 cols 711 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 10:22:23] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10953117479152728034.kers
Total runtime 1 ms.
[2026-05-25 10:22:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 10:22:24] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
[2026-05-25 10:22:24] [INFO ] Invariant cache hit.
[2026-05-25 10:22:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:22:24] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2026-05-25 10:22:24] [INFO ] Redundant transitions in 4 ms returned []
Running 169 sub problems to find dead transitions.
[2026-05-25 10:22:24] [INFO ] Flow matrix only has 187 transitions (discarded 9 similar events)
[2026-05-25 10:22:24] [INFO ] Invariant cache hit.
[2026-05-25 10:22:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 185/260 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 4/264 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 88 constraints, problems are : Problem set: 0 solved, 169 unsolved in 9211 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (OVERLAPS) 185/260 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 4/264 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 149/257 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (OVERLAPS) 0/264 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 259 constraints, problems are : Problem set: 0 solved, 169 unsolved in 16028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 78/78 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 25293ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 25294ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/231 places, 196/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25716 ms. Remains : 78/231 places, 196/462 transitions.
[2026-05-25 10:22:49] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:22:49] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:22:49] [INFO ] Input system was already deterministic with 196 transitions.
[2026-05-25 10:22:49] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:22:49] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:22:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3457455875229462749.gal : 1 ms
[2026-05-25 10:22:49] [INFO ] Time to serialize properties into /tmp/CTLFireability15303949967332553296.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/CTLFireability3457455875229462749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15303949967332553296.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.20536e+07,5.89045,120408,2,8534,5,348316,6,0,504,455769,0


Converting to forward existential form...Done !
original formula: AG(AF((((p12==0)||(p25==0))||(p71==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p12==0)||(p25==0))||(p71==0))))] = FALSE
Hit Full ! (commute/partial/dont) 159/61/37
(forward)formula 0,0,8.35088,122476,1,0,9,526131,20,2,3064,455769,8
FORMULA MedleyA-PT-23-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Graph (trivial) has 186 edges and 231 vertex of which 23 / 231 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 210 transition count 402
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 182 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 181 transition count 399
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 61 place count 181 transition count 392
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 75 place count 174 transition count 392
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 115 place count 134 transition count 328
Iterating global reduction 3 with 40 rules applied. Total rules applied 155 place count 134 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 159 place count 134 transition count 324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 159 place count 134 transition count 322
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 132 transition count 322
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 179 place count 116 transition count 277
Iterating global reduction 4 with 16 rules applied. Total rules applied 195 place count 116 transition count 277
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 200 place count 116 transition count 272
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 203 place count 113 transition count 265
Iterating global reduction 5 with 3 rules applied. Total rules applied 206 place count 113 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 113 transition count 264
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 209 place count 111 transition count 258
Iterating global reduction 6 with 2 rules applied. Total rules applied 211 place count 111 transition count 258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 213 place count 111 transition count 256
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 245 place count 95 transition count 240
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 250 place count 90 transition count 225
Iterating global reduction 7 with 5 rules applied. Total rules applied 255 place count 90 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 261 place count 90 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 267 place count 87 transition count 216
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 270 place count 84 transition count 207
Iterating global reduction 7 with 3 rules applied. Total rules applied 273 place count 84 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 276 place count 84 transition count 204
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 278 place count 84 transition count 204
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 280 place count 82 transition count 202
Applied a total of 280 rules in 60 ms. Remains 82 /231 variables (removed 149) and now considering 202/462 (removed 260) transitions.
[2026-05-25 10:22:58] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15908941550350285536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3062279727734411859.kers'
[2026-05-25 10:22:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15908941550350285536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3062279727734411859.kers]
Normalized transition count is 192 out of 193 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 82 cols 723 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 10:22:58] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3062279727734411859.kers
Total runtime 6 ms.
[2026-05-25 10:22:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 10:22:58] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
[2026-05-25 10:22:58] [INFO ] Invariant cache hit.
[2026-05-25 10:22:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 10:22:58] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-25 10:22:58] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2026-05-25 10:22:58] [INFO ] Flow matrix only has 193 transitions (discarded 9 similar events)
[2026-05-25 10:22:58] [INFO ] Invariant cache hit.
[2026-05-25 10:22:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 191/270 variables, 79/87 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 4/274 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/275 variables, and 92 constraints, problems are : Problem set: 0 solved, 174 unsolved in 10547 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 191/270 variables, 79/87 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 4/274 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 150/267 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/275 variables, and 267 constraints, problems are : Problem set: 0 solved, 174 unsolved in 14819 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 25396ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 25396ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/231 places, 202/462 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25679 ms. Remains : 82/231 places, 202/462 transitions.
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:23:23] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:23:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 10:23:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4064626231561085870.gal : 1 ms
[2026-05-25 10:23:23] [INFO ] Time to serialize properties into /tmp/CTLFireability7523618548754604662.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/CTLFireability4064626231561085870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7523618548754604662.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7362e+07,6.0416,145968,2,9429,5,407872,6,0,526,547181,0


Converting to forward existential form...Done !
original formula: AG(AF((EG((p225==0)) * (((p12==0)||(p30==0))||((p271==0)||(p135==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG((p225==0)) * (((p12==0)||(p30==0))||((p271==0)||(p135==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t15, t18, t19, t26, t27, t29, t35, t38, t39, t46, t47, t81, t82, t83, t84, t85, t...469
Detected timeout of ITS tools.
[2026-05-25 10:23:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 10:23:53] [INFO ] Applying decomposition
[2026-05-25 10:23:53] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14487103795360937205.txt' '-o' '/tmp/graph14487103795360937205.bin' '-w' '/tmp/graph14487103795360937205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14487103795360937205.bin' '-l' '-1' '-v' '-w' '/tmp/graph14487103795360937205.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:23:53] [INFO ] Decomposing Gal with order
[2026-05-25 10:23:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:23:53] [INFO ] Removed a total of 326 redundant transitions.
[2026-05-25 10:23:53] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:23:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2026-05-25 10:23:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1844941510434731802.gal : 2 ms
[2026-05-25 10:23:53] [INFO ] Time to serialize properties into /tmp/CTLFireability15456424056982592972.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/CTLFireability1844941510434731802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15456424056982592972.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,2.7362e+07,0.079868,7284,254,70,5676,564,380,10967,84,1668,0


Converting to forward existential form...Done !
original formula: AG(AF((EG((i4.u9.p225==0)) * (((i1.u0.p12==0)||(u3.p30==0))||((i5.u14.p271==0)||(i4.u8.p135==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EG((i4.u9.p225==0)) * (((i1.u0.p12==0)||(u3.p30==0))||((i5.u14.p271==0)||(i4.u8.p135==0...170
Reverse transition relation is NOT exact ! Due to transitions t81, t82, t83, t93, t94, t95, t114, t115, t116, t139, t141, t147, t152, t154, t157, t161, t16...483
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,4.43578,139684,1,0,203797,5499,2155,616731,418,33667,310755
FORMULA MedleyA-PT-23-CTLFireability-2024-11 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 : 231/231 places, 462/462 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 192 transition count 405
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 192 transition count 405
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 192 transition count 403
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 101 place count 171 transition count 366
Iterating global reduction 1 with 21 rules applied. Total rules applied 122 place count 171 transition count 366
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 171 transition count 364
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 136 place count 159 transition count 339
Iterating global reduction 2 with 12 rules applied. Total rules applied 148 place count 159 transition count 339
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 152 place count 159 transition count 335
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 156 transition count 328
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 156 transition count 328
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 153 transition count 320
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 153 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 153 transition count 317
Applied a total of 167 rules in 22 ms. Remains 153 /231 variables (removed 78) and now considering 317/462 (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-7018152735996326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4700003393220378489.kers'
[2026-05-25 10:23:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7018152735996326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4700003393220378489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 153 cols 1108 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-25 10:23:58] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4700003393220378489.kers
Total runtime 4 ms.
[2026-05-25 10:23:58] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-25 10:23:58] [INFO ] Invariant cache hit.
[2026-05-25 10:23:58] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-25 10:23:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/470 variables, 153/162 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 0/470 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 166 constraints, problems are : Problem set: 0 solved, 316 unsolved in 28939 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/470 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 316/479 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 485 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 59043ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 59044ms
Starting structural reductions in LTL mode, iteration 1 : 153/231 places, 317/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59401 ms. Remains : 153/231 places, 317/462 transitions.
[2026-05-25 10:24:57] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:24:57] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:24:57] [INFO ] Input system was already deterministic with 317 transitions.
[2026-05-25 10:24:57] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:24:57] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:24:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14027861533484587755.gal : 2 ms
[2026-05-25 10:24:57] [INFO ] Time to serialize properties into /tmp/CTLFireability15473888296881415715.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/CTLFireability14027861533484587755.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15473888296881415715.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.
Detected timeout of ITS tools.
[2026-05-25 10:25:27] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:25:27] [INFO ] Applying decomposition
[2026-05-25 10:25:27] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12538018057118206169.txt' '-o' '/tmp/graph12538018057118206169.bin' '-w' '/tmp/graph12538018057118206169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12538018057118206169.bin' '-l' '-1' '-v' '-w' '/tmp/graph12538018057118206169.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:25:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:25:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:25:28] [INFO ] Removed a total of 473 redundant transitions.
[2026-05-25 10:25:28] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:25:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 4 ms.
[2026-05-25 10:25:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4267857720849352505.gal : 2 ms
[2026-05-25 10:25:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9452099194935306023.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/CTLFireability4267857720849352505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9452099194935306023.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27739e+10,10.1327,267384,2037,43,463733,448,649,834603,66,1289,0


Converting to forward existential form...Done !
original formula: AG((EX(EF((i0.u3.p5==1))) + (A(((i1.u6.p21==1)||(((i0.u4.p12==1)&&(i5.u9.p30==1))&&(i2.u12.p40==1))) U AF((((i0.u4.p12==1)&&(u8.p25==1))&...277
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((!((E(!(!(EG(!((((i0.u4.p12==1)&&(u8.p25==1))&&(i4.i0.u29.p226==1)))))) U (!(((i1.u6.p21=...499
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t83, t125, t138, t140, t141, t174, t176, t177, t198, t200, t201, t209, t210, t211, ...1099
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 192 transition count 403
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 192 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 192 transition count 401
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 101 place count 171 transition count 366
Iterating global reduction 1 with 21 rules applied. Total rules applied 122 place count 171 transition count 366
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 125 place count 171 transition count 363
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 134 place count 162 transition count 345
Iterating global reduction 2 with 9 rules applied. Total rules applied 143 place count 162 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 162 transition count 344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 148 place count 158 transition count 334
Iterating global reduction 3 with 4 rules applied. Total rules applied 152 place count 158 transition count 334
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 155 place count 155 transition count 326
Iterating global reduction 3 with 3 rules applied. Total rules applied 158 place count 155 transition count 326
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 161 place count 155 transition count 323
Applied a total of 161 rules in 12 ms. Remains 155 /231 variables (removed 76) and now considering 323/462 (removed 139) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17745441463024997010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17444051003140609685.kers'
[2026-05-25 10:25:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17745441463024997010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17444051003140609685.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 323 rows 155 cols 1108 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-25 10:25:58] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17444051003140609685.kers
Total runtime 4 ms.
[2026-05-25 10:25:58] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-25 10:25:58] [INFO ] Invariant cache hit.
[2026-05-25 10:25:58] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2026-05-25 10:25:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/478 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 168 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/478 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 322/487 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 3/490 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 493 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 155/231 places, 323/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60503 ms. Remains : 155/231 places, 323/462 transitions.
[2026-05-25 10:26:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:26:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:26:58] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-25 10:26:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:26:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability1253807325735629458.gal : 1 ms
[2026-05-25 10:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability339580818862499635.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/CTLFireability1253807325735629458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability339580818862499635.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.
Detected timeout of ITS tools.
[2026-05-25 10:27:28] [INFO ] Flatten gal took : 9 ms
[2026-05-25 10:27:28] [INFO ] Applying decomposition
[2026-05-25 10:27:28] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15522598531668470498.txt' '-o' '/tmp/graph15522598531668470498.bin' '-w' '/tmp/graph15522598531668470498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15522598531668470498.bin' '-l' '-1' '-v' '-w' '/tmp/graph15522598531668470498.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:27:28] [INFO ] Decomposing Gal with order
[2026-05-25 10:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:27:28] [INFO ] Removed a total of 457 redundant transitions.
[2026-05-25 10:27:28] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-25 10:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5459036582565317396.gal : 3 ms
[2026-05-25 10:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12127008062844888803.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/CTLFireability5459036582565317396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12127008062844888803.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,8.71409e+09,1.43849,45320,1313,54,70443,570,615,171816,76,1746,0


Converting to forward existential form...Done !
original formula: A((!(A((EG(((i0.u1.p11==1)&&(i7.u41.p341==1))) * EX(((u5.p29==1)&&(i4.u25.p212==1)))) U (AX((i2.u10.p43==1)) + AX((i2.u15.p101==1))))) + ...379
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(EX(!(((i5.u33.p282!=1) + E(TRUE U (i1.u39.p334==1)))))))))))) * !(E(!(!(EX(!(EX(!(((i5.u...1038
Reverse transition relation is NOT exact ! Due to transitions t19, t56, t144, t146, t147, t182, t184, t185, t207, t209, t210, t215, t216, t217, t218, t219,...881
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 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
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 190 transition count 403
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 190 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 190 transition count 401
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 105 place count 169 transition count 366
Iterating global reduction 1 with 21 rules applied. Total rules applied 126 place count 169 transition count 366
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 169 transition count 363
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 140 place count 158 transition count 341
Iterating global reduction 2 with 11 rules applied. Total rules applied 151 place count 158 transition count 341
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 158 transition count 338
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 154 transition count 328
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 154 transition count 328
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 151 transition count 320
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 151 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 151 transition count 317
Applied a total of 171 rules in 8 ms. Remains 151 /231 variables (removed 80) and now considering 317/462 (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-17599460665883465242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1982582258622979820.kers'
[2026-05-25 10:27:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17599460665883465242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1982582258622979820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 151 cols 1102 entries
Finished phase 1 with 143 SingleSign rule and 0 generalized
[2026-05-25 10:27:58] [INFO ] Computed 8 invariants in 4 ms
Computed 8 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1982582258622979820.kers
Total runtime 5 ms.
[2026-05-25 10:27:59] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 10:27:59] [INFO ] Invariant cache hit.
[2026-05-25 10:27:59] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-25 10:27:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 317/468 variables, 151/159 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/468 variables, and 164 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/468 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 316/477 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 3/480 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 3/483 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 483 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 151/231 places, 317/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60560 ms. Remains : 151/231 places, 317/462 transitions.
[2026-05-25 10:28:59] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:28:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:28:59] [INFO ] Input system was already deterministic with 317 transitions.
[2026-05-25 10:28:59] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:28:59] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:28:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10367487645062478645.gal : 2 ms
[2026-05-25 10:28:59] [INFO ] Time to serialize properties into /tmp/CTLFireability8385816439918763422.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/CTLFireability10367487645062478645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8385816439918763422.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.
Detected timeout of ITS tools.
[2026-05-25 10:29:29] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:29:29] [INFO ] Applying decomposition
[2026-05-25 10:29:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9246202789684205556.txt' '-o' '/tmp/graph9246202789684205556.bin' '-w' '/tmp/graph9246202789684205556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9246202789684205556.bin' '-l' '-1' '-v' '-w' '/tmp/graph9246202789684205556.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:29:29] [INFO ] Decomposing Gal with order
[2026-05-25 10:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:29:29] [INFO ] Removed a total of 458 redundant transitions.
[2026-05-25 10:29:29] [INFO ] Flatten gal took : 11 ms
[2026-05-25 10:29:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2026-05-25 10:29:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5744461052672146961.gal : 2 ms
[2026-05-25 10:29:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6653426835584819791.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/CTLFireability5744461052672146961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6653426835584819791.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,7.72355e+09,3.29795,100188,1527,60,178091,579,689,332202,78,1800,0


Converting to forward existential form...Done !
original formula: A(EG(AG(((i2.u17.p120==1)&&(i9.u45.p376==1)))) U AF(!((EF((i2.u13.p94==1)) + EX((((i5.i1.u34.p323==1)&&(i7.u39.p347==1))||((i4.i0.u25.p22...185
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!((E(TRUE U (i2.u13.p94==1)) + EX((((i5.i1.u34.p323==1)&&(i7.u39.p347==1))||((i4.i0.u25....544
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t135, t136, t138, t139, t140, t173, t174, t176, t177, t178, t199, t200, t202, t203,...952
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 462/462 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 191 transition count 402
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 191 transition count 402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 82 place count 191 transition count 400
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 103 place count 170 transition count 366
Iterating global reduction 1 with 21 rules applied. Total rules applied 124 place count 170 transition count 366
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 170 transition count 363
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 137 place count 160 transition count 343
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 160 transition count 343
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 160 transition count 340
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 157 transition count 332
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 157 transition count 332
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 155 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 155 transition count 327
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 155 transition count 325
Applied a total of 162 rules in 32 ms. Remains 155 /231 variables (removed 76) and now considering 325/462 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9345611920828617828.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1669164231071117601.kers'
[2026-05-25 10:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9345611920828617828.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1669164231071117601.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 325 rows 155 cols 1142 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-25 10:29:59] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1669164231071117601.kers
Total runtime 1 ms.
[2026-05-25 10:29:59] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 10:29:59] [INFO ] Invariant cache hit.
[2026-05-25 10:30:00] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2026-05-25 10:30:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/480 variables, 155/164 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (OVERLAPS) 0/480 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 480/480 variables, and 168 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/480 variables, 155/165 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 324/489 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 495 constraints, problems are : Problem set: 0 solved, 324 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 155/231 places, 325/462 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60459 ms. Remains : 155/231 places, 325/462 transitions.
[2026-05-25 10:31:00] [INFO ] Flatten gal took : 12 ms
[2026-05-25 10:31:00] [INFO ] Flatten gal took : 5 ms
[2026-05-25 10:31:00] [INFO ] Input system was already deterministic with 325 transitions.
[2026-05-25 10:31:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:31:00] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:31:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3352624917973043481.gal : 2 ms
[2026-05-25 10:31:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17569616880332381524.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/CTLFireability3352624917973043481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17569616880332381524.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.
Detected timeout of ITS tools.
[2026-05-25 10:31:30] [INFO ] Flatten gal took : 4 ms
[2026-05-25 10:31:30] [INFO ] Applying decomposition
[2026-05-25 10:31:30] [INFO ] Flatten gal took : 10 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/graph17728197007436632026.txt' '-o' '/tmp/graph17728197007436632026.bin' '-w' '/tmp/graph17728197007436632026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17728197007436632026.bin' '-l' '-1' '-v' '-w' '/tmp/graph17728197007436632026.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:31:30] [INFO ] Decomposing Gal with order
[2026-05-25 10:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:31:30] [INFO ] Removed a total of 484 redundant transitions.
[2026-05-25 10:31:30] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 4 ms.
[2026-05-25 10:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16110766806626851253.gal : 2 ms
[2026-05-25 10:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability514390398309647992.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/CTLFireability16110766806626851253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability514390398309647992.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,8.72353e+09,2.50146,73244,1355,52,114858,829,607,234172,81,2739,0


Converting to forward existential form...Done !
original formula: A(!((((i1.u1.p12==1)&&(i5.u3.p20==1))&&(i6.u36.p315==1))) U !(A(EF((i2.u12.p46==1)) U ((((i2.u12.p105==1)&&(i8.u42.p352==1))||(i3.u17.p19...188
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!(((((i2.u12.p105==1)&&(i8.u42.p352==1))||(i3.u17.p192==1)) * EX((i8.u44.p359==1)))) U (...1074
Reverse transition relation is NOT exact ! Due to transitions t19, t51, t140, t142, t143, t176, t178, t179, t200, t202, t203, t208, t209, t210, t211, t213,...857
Detected timeout of ITS tools.
[2026-05-25 10:32:00] [INFO ] Flatten gal took : 6 ms
[2026-05-25 10:32:00] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:32:00] [INFO ] Applying decomposition
[2026-05-25 10:32:00] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17189161820369091035.txt' '-o' '/tmp/graph17189161820369091035.bin' '-w' '/tmp/graph17189161820369091035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17189161820369091035.bin' '-l' '-1' '-v' '-w' '/tmp/graph17189161820369091035.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:32:00] [INFO ] Decomposing Gal with order
[2026-05-25 10:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:32:00] [INFO ] Removed a total of 703 redundant transitions.
[2026-05-25 10:32:00] [INFO ] Flatten gal took : 50 ms
[2026-05-25 10:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 6 ms.
[2026-05-25 10:32:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17595610931717850982.gal : 4 ms
[2026-05-25 10:32:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10361000758379643134.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/CTLFireability17595610931717850982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10361000758379643134.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09455e+11,10.9088,205932,2704,78,308617,1125,1051,702766,102,4558,0


Converting to forward existential form...Done !
original formula: (AG(((((((AF((i7.i1.u58.p272==0)) + EG((((i0.u3.p12==0)||(i0.u8.p25==0))||(i2.i1.u26.p115==0)))) + (A(((i0.u7.p19==1)&&(i4.i3.u48.p226==1...958
=> equivalent forward existential formula: ([((Init * !(!(E(TRUE U !(((((((!(EG(!((i7.i1.u58.p272==0)))) + EG((((i0.u3.p12==0)||(i0.u8.p25==0))||(i2.i1.u26...3895
Reverse transition relation is NOT exact ! Due to transitions t21, t78, t116, t168, t189, t211, t212, t214, t215, t216, t223, t224, t226, t227, t228, t229,...1536
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
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
(forward)formula 0,0,601.554,5749676,1,0,6.94032e+06,11034,4066,1.79244e+07,335,60929,967443
FORMULA MedleyA-PT-23-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: A(((EF(AG(EX(((i0.u7.p19==1)&&(i2.i1.u24.p112==1))))) + !(EF((i2.i2.u27.p124==1)))) * (E(!(EF(((i0.u4.p11==1)&&(i9.i0.u80.p373==1)))) U E...260
=> equivalent forward existential formula: [((Init * !(EG(!((i2.i2.u17.p63==1))))) * !(E(!((i2.i2.u17.p63==1)) U (!(((E(TRUE U !(E(TRUE U !(EX(((i0.u7.p19=...415
(forward)formula 1,0,956.698,6898780,1,0,8.44035e+06,14908,2260,2.15004e+07,225,90282,376486
FORMULA MedleyA-PT-23-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2026-05-25 11:01:06] [INFO ] Applying decomposition
[2026-05-25 11:01:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 11:01:06] [INFO ] Decomposing Gal with order
[2026-05-25 11:01:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:01:06] [INFO ] Removed a total of 485 redundant transitions.
[2026-05-25 11:01:06] [INFO ] Flatten gal took : 24 ms
[2026-05-25 11:01:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 6 ms.
[2026-05-25 11:01:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2753119039138014199.gal : 2 ms
[2026-05-25 11:01:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14474418763688463369.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/CTLFireability2753119039138014199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14474418763688463369.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 8 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.09455e+11,154.235,3634472,3396,5990,4.87147e+06,414743,332,2.20929e+07,520,1.09438e+07,0


Converting to forward existential form...Done !
original formula: (AG(EF(EX(((i0.i1.u13.p305==1)&&(i1.i0.u16.p338==1))))) * !(A((((A(!(E((i0.i1.u13.p237==1) U (i0.i1.u13.p241==1))) U EG(((i0.i1.i0.u12.p2...482
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EX(((i0.i1.u13.p305==1)&&(i1.i0.u16.p338==1))))))] = FALSE * [((Init * !(EG(!((!...1378
Reverse transition relation is NOT exact ! Due to transitions t213, t222, t263, t279, i0.t402, i0.t390, i0.t318, i0.i0.t189, i0.i0.u3.t200, i0.i0.u3.t204, ...1178

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r178-oct2-177969020000274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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