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-177969020000234.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-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 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 158K 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-18-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779700976161

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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 09:22:57] [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 09:22:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:22:57] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-25 09:22:57] [INFO ] Transformed 252 places.
[2026-05-25 09:22:57] [INFO ] Transformed 543 transitions.
[2026-05-25 09:22:57] [INFO ] Found NUPN structural information;
[2026-05-25 09:22:57] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 100 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 230 transition count 503
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 230 transition count 503
Applied a total of 44 rules in 26 ms. Remains 230 /252 variables (removed 22) and now considering 503/541 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15794141767035753846.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-805193365223444113.kers'
[2026-05-25 09:22:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15794141767035753846.kers, --Pflows, --basisKERS=/tmp/petrispot-output-805193365223444113.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 503 rows 230 cols 2356 entries
Finished phase 1 with 222 SingleSign rule and 1 generalized
[2026-05-25 09:22:58] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-805193365223444113.kers
Total runtime 3 ms.
[2026-05-25 09:22:58] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-25 09:22:58] [INFO ] Invariant cache hit.
[2026-05-25 09:22:58] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2026-05-25 09:22:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/733 variables, and 59 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
SMT process timed out in 60504ms, After SMT, problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60521ms
Starting structural reductions in LTL mode, iteration 1 : 230/252 places, 503/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61275 ms. Remains : 230/252 places, 503/541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Applied a total of 0 rules in 5 ms. Remains 230 /230 variables (removed 0) and now considering 503/503 (removed 0) transitions.
[2026-05-25 09:23:59] [INFO ] Invariant cache hit.
[2026-05-25 09:23:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:23:59] [INFO ] Invariant cache hit.
[2026-05-25 09:23:59] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 230/230 places, 503/503 transitions.
Support contains 100 out of 230 places after structural reductions.
[2026-05-25 09:23:59] [INFO ] Flatten gal took : 79 ms
[2026-05-25 09:23:59] [INFO ] Flatten gal took : 36 ms
[2026-05-25 09:23:59] [INFO ] Input system was already deterministic with 503 transitions.
RANDOM walk for 40000 steps (1531 resets) in 2645 ms. (15 steps per ms) remains 76/88 properties
BEST_FIRST walk for 4002 steps (34 resets) in 50 ms. (78 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (34 resets) in 39 ms. (100 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (34 resets) in 28 ms. (138 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (32 resets) in 28 ms. (138 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (35 resets) in 47 ms. (83 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (34 resets) in 30 ms. (129 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 76/76 properties
BEST_FIRST walk for 4002 steps (32 resets) in 23 ms. (166 steps per ms) remains 74/76 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (36 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (34 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (34 resets) in 45 ms. (87 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 27 ms. (142 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (32 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (32 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (36 resets) in 24 ms. (160 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (33 resets) in 40 ms. (97 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (32 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (33 resets) in 27 ms. (143 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (32 resets) in 24 ms. (160 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (33 resets) in 26 ms. (148 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (35 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (33 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (33 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 21 ms. (181 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (34 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (34 resets) in 21 ms. (182 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (35 resets) in 20 ms. (190 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (32 resets) in 16 ms. (235 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (34 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
[2026-05-25 09:24:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/230 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 17/24 constraints. Problems are: Problem set: 4 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 1/25 constraints. Problems are: Problem set: 4 solved, 70 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/733 variables, and 26 constraints, problems are : Problem set: 4 solved, 70 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/230 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 70 unsolved
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 150/230 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 19/26 constraints. Problems are: Problem set: 6 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 3/29 constraints. Problems are: Problem set: 6 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 5/34 constraints. Problems are: Problem set: 6 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 5/39 constraints. Problems are: Problem set: 6 solved, 68 unsolved
SMT process timed out in 10177ms, After SMT, problems are : Problem set: 6 solved, 68 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 77 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 503/503 transitions.
Graph (trivial) has 90 edges and 230 vertex of which 4 / 230 are part of one of the 1 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 227 transition count 473
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 201 transition count 471
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 62 place count 200 transition count 465
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 68 place count 194 transition count 465
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 68 place count 194 transition count 458
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 82 place count 187 transition count 458
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 91 place count 178 transition count 443
Iterating global reduction 4 with 9 rules applied. Total rules applied 100 place count 178 transition count 443
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 178 transition count 442
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 177 transition count 442
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 132 place count 162 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 159 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 148 place count 159 transition count 418
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 152 place count 155 transition count 414
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 155 transition count 414
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 160 place count 153 transition count 418
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 170 place count 153 transition count 408
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 181 place count 143 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 143 transition count 406
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 143 transition count 406
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 184 place count 142 transition count 405
Applied a total of 184 rules in 161 ms. Remains 142 /230 variables (removed 88) and now considering 405/503 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 142/230 places, 405/503 transitions.
RANDOM walk for 40000 steps (2833 resets) in 430 ms. (92 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4004 steps (58 resets) in 33 ms. (117 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (58 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (56 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (58 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (60 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (57 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (57 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (53 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (59 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (57 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (61 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (60 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (56 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (59 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (57 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (59 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (61 resets) in 21 ms. (181 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (57 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (58 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (60 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (56 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (57 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (58 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (58 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (57 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (54 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (58 resets) in 25 ms. (154 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (58 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (56 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (59 resets) in 18 ms. (210 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (56 resets) in 10 ms. (363 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (55 resets) in 10 ms. (363 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4003 steps (58 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (60 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (56 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (59 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (59 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (56 resets) in 11 ms. (333 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (56 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (59 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (55 resets) in 12 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (56 resets) in 12 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (59 resets) in 9 ms. (400 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (58 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (59 resets) in 8 ms. (444 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 66/66 properties
Interrupted probabilistic random walk after 559700 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :45 out of 66
Probabilistic random walk after 559700 steps, saw 94848 distinct states, run finished after 3007 ms. (steps per millisecond=186 ) properties seen :45
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1127387574833669271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8256820284645036198.kers'
[2026-05-25 09:24:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1127387574833669271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8256820284645036198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 142 cols 2151 entries
Finished phase 1 with 134 SingleSign rule and 1 generalized
[2026-05-25 09:24:15] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8256820284645036198.kers
Total runtime 2 ms.
[2026-05-25 09:24:15] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 110/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 405/547 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/547 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 161 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2505 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 142/142 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 110/142 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/142 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 4 (OVERLAPS) 405/547 variables, 142/150 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 11/161 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 19/180 constraints. Problems are: Problem set: 2 solved, 19 unsolved
SMT process timed out in 47632ms, After SMT, problems are : Problem set: 2 solved, 19 unsolved
Fused 19 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 5733 ms.
Support contains 27 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 405/405 transitions.
Graph (trivial) has 86 edges and 142 vertex of which 2 / 142 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 141 transition count 389
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 127 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 126 transition count 387
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 32 place count 126 transition count 385
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 124 transition count 385
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 51 place count 109 transition count 356
Iterating global reduction 3 with 15 rules applied. Total rules applied 66 place count 109 transition count 356
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 109 transition count 355
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 108 transition count 355
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 101 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 100 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 100 transition count 346
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 98 place count 93 transition count 387
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 93 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 109 place count 93 transition count 376
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 4 with 4 rules applied. Total rules applied 113 place count 91 transition count 378
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 115 place count 91 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 91 transition count 373
Free-agglomeration rule applied 16 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 134 place count 91 transition count 355
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 166 place count 75 transition count 339
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 171 place count 75 transition count 334
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 172 place count 75 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 173 place count 74 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 175 place count 74 transition count 331
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 176 place count 74 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 73 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 179 place count 73 transition count 328
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 181 place count 73 transition count 332
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 187 place count 71 transition count 328
Applied a total of 187 rules in 90 ms. Remains 71 /142 variables (removed 71) and now considering 328/405 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 71/142 places, 328/405 transitions.
RANDOM walk for 40000 steps (3041 resets) in 293 ms. (136 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (63 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (64 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (73 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (67 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (71 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (58 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (73 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (64 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (72 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (68 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (64 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (68 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (66 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (69 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (72 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (71 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (68 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (64 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 204407 steps, run visited all 18 properties in 722 ms. (steps per millisecond=283 )
Probabilistic random walk after 204407 steps, saw 49995 distinct states, run finished after 726 ms. (steps per millisecond=281 ) properties seen :18
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-18-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 09:25:09] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:25:09] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:25:09] [INFO ] Input system was already deterministic with 503 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 203 transition count 460
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 201 transition count 458
Applied a total of 58 rules in 8 ms. Remains 201 /230 variables (removed 29) and now considering 458/503 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11487898910176481334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13783163683388911356.kers'
[2026-05-25 09:25:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11487898910176481334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13783163683388911356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 201 cols 2266 entries
Finished phase 1 with 193 SingleSign rule and 1 generalized
[2026-05-25 09:25:09] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13783163683388911356.kers
Total runtime 5 ms.
[2026-05-25 09:25:09] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 09:25:09] [INFO ] Invariant cache hit.
[2026-05-25 09:25:09] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2026-05-25 09:25:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 49 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/659 variables, and 59 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60242ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 201/230 places, 458/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60593 ms. Remains : 201/230 places, 458/503 transitions.
[2026-05-25 09:26:10] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:26:10] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:26:10] [INFO ] Input system was already deterministic with 458 transitions.
[2026-05-25 09:26:10] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:26:10] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:26:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2453961416251231897.gal : 13 ms
[2026-05-25 09:26:10] [INFO ] Time to serialize properties into /tmp/CTLFireability4028482487663822591.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2453961416251231897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4028482487663822591.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 09:26:40] [INFO ] Flatten gal took : 50 ms
[2026-05-25 09:26:40] [INFO ] Applying decomposition
[2026-05-25 09:26:40] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7929117322712018715.txt' '-o' '/tmp/graph7929117322712018715.bin' '-w' '/tmp/graph7929117322712018715.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7929117322712018715.bin' '-l' '-1' '-v' '-w' '/tmp/graph7929117322712018715.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:26:40] [INFO ] Decomposing Gal with order
[2026-05-25 09:26:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:26:40] [INFO ] Removed a total of 1316 redundant transitions.
[2026-05-25 09:26:40] [INFO ] Flatten gal took : 102 ms
[2026-05-25 09:26:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 23 ms.
[2026-05-25 09:26:40] [INFO ] Time to serialize gal into /tmp/CTLFireability8497683338433040995.gal : 9 ms
[2026-05-25 09:26:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17499417088219856173.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/CTLFireability8497683338433040995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17499417088219856173.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.94267e+07,8.8111,165964,3516,24,113969,301,1155,1.49368e+06,58,887,0


Converting to forward existential form...Done !
original formula: EG(AF(AX((i3.i0.u36.p132==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!((i3.i0.u36.p132==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t48, t94, t105, t159, t175, t188, t190, t202, t204, t226, t228, t234, t236, t258, t260, ...1053
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 SI_CTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Graph (trivial) has 252 edges and 230 vertex of which 13 / 230 are part of one of the 3 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 219 transition count 439
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 166 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 164 transition count 435
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 113 place count 164 transition count 428
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 127 place count 157 transition count 428
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 151 place count 133 transition count 385
Iterating global reduction 3 with 24 rules applied. Total rules applied 175 place count 133 transition count 385
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 133 transition count 384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 177 place count 132 transition count 384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 177 place count 132 transition count 381
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 183 place count 129 transition count 381
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 187 place count 125 transition count 349
Iterating global reduction 5 with 4 rules applied. Total rules applied 191 place count 125 transition count 349
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 192 place count 124 transition count 347
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 124 transition count 347
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 227 place count 107 transition count 330
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 229 place count 105 transition count 326
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 105 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 243 place count 105 transition count 314
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 243 place count 105 transition count 312
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 103 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 259 place count 97 transition count 306
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 261 place count 95 transition count 298
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 95 transition count 298
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 265 place count 93 transition count 294
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 93 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 268 place count 92 transition count 293
Applied a total of 268 rules in 108 ms. Remains 92 /230 variables (removed 138) and now considering 293/503 (removed 210) transitions.
[2026-05-25 09:27:11] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18432008615088243923.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6814757833789020417.kers'
[2026-05-25 09:27:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18432008615088243923.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6814757833789020417.kers]
Normalized transition count is 290 out of 291 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 92 cols 1308 entries
Finished phase 1 with 84 SingleSign rule and 1 generalized
[2026-05-25 09:27:11] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6814757833789020417.kers
Total runtime 1 ms.
[2026-05-25 09:27:11] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 09:27:11] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
[2026-05-25 09:27:11] [INFO ] Invariant cache hit.
[2026-05-25 09:27:11] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-25 09:27:11] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2026-05-25 09:27:11] [INFO ] Redundant transitions in 8 ms returned []
Running 288 sub problems to find dead transitions.
[2026-05-25 09:27:11] [INFO ] Flow matrix only has 291 transitions (discarded 2 similar events)
[2026-05-25 09:27:11] [INFO ] Invariant cache hit.
[2026-05-25 09:27:11] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 290/382 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 64/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 1/383 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 178 constraints, problems are : Problem set: 0 solved, 288 unsolved in 27558 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
At refinement iteration 4 (OVERLAPS) 290/382 variables, 92/114 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 64/178 constraints. Problems are: Problem set: 36 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 252/430 constraints. Problems are: Problem set: 36 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/383 variables, and 430 constraints, problems are : Problem set: 36 solved, 252 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 92/92 constraints, ReadFeed: 64/65 constraints, PredecessorRefiner: 252/288 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57729ms problems are : Problem set: 36 solved, 252 unsolved
Search for dead transitions found 36 dead transitions in 57731ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 92/230 places, 257/503 transitions.
Applied a total of 0 rules in 10 ms. Remains 92 /92 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2026-05-25 09:28:09] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 58208 ms. Remains : 92/230 places, 257/503 transitions.
[2026-05-25 09:28:09] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:28:09] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:28:09] [INFO ] Input system was already deterministic with 257 transitions.
RANDOM walk for 252 steps (43 resets) in 6 ms. (36 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 09:28:09] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:28:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:28:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2369316961063587673.gal : 3 ms
[2026-05-25 09:28:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17026515533725266264.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/ReachabilityCardinality2369316961063587673.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17026515533725266264.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 207 transition count 465
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 207 transition count 465
Applied a total of 46 rules in 5 ms. Remains 207 /230 variables (removed 23) and now considering 465/503 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10087429504215263507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4334422575767757537.kers'
[2026-05-25 09:28:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10087429504215263507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4334422575767757537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 207 cols 2280 entries
Finished phase 1 with 199 SingleSign rule and 1 generalized
[2026-05-25 09:28:09] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4334422575767757537.kers
Total runtime 2 ms.
[2026-05-25 09:28:09] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-25 09:28:09] [INFO ] Invariant cache hit.
[2026-05-25 09:28:09] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-25 09:28:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/672 variables, and 46 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 6 (OVERLAPS) 465/672 variables, 207/263 constraints. Problems are: Problem set: 50 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 414/677 constraints. Problems are: Problem set: 50 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 677 constraints, problems are : Problem set: 50 solved, 414 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 414/464 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 50 solved, 414 unsolved
Search for dead transitions found 50 dead transitions in 60191ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 207/230 places, 415/503 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60581 ms. Remains : 207/230 places, 415/503 transitions.
[2026-05-25 09:29:09] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:29:09] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:29:09] [INFO ] Input system was already deterministic with 415 transitions.
[2026-05-25 09:29:09] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:29:09] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability225559973921721531.gal : 3 ms
[2026-05-25 09:29:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8200479975374506726.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability225559973921721531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8200479975374506726.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 09:29:40] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:29:40] [INFO ] Applying decomposition
[2026-05-25 09:29:40] [INFO ] Flatten gal took : 9 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/graph5994158224208946463.txt' '-o' '/tmp/graph5994158224208946463.bin' '-w' '/tmp/graph5994158224208946463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5994158224208946463.bin' '-l' '-1' '-v' '-w' '/tmp/graph5994158224208946463.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:29:40] [INFO ] Decomposing Gal with order
[2026-05-25 09:29:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:29:40] [INFO ] Removed a total of 931 redundant transitions.
[2026-05-25 09:29:40] [INFO ] Flatten gal took : 31 ms
[2026-05-25 09:29:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 10 ms.
[2026-05-25 09:29:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17880653485445249256.gal : 3 ms
[2026-05-25 09:29:40] [INFO ] Time to serialize properties into /tmp/CTLFireability9041059656610461733.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/CTLFireability17880653485445249256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9041059656610461733.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,3.31439e+07,2.03381,97920,2337,28,117103,414,982,780769,69,1070,0


Converting to forward existential form...Done !
original formula: A((A(((i3.i1.u27.p109==1) + AF((i6.i0.u66.p222==1))) U A(((((i8.i1.u5.p25==1)&&(i5.u7.p41==1))&&((i7.u13.p58==1)&&(i8.i1.u24.p99==1)))&&(...468
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(EX(!(!((E(!((i1.i1.u39.p140==1)) U (!((((i8.i1.u2.p19==1)&&(i8.i1.u17.p73==1))&&((i3.i1.u...1596
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t59, t110, t188, t195, t202, t207, t233, t235, t241, t243, t265, t267, t273, t275, ...1053
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 205 transition count 464
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 205 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 203 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 203 transition count 462
Applied a total of 54 rules in 17 ms. Remains 203 /230 variables (removed 27) and now considering 462/503 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17801847920323137380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16475762293023409957.kers'
[2026-05-25 09:30:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17801847920323137380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16475762293023409957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 203 cols 2274 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:30:10] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16475762293023409957.kers
Total runtime 3 ms.
[2026-05-25 09:30:10] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-25 09:30:10] [INFO ] Invariant cache hit.
[2026-05-25 09:30:10] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:30:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 51 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 44/44 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/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 44/51 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 6 (OVERLAPS) 462/665 variables, 203/256 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 411/667 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 667 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60224ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60227ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/230 places, 412/503 transitions.
Applied a total of 0 rules in 6 ms. Remains 203 /203 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60748 ms. Remains : 203/230 places, 412/503 transitions.
[2026-05-25 09:31:11] [INFO ] Flatten gal took : 23 ms
[2026-05-25 09:31:11] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:31:11] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-25 09:31:11] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:31:11] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:31:11] [INFO ] Time to serialize gal into /tmp/CTLFireability2972081528243955654.gal : 2 ms
[2026-05-25 09:31:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12125980023130935825.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/CTLFireability2972081528243955654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12125980023130935825.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 09:31:41] [INFO ] Flatten gal took : 26 ms
[2026-05-25 09:31:41] [INFO ] Applying decomposition
[2026-05-25 09:31:41] [INFO ] Flatten gal took : 22 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/graph14005176249676787526.txt' '-o' '/tmp/graph14005176249676787526.bin' '-w' '/tmp/graph14005176249676787526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14005176249676787526.bin' '-l' '-1' '-v' '-w' '/tmp/graph14005176249676787526.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:31:41] [INFO ] Decomposing Gal with order
[2026-05-25 09:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:31:41] [INFO ] Removed a total of 917 redundant transitions.
[2026-05-25 09:31:41] [INFO ] Flatten gal took : 38 ms
[2026-05-25 09:31:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 10 ms.
[2026-05-25 09:31:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15101250251212900763.gal : 4 ms
[2026-05-25 09:31:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14498176792692377837.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/CTLFireability15101250251212900763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14498176792692377837.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,3.33132e+07,2.67807,74624,2930,54,135806,502,900,342357,81,1218,0


Converting to forward existential form...Done !
original formula: EG(EX(((A((i0.u3.p10!=1) U EF((i1.u9.p48==1))) + (i0.u1.p6==1)) + (((i1.u9.p47==1)&&(i1.u23.p98==1))&&((i2.i0.u40.p165==1)&&(i1.u70.p246=...163
=> equivalent forward existential formula: [FwdG(Init,EX(((!((E(!(E(TRUE U (i1.u9.p48==1))) U (!((i0.u3.p10!=1)) * !(E(TRUE U (i1.u9.p48==1))))) + EG(!(E(T...289
Reverse transition relation is NOT exact ! Due to transitions t30, t39, t79, t85, t88, t122, t181, t188, t195, t208, t229, t232, t237, t240, t261, t264, t2...1132
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 205 transition count 463
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 205 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 203 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 203 transition count 461
Applied a total of 54 rules in 17 ms. Remains 203 /230 variables (removed 27) and now considering 461/503 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6125383222551928437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15948001878774635194.kers'
[2026-05-25 09:32:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6125383222551928437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15948001878774635194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 203 cols 2272 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:32:11] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15948001878774635194.kers
Total runtime 6 ms.
[2026-05-25 09:32:11] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-25 09:32:11] [INFO ] Invariant cache hit.
[2026-05-25 09:32:12] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-25 09:32:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 42 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (OVERLAPS) 461/664 variables, 203/260 constraints. Problems are: Problem set: 50 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 410/670 constraints. Problems are: Problem set: 50 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 670 constraints, problems are : Problem set: 50 solved, 410 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 410/460 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 50 solved, 410 unsolved
Search for dead transitions found 50 dead transitions in 60250ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/230 places, 411/503 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60806 ms. Remains : 203/230 places, 411/503 transitions.
[2026-05-25 09:33:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:33:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:33:12] [INFO ] Input system was already deterministic with 411 transitions.
[2026-05-25 09:33:12] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:33:12] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:33:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16941637002489028575.gal : 3 ms
[2026-05-25 09:33:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8901908082718482601.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/CTLFireability16941637002489028575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8901908082718482601.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 09:33:42] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:33:42] [INFO ] Applying decomposition
[2026-05-25 09:33:42] [INFO ] Flatten gal took : 8 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/graph16402941641718625105.txt' '-o' '/tmp/graph16402941641718625105.bin' '-w' '/tmp/graph16402941641718625105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16402941641718625105.bin' '-l' '-1' '-v' '-w' '/tmp/graph16402941641718625105.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:33:42] [INFO ] Decomposing Gal with order
[2026-05-25 09:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:33:42] [INFO ] Removed a total of 930 redundant transitions.
[2026-05-25 09:33:42] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2026-05-25 09:33:42] [INFO ] Time to serialize gal into /tmp/CTLFireability5555131612291521303.gal : 3 ms
[2026-05-25 09:33:42] [INFO ] Time to serialize properties into /tmp/CTLFireability10292591369752146078.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/CTLFireability5555131612291521303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10292591369752146078.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,3.10312e+07,4.70566,132080,2133,28,143743,426,831,1.05662e+06,67,1170,0


Converting to forward existential form...Done !
original formula: AG((AF((A(((((i1.i0.u3.p18==1)&&(i9.i0.u7.p41==1))&&((i10.u17.p74==1)&&(i10.u24.p99==1)))&&(i1.i0.u70.p248==1)) U (i0.u15.p54==1)) * ((i0...384
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(!((!(EG(!((((i10.u5.p24==1)&&(i1.i1.u21.p91==1))&&((i10.u47.p237==1)&&(i10.u72...763
Reverse transition relation is NOT exact ! Due to transitions t19, t28, t30, t39, t86, t95, t184, t189, t191, t198, t203, t205, t231, t239, t263, t271, t27...990
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 206 transition count 464
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 206 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 204 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 204 transition count 462
Applied a total of 52 rules in 25 ms. Remains 204 /230 variables (removed 26) and now considering 462/503 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16986238185481450788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7319301174344657018.kers'
[2026-05-25 09:34:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16986238185481450788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7319301174344657018.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 204 cols 2274 entries
Finished phase 1 with 196 SingleSign rule and 1 generalized
[2026-05-25 09:34:12] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7319301174344657018.kers
Total runtime 4 ms.
[2026-05-25 09:34:12] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-25 09:34:12] [INFO ] Invariant cache hit.
[2026-05-25 09:34:13] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:34:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/666 variables, and 64 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 57/57 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/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 57/64 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 5 (OVERLAPS) 462/666 variables, 204/269 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 411/680 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 680 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60180ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/230 places, 412/503 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60775 ms. Remains : 204/230 places, 412/503 transitions.
[2026-05-25 09:35:13] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:35:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:35:13] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-25 09:35:13] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:35:13] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:35:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5672611915915725206.gal : 2 ms
[2026-05-25 09:35:13] [INFO ] Time to serialize properties into /tmp/CTLFireability11191682727904195252.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/CTLFireability5672611915915725206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11191682727904195252.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 09:35:43] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:35:43] [INFO ] Applying decomposition
[2026-05-25 09:35:43] [INFO ] Flatten gal took : 8 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/graph11474799158700452894.txt' '-o' '/tmp/graph11474799158700452894.bin' '-w' '/tmp/graph11474799158700452894.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11474799158700452894.bin' '-l' '-1' '-v' '-w' '/tmp/graph11474799158700452894.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:35:43] [INFO ] Decomposing Gal with order
[2026-05-25 09:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:35:43] [INFO ] Removed a total of 913 redundant transitions.
[2026-05-25 09:35:43] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 5 ms.
[2026-05-25 09:35:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8637655177155497931.gal : 4 ms
[2026-05-25 09:35:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16086313530846137176.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/CTLFireability8637655177155497931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16086313530846137176.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,3.19397e+07,7.08415,191636,2612,30,416335,501,947,933684,66,1363,0


Converting to forward existential form...Done !
original formula: EG(EX(((i10.i2.u71.p247==1)||((i10.i0.u16.p75==0)&&(i1.u21.p78==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i10.i2.u71.p247==1)||((i10.i0.u16.p75==0)&&(i1.u21.p78==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, t31, t40, t86, t115, t124, t131, t133, t179, t185, t190, t192, t199, t206, t230, t232, t...1071
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 204 transition count 462
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 202 transition count 460
Applied a total of 56 rules in 5 ms. Remains 202 /230 variables (removed 28) and now considering 460/503 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1228737306828728670.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18148419473635830085.kers'
[2026-05-25 09:36:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1228737306828728670.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18148419473635830085.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 460 rows 202 cols 2270 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:36:13] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18148419473635830085.kers
Total runtime 7 ms.
[2026-05-25 09:36:13] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-25 09:36:13] [INFO ] Invariant cache hit.
[2026-05-25 09:36:14] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2026-05-25 09:36:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 53 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 5 (OVERLAPS) 460/662 variables, 202/256 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 409/665 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 665 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60204ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60214ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/230 places, 410/503 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60754 ms. Remains : 202/230 places, 410/503 transitions.
[2026-05-25 09:37:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:37:14] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:37:14] [INFO ] Input system was already deterministic with 410 transitions.
[2026-05-25 09:37:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:37:14] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:37:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8927761472567507217.gal : 2 ms
[2026-05-25 09:37:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7843482743428382031.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/CTLFireability8927761472567507217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7843482743428382031.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 09:37:44] [INFO ] Flatten gal took : 10 ms
[2026-05-25 09:37:44] [INFO ] Applying decomposition
[2026-05-25 09:37:44] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18285098653133910449.txt' '-o' '/tmp/graph18285098653133910449.bin' '-w' '/tmp/graph18285098653133910449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18285098653133910449.bin' '-l' '-1' '-v' '-w' '/tmp/graph18285098653133910449.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:37:44] [INFO ] Decomposing Gal with order
[2026-05-25 09:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:37:44] [INFO ] Removed a total of 922 redundant transitions.
[2026-05-25 09:37:44] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2026-05-25 09:37:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11872475094225194785.gal : 3 ms
[2026-05-25 09:37:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6260821691373621926.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/CTLFireability11872475094225194785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6260821691373621926.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,3.19395e+07,1.31715,47384,2016,33,84073,536,791,189323,77,1332,0


Converting to forward existential form...Done !
original formula: A(A(!(AF((((i0.i1.u11.p68==1)&&(i10.u43.p102==1)) + AF(((i7.u4.p11==1)&&(i7.u50.p188==1)))))) U (!((E((i10.u15.p70==1) U (((i10.u5.p24==1...600
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(E(TRUE U (!(EX(!((i2.i0.u32.p163==1)))) * (((i0.i1.u11.p65==1)&&(i2.i0.u32.p164==1))||(i10...1734
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t39, t96, t135, t183, t188, t190, t197, t202, t204, t229, t237, t261, t269, t275, t...990
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 204 transition count 461
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 204 transition count 461
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 202 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 202 transition count 459
Applied a total of 56 rules in 15 ms. Remains 202 /230 variables (removed 28) and now considering 459/503 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2997569111907728017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18217935433847024931.kers'
[2026-05-25 09:38:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2997569111907728017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18217935433847024931.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 459 rows 202 cols 2268 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:38:14] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18217935433847024931.kers
Total runtime 7 ms.
[2026-05-25 09:38:15] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-25 09:38:15] [INFO ] Invariant cache hit.
[2026-05-25 09:38:15] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 458 sub problems to find dead transitions.
[2026-05-25 09:38:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/661 variables, and 50 constraints, problems are : Problem set: 0 solved, 458 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 458/458 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 458 unsolved
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 4 (OVERLAPS) 459/661 variables, 202/252 constraints. Problems are: Problem set: 50 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 408/660 constraints. Problems are: Problem set: 50 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 660 constraints, problems are : Problem set: 50 solved, 408 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 408/458 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60257ms problems are : Problem set: 50 solved, 408 unsolved
Search for dead transitions found 50 dead transitions in 60258ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/230 places, 409/503 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60682 ms. Remains : 202/230 places, 409/503 transitions.
[2026-05-25 09:39:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:39:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:39:15] [INFO ] Input system was already deterministic with 409 transitions.
[2026-05-25 09:39:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:39:15] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:39:15] [INFO ] Time to serialize gal into /tmp/CTLFireability8767252711707693367.gal : 2 ms
[2026-05-25 09:39:15] [INFO ] Time to serialize properties into /tmp/CTLFireability12442063495076198276.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/CTLFireability8767252711707693367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12442063495076198276.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 09:39:45] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:39:45] [INFO ] Applying decomposition
[2026-05-25 09:39:45] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5782907597324918333.txt' '-o' '/tmp/graph5782907597324918333.bin' '-w' '/tmp/graph5782907597324918333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5782907597324918333.bin' '-l' '-1' '-v' '-w' '/tmp/graph5782907597324918333.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:39:45] [INFO ] Decomposing Gal with order
[2026-05-25 09:39:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:39:45] [INFO ] Removed a total of 915 redundant transitions.
[2026-05-25 09:39:45] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:39:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 5 ms.
[2026-05-25 09:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3776982162732671009.gal : 2 ms
[2026-05-25 09:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability16520435156228571684.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/CTLFireability3776982162732671009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16520435156228571684.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.94267e+07,4.69696,180192,2157,31,363715,629,940,994607,72,1798,0


Converting to forward existential form...Done !
original formula: (!(E(AF(EG(EF((((i10.i2.u9.p47==1)&&(i10.i2.u16.p73==1))&&((i10.i2.u44.p168==1)&&(i10.i2.u69.p246==1)))))) U EF((((i10.i2.u9.p47==1)&&(i0...524
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(EG(!(EG(E(TRUE U (((i10.i2.u9.p47==1)&&(i10.i2.u16.p73==1))&&((i10.i2.u44.p168==1)&&(i10.i2....740
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t39, t57, t101, t105, t123, t160, t182, t189, t196, t201, t228, t229, t236, t237, t...991
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 205 transition count 464
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 205 transition count 464
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 203 transition count 462
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 203 transition count 462
Applied a total of 54 rules in 14 ms. Remains 203 /230 variables (removed 27) and now considering 462/503 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17145188742047842053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17230722891879135703.kers'
[2026-05-25 09:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17145188742047842053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17230722891879135703.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 462 rows 203 cols 2274 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:40:16] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17230722891879135703.kers
Total runtime 18 ms.
[2026-05-25 09:40:16] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 09:40:16] [INFO ] Invariant cache hit.
[2026-05-25 09:40:16] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-25 09:40:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 52 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 45/45 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/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 4 (OVERLAPS) 462/665 variables, 203/255 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 411/666 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 666 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60212ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/230 places, 412/503 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60713 ms. Remains : 203/230 places, 412/503 transitions.
[2026-05-25 09:41:16] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:41:16] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:41:16] [INFO ] Input system was already deterministic with 412 transitions.
[2026-05-25 09:41:16] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:41:16] [INFO ] Flatten gal took : 11 ms
[2026-05-25 09:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12278949471752103585.gal : 2 ms
[2026-05-25 09:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11031132743637946198.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/CTLFireability12278949471752103585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11031132743637946198.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 09:41:46] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:41:46] [INFO ] Applying decomposition
[2026-05-25 09:41:46] [INFO ] Flatten gal took : 7 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/graph16544333590321311144.txt' '-o' '/tmp/graph16544333590321311144.bin' '-w' '/tmp/graph16544333590321311144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16544333590321311144.bin' '-l' '-1' '-v' '-w' '/tmp/graph16544333590321311144.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:41:46] [INFO ] Decomposing Gal with order
[2026-05-25 09:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:41:46] [INFO ] Removed a total of 932 redundant transitions.
[2026-05-25 09:41:46] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2026-05-25 09:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5925107363427669875.gal : 3 ms
[2026-05-25 09:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1927358686979660592.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/CTLFireability5925107363427669875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1927358686979660592.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,3.02223e+07,10.1334,206952,2897,43,132585,413,859,2.07985e+06,78,1049,0


Converting to forward existential form...Done !
original formula: EX(AF((EG(AG((i4.i0.u24.p107==1))) * (AX(((i8.i2.u66.p232==1)||(((i9.u8.p47==1)&&(i1.i0.u19.p91==1))&&((i8.i0.u47.p234==1)&&(i9.u71.p246=...363
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG(!(E(TRUE U !((i4.i0.u24.p107==1))))) * (!(EX(!(((i8.i2.u66.p232==1)||(((i9.u8.p47==1)&&(...499
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t103, t116, t185, t190, t192, t199, t204, t206, t230, t238, t262, t270, t277, t278,...1019
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 208 transition count 469
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 208 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 206 transition count 467
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 206 transition count 467
Applied a total of 48 rules in 39 ms. Remains 206 /230 variables (removed 24) and now considering 467/503 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10569422033477712426.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8607098484978227728.kers'
[2026-05-25 09:42:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10569422033477712426.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8607098484978227728.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 467 rows 206 cols 2284 entries
Finished phase 1 with 198 SingleSign rule and 1 generalized
[2026-05-25 09:42:17] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8607098484978227728.kers
Total runtime 3 ms.
[2026-05-25 09:42:17] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 09:42:17] [INFO ] Invariant cache hit.
[2026-05-25 09:42:17] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2026-05-25 09:42:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 14/41 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/673 variables, and 53 constraints, problems are : Problem set: 0 solved, 466 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 466/466 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 466 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 466 unsolved
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 4 (OVERLAPS) 467/673 variables, 206/259 constraints. Problems are: Problem set: 50 solved, 416 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 416/675 constraints. Problems are: Problem set: 50 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/673 variables, and 675 constraints, problems are : Problem set: 50 solved, 416 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 416/466 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 50 solved, 416 unsolved
Search for dead transitions found 50 dead transitions in 60183ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 206/230 places, 417/503 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60581 ms. Remains : 206/230 places, 417/503 transitions.
[2026-05-25 09:43:17] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:43:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:43:17] [INFO ] Input system was already deterministic with 417 transitions.
[2026-05-25 09:43:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:43:17] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:43:17] [INFO ] Time to serialize gal into /tmp/CTLFireability20053813462310712.gal : 2 ms
[2026-05-25 09:43:17] [INFO ] Time to serialize properties into /tmp/CTLFireability261792396465490518.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/CTLFireability20053813462310712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability261792396465490518.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 -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-25 09:43:47] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:43:47] [INFO ] Applying decomposition
[2026-05-25 09:43:47] [INFO ] Flatten gal took : 8 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/graph295026376343412384.txt' '-o' '/tmp/graph295026376343412384.bin' '-w' '/tmp/graph295026376343412384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph295026376343412384.bin' '-l' '-1' '-v' '-w' '/tmp/graph295026376343412384.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:43:47] [INFO ] Decomposing Gal with order
[2026-05-25 09:43:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:43:47] [INFO ] Removed a total of 945 redundant transitions.
[2026-05-25 09:43:47] [INFO ] Flatten gal took : 29 ms
[2026-05-25 09:43:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 30 ms.
[2026-05-25 09:43:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16862778809052612429.gal : 3 ms
[2026-05-25 09:43:47] [INFO ] Time to serialize properties into /tmp/CTLFireability169806656939182800.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/CTLFireability16862778809052612429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability169806656939182800.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,3.36918e+07,4.03614,155276,2342,36,192563,676,1029,1.22182e+06,73,1952,0


Converting to forward existential form...Done !
original formula: (!(A(E(EX(((((i6.i1.u3.p18==1)&&(i0.u8.p41==1))&&((i1.u13.p60==1)&&(i9.i1.u22.p94==1)))&&(i9.i0.u72.p248==1))) U EF(AX(((((i6.i1.u3.p18==...534
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EG(!((!(!(E(TRUE U !((i6.i0.u54.p190==1))))) * !((E(!((i8.i2.u60.p207==1)) U (!((i4.i1.u30.p...1146
Reverse transition relation is NOT exact ! Due to transitions t17, t20, t51, t60, t87, t90, t99, t101, t106, t188, t204, t209, t235, t236, t243, t244, t267...1226
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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 205 transition count 463
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 205 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 203 transition count 461
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 203 transition count 461
Applied a total of 54 rules in 5 ms. Remains 203 /230 variables (removed 27) and now considering 461/503 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2745508356621610843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18006595146611675163.kers'
[2026-05-25 09:44:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2745508356621610843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18006595146611675163.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 203 cols 2272 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:44:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18006595146611675163.kers
Total runtime 2 ms.
[2026-05-25 09:44:18] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 09:44:18] [INFO ] Invariant cache hit.
[2026-05-25 09:44:18] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-25 09:44:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 53 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (OVERLAPS) 461/664 variables, 203/256 constraints. Problems are: Problem set: 50 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/664 variables, 410/666 constraints. Problems are: Problem set: 50 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 666 constraints, problems are : Problem set: 50 solved, 410 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 410/460 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 50 solved, 410 unsolved
Search for dead transitions found 50 dead transitions in 60169ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/230 places, 411/503 transitions.
Applied a total of 0 rules in 5 ms. Remains 203 /203 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60570 ms. Remains : 203/230 places, 411/503 transitions.
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:45:18] [INFO ] Input system was already deterministic with 411 transitions.
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:45:18] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:45:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11099805950246912493.gal : 2 ms
[2026-05-25 09:45:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2263964094320240378.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/CTLFireability11099805950246912493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2263964094320240378.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 09:45:48] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:45:48] [INFO ] Applying decomposition
[2026-05-25 09:45:48] [INFO ] Flatten gal took : 8 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/graph6285762986320225712.txt' '-o' '/tmp/graph6285762986320225712.bin' '-w' '/tmp/graph6285762986320225712.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6285762986320225712.bin' '-l' '-1' '-v' '-w' '/tmp/graph6285762986320225712.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:45:48] [INFO ] Decomposing Gal with order
[2026-05-25 09:45:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:45:48] [INFO ] Removed a total of 907 redundant transitions.
[2026-05-25 09:45:48] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:45:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2026-05-25 09:45:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17273493878152982159.gal : 3 ms
[2026-05-25 09:45:48] [INFO ] Time to serialize properties into /tmp/CTLFireability14289832312524180608.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/CTLFireability17273493878152982159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14289832312524180608.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,2.99279e+07,9.19521,245668,2798,28,228231,584,838,2.2708e+06,71,1751,0


Converting to forward existential form...Done !
original formula: (EF((EF((((i10.u9.p47==1)&&(i0.i0.u13.p66==1))&&((i6.u68.p234==1)&&(i10.u72.p246==1)))) * AG((i10.u5.p25==1)))) + EG((EG(EF(((i7.u55.p188...213
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * E(TRUE U (((i10.u9.p47==1)&&(i0.i0.u13.p66==1))&&((i6.u68.p234==1)&&(i10.u72.p246==1))))) ...319
Reverse transition relation is NOT exact ! Due to transitions t19, t28, t35, t48, t77, t95, t102, t106, t184, t189, t191, t198, t203, t205, t231, t239, t25...1037
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 204 transition count 462
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 204 transition count 462
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 202 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 202 transition count 460
Applied a total of 56 rules in 5 ms. Remains 202 /230 variables (removed 28) and now considering 460/503 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5244419754098315871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-908358890688646870.kers'
[2026-05-25 09:46:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5244419754098315871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-908358890688646870.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 460 rows 202 cols 2270 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:46:18] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-908358890688646870.kers
Total runtime 9 ms.
[2026-05-25 09:46:19] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 09:46:19] [INFO ] Invariant cache hit.
[2026-05-25 09:46:19] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2026-05-25 09:46:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 11/38 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/662 variables, and 53 constraints, problems are : Problem set: 0 solved, 459 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 459/459 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 459 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 459 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 4 (OVERLAPS) 460/662 variables, 202/255 constraints. Problems are: Problem set: 50 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 409/664 constraints. Problems are: Problem set: 50 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 664 constraints, problems are : Problem set: 50 solved, 409 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/459 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60243ms problems are : Problem set: 50 solved, 409 unsolved
Search for dead transitions found 50 dead transitions in 60244ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 202/230 places, 410/503 transitions.
Applied a total of 0 rules in 2 ms. Remains 202 /202 variables (removed 0) and now considering 410/410 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60724 ms. Remains : 202/230 places, 410/503 transitions.
[2026-05-25 09:47:19] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:47:19] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:47:19] [INFO ] Input system was already deterministic with 410 transitions.
[2026-05-25 09:47:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:47:19] [INFO ] Flatten gal took : 6 ms
[2026-05-25 09:47:19] [INFO ] Time to serialize gal into /tmp/CTLFireability5056835424965817804.gal : 2 ms
[2026-05-25 09:47:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12251136645571469231.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/CTLFireability5056835424965817804.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12251136645571469231.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 09:47:49] [INFO ] Flatten gal took : 21 ms
[2026-05-25 09:47:49] [INFO ] Applying decomposition
[2026-05-25 09:47:49] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8161711041127743286.txt' '-o' '/tmp/graph8161711041127743286.bin' '-w' '/tmp/graph8161711041127743286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8161711041127743286.bin' '-l' '-1' '-v' '-w' '/tmp/graph8161711041127743286.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:47:49] [INFO ] Decomposing Gal with order
[2026-05-25 09:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:47:49] [INFO ] Removed a total of 927 redundant transitions.
[2026-05-25 09:47:49] [INFO ] Flatten gal took : 38 ms
[2026-05-25 09:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 13 ms.
[2026-05-25 09:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13415979882964285261.gal : 4 ms
[2026-05-25 09:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability6243031395244917719.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/CTLFireability13415979882964285261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6243031395244917719.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 207 transition count 467
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 207 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 205 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 205 transition count 465
Applied a total of 50 rules in 12 ms. Remains 205 /230 variables (removed 25) and now considering 465/503 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1296106217900091816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5346212815044227121.kers'
[2026-05-25 09:48:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1296106217900091816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5346212815044227121.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 205 cols 2280 entries
Finished phase 1 with 197 SingleSign rule and 1 generalized
[2026-05-25 09:48:20] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5346212815044227121.kers
Total runtime 3 ms.
[2026-05-25 09:48:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 09:48:20] [INFO ] Invariant cache hit.
[2026-05-25 09:48:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-25 09:48:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 205/670 variables, and 54 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/205 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 47/54 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 8 (OVERLAPS) 465/670 variables, 205/274 constraints. Problems are: Problem set: 50 solved, 414 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 414/688 constraints. Problems are: Problem set: 50 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 688 constraints, problems are : Problem set: 50 solved, 414 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 414/464 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60203ms problems are : Problem set: 50 solved, 414 unsolved
Search for dead transitions found 50 dead transitions in 60204ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/230 places, 415/503 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60644 ms. Remains : 205/230 places, 415/503 transitions.
[2026-05-25 09:49:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:49:20] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:49:20] [INFO ] Input system was already deterministic with 415 transitions.
[2026-05-25 09:49:20] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:49:20] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:49:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14848419723518960165.gal : 2 ms
[2026-05-25 09:49:20] [INFO ] Time to serialize properties into /tmp/CTLFireability995309704340192595.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/CTLFireability14848419723518960165.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability995309704340192595.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 09:49:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 09:49:50] [INFO ] Applying decomposition
[2026-05-25 09:49:50] [INFO ] Flatten gal took : 7 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/graph10245431532548750958.txt' '-o' '/tmp/graph10245431532548750958.bin' '-w' '/tmp/graph10245431532548750958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10245431532548750958.bin' '-l' '-1' '-v' '-w' '/tmp/graph10245431532548750958.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:49:50] [INFO ] Decomposing Gal with order
[2026-05-25 09:49:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:49:50] [INFO ] Removed a total of 929 redundant transitions.
[2026-05-25 09:49:50] [INFO ] Flatten gal took : 17 ms
[2026-05-25 09:49:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2026-05-25 09:49:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9224752572189191156.gal : 2 ms
[2026-05-25 09:49:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10582001970616754420.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/CTLFireability9224752572189191156.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10582001970616754420.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,3.28595e+07,5.23262,128492,2517,37,131478,362,935,1.12093e+06,69,920,0


Converting to forward existential form...Done !
original formula: AF((((i6.i1.u54.p193==1) + AX(E(AX(((i5.i1.u4.p11==1)&&(i2.i1.u40.p139==1))) U EX((((i8.i0.u6.p42==1)&&(i8.i0.u16.p73==1))&&((i8.i0.u71.p...795
=> equivalent forward existential formula: [FwdG(Init,!((((i6.i1.u54.p193==1) + !(EX(!(E(!(EX(!(((i5.i1.u4.p11==1)&&(i2.i1.u40.p139==1))))) U EX((((i8.i0.u...929
Reverse transition relation is NOT exact ! Due to transitions t51, t67, t108, t188, t193, t202, t207, t232, t235, t240, t243, t264, t267, t272, t275, t290,...1125
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 203 transition count 460
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 203 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 201 transition count 458
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 201 transition count 458
Applied a total of 58 rules in 25 ms. Remains 201 /230 variables (removed 29) and now considering 458/503 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14729353480765209334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4927576143446987351.kers'
[2026-05-25 09:50:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14729353480765209334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4927576143446987351.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 458 rows 201 cols 2266 entries
Finished phase 1 with 193 SingleSign rule and 1 generalized
[2026-05-25 09:50:20] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4927576143446987351.kers
Total runtime 2 ms.
[2026-05-25 09:50:21] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 09:50:21] [INFO ] Invariant cache hit.
[2026-05-25 09:50:21] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 201/230 places, 458/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 201/230 places, 458/503 transitions.
[2026-05-25 09:50:21] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:50:21] [INFO ] Flatten gal took : 8 ms
[2026-05-25 09:50:21] [INFO ] Input system was already deterministic with 458 transitions.
[2026-05-25 09:50:21] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:50:21] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13534416787035957011.gal : 3 ms
[2026-05-25 09:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4782960498166343635.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/CTLFireability13534416787035957011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4782960498166343635.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 09:50:51] [INFO ] Flatten gal took : 9 ms
[2026-05-25 09:50:51] [INFO ] Applying decomposition
[2026-05-25 09:50:51] [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/graph7176159546738436904.txt' '-o' '/tmp/graph7176159546738436904.bin' '-w' '/tmp/graph7176159546738436904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7176159546738436904.bin' '-l' '-1' '-v' '-w' '/tmp/graph7176159546738436904.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:50:51] [INFO ] Decomposing Gal with order
[2026-05-25 09:50:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:50:51] [INFO ] Removed a total of 1311 redundant transitions.
[2026-05-25 09:50:51] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:50:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 27 ms.
[2026-05-25 09:50:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4235045322741620381.gal : 3 ms
[2026-05-25 09:50:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17420692399092551500.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/CTLFireability4235045322741620381.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17420692399092551500.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.94267e+07,3.28598,93624,2550,24,73579,320,1145,742092,60,929,0


Converting to forward existential form...Done !
original formula: (!(A(AG((i6.i1.u65.p225!=1)) U ((i0.u3.p13==1)&&(i8.i2.u46.p174==1)))) * EX((EF(EG((i5.i0.u44.p161==1))) * !(E(AF(((i2.i1.u19.p81==1)&&(i...205
=> equivalent forward existential formula: [((EY((Init * !(!((E(!(((i0.u3.p13==1)&&(i8.i2.u46.p174==1))) U (!(!(E(TRUE U !((i6.i1.u65.p225!=1))))) * !(((i0...377
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t39, t85, t105, t159, t175, t186, t188, t190, t202, t204, t228, t236, t260, t268, t...1028
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 230/230 places, 503/503 transitions.
Graph (trivial) has 224 edges and 230 vertex of which 8 / 230 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 223 transition count 448
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 101 place count 175 transition count 444
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 173 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 171 transition count 442
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 107 place count 171 transition count 432
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 127 place count 161 transition count 432
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 151 place count 137 transition count 390
Iterating global reduction 4 with 24 rules applied. Total rules applied 175 place count 137 transition count 390
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 137 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 177 place count 136 transition count 389
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 177 place count 136 transition count 386
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 183 place count 133 transition count 386
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 186 place count 130 transition count 366
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 130 transition count 366
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 129 transition count 364
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 129 transition count 364
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 221 place count 114 transition count 349
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 223 place count 112 transition count 345
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 112 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 235 place count 112 transition count 335
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 235 place count 112 transition count 333
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 239 place count 110 transition count 333
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 247 place count 106 transition count 329
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 248 place count 105 transition count 325
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 105 transition count 325
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 104 transition count 323
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 104 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 103 transition count 322
Applied a total of 252 rules in 126 ms. Remains 103 /230 variables (removed 127) and now considering 322/503 (removed 181) transitions.
[2026-05-25 09:51:21] [INFO ] Flow matrix only has 321 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3103240306443502993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14293018557864889066.kers'
[2026-05-25 09:51:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3103240306443502993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14293018557864889066.kers]
Normalized transition count is 320 out of 321 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 320 rows 103 cols 1708 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 09:51:21] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-14293018557864889066.kers
Total runtime 11 ms.
[2026-05-25 09:51:22] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 09:51:22] [INFO ] Flow matrix only has 321 transitions (discarded 1 similar events)
[2026-05-25 09:51:22] [INFO ] Invariant cache hit.
[2026-05-25 09:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:51:22] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2026-05-25 09:51:22] [INFO ] Redundant transitions in 6 ms returned []
Running 317 sub problems to find dead transitions.
[2026-05-25 09:51:22] [INFO ] Flow matrix only has 321 transitions (discarded 1 similar events)
[2026-05-25 09:51:22] [INFO ] Invariant cache hit.
[2026-05-25 09:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 3/103 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 320/423 variables, 103/128 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 9 (OVERLAPS) 1/424 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 129 constraints, problems are : Problem set: 0 solved, 317 unsolved in 29461 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (OVERLAPS) 3/103 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
At refinement iteration 6 (OVERLAPS) 320/423 variables, 103/128 constraints. Problems are: Problem set: 42 solved, 275 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 275/403 constraints. Problems are: Problem set: 42 solved, 275 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 2/405 constraints. Problems are: Problem set: 42 solved, 275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/424 variables, and 407 constraints, problems are : Problem set: 42 solved, 275 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 103/103 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 275/317 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59592ms problems are : Problem set: 42 solved, 275 unsolved
Search for dead transitions found 42 dead transitions in 59594ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 103/230 places, 280/503 transitions.
Applied a total of 0 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2026-05-25 09:52:21] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60178 ms. Remains : 103/230 places, 280/503 transitions.
[2026-05-25 09:52:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:52:21] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:52:22] [INFO ] Input system was already deterministic with 280 transitions.
[2026-05-25 09:52:22] [INFO ] Flatten gal took : 4 ms
[2026-05-25 09:52:22] [INFO ] Flatten gal took : 5 ms
[2026-05-25 09:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14051416468915340473.gal : 1 ms
[2026-05-25 09:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2862295859724361823.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/CTLFireability14051416468915340473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2862295859724361823.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6183e+06,16.4064,432812,2,41535,5,1.01944e+06,6,0,693,1.05232e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-25 09:52:52] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:52:52] [INFO ] Applying decomposition
[2026-05-25 09:52:52] [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/graph8488693251353425155.txt' '-o' '/tmp/graph8488693251353425155.bin' '-w' '/tmp/graph8488693251353425155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8488693251353425155.bin' '-l' '-1' '-v' '-w' '/tmp/graph8488693251353425155.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:52:52] [INFO ] Decomposing Gal with order
[2026-05-25 09:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:52:52] [INFO ] Removed a total of 776 redundant transitions.
[2026-05-25 09:52:52] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2026-05-25 09:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5002624825153272475.gal : 2 ms
[2026-05-25 09:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13269187406927517863.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/CTLFireability5002624825153272475.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13269187406927517863.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.6183e+06,0.997813,33008,1984,25,53653,285,610,124264,55,936,0


Converting to forward existential form...Done !
original formula: AF(!(E(!((((i2.u3.p19==1)&&(i2.u18.p98==1))&&((i2.u37.p237==1)&&(i2.u38.p246==1)))) U (E((i0.u0.p7==1) U (i4.u26.p155==1)) + A(((i7.u2.p1...274
=> equivalent forward existential formula: [FwdG(Init,!(!(E(!((((i2.u3.p19==1)&&(i2.u18.p98==1))&&((i2.u37.p237==1)&&(i2.u38.p246==1)))) U (E((i0.u0.p7==1)...522
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t32, t38, t42, t52, t70, t72, t79, t84, t86, t89, t90, t91, t93, t94, t95, t96, t12...705
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
Detected timeout of ITS tools.
[2026-05-25 09:53:22] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:53:22] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:53:22] [INFO ] Applying decomposition
[2026-05-25 09:53:22] [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/graph5345715140609275185.txt' '-o' '/tmp/graph5345715140609275185.bin' '-w' '/tmp/graph5345715140609275185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5345715140609275185.bin' '-l' '-1' '-v' '-w' '/tmp/graph5345715140609275185.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:53:22] [INFO ] Decomposing Gal with order
[2026-05-25 09:53:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:53:22] [INFO ] Removed a total of 1282 redundant transitions.
[2026-05-25 09:53:22] [INFO ] Flatten gal took : 20 ms
[2026-05-25 09:53:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 6 ms.
[2026-05-25 09:53:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9785474402337515929.gal : 2 ms
[2026-05-25 09:53:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1126590507418066702.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/CTLFireability9785474402337515929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1126590507418066702.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 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29537e+07,3.8407,116268,3820,175,130045,1449,1151,799911,109,6832,0


Converting to forward existential form...Done !
original formula: EG(AF(AX((i5.i2.u33.p132==0))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(EX(!((i5.i2.u33.p132==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t19, t47, t66, t88, t94, t116, t129, t216, t227, t249, t271, t273, t279, t281, t303, t305, t3...1654
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 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
(forward)formula 0,1,71.2307,1532564,1,0,1.58881e+06,3019,8084,1.12973e+07,566,18042,3836668
FORMULA MedleyA-PT-18-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((A(((i6.i0.u27.p109==1) + AF((i10.i1.u66.p222==1))) U A(((((i0.i0.u5.p25==1)&&(i1.u8.p41==1))&&((i3.u12.p58==1)&&(i0.i0.u22.p99==1)))&&...466
=> equivalent forward existential formula: [((Init * !(EG(!((!((!(EX(!(!((E(!((i4.i1.u37.p140==1)) U (!((((i7.u2.p19==1)&&(i2.i1.u16.p73==1))&&((i6.i1.u43....1588
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 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
(forward)formula 1,0,480.32,2796052,1,0,2.82505e+06,3607,3488,2.15153e+07,282,20371,2687137
FORMULA MedleyA-PT-18-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(EX(((A((i7.u3.p10!=1) U EF((i0.i0.u9.p48==1))) + (i7.u2.p6==1)) + (((i0.i0.u9.p47==1)&&(i0.i0.u22.p98==1))&&((i6.i1.u43.p165==1)&&(i2....175
=> equivalent forward existential formula: [FwdG(Init,EX(((!((E(!(E(TRUE U (i0.i0.u9.p48==1))) U (!((i7.u3.p10!=1)) * !(E(TRUE U (i0.i0.u9.p48==1))))) + EG...307
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
(forward)formula 2,1,604.061,3076364,1,0,2.82505e+06,3607,2757,2.34654e+07,221,20371,3107158
FORMULA MedleyA-PT-18-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((AF((A(((((i7.u4.p18==1)&&(i1.u8.p41==1))&&((i2.i1.u16.p74==1)&&(i0.i0.u22.p99==1)))&&(i0.i0.u76.p248==1)) U (i3.u14.p54==1)) * ((i3.u...394
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!((E(!(!((!(EG(!((((i0.i0.u5.p24==1)&&(i0.i1.u19.p91==1))&&((i2.i1.u73.p237==1)&&(i2....785
(forward)formula 3,1,759.449,3715164,1,0,3.01968e+06,3607,3547,3.073e+07,271,20371,1925343
FORMULA MedleyA-PT-18-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX(((i0.i0.u76.p247==1)||((i2.i1.u10.p75==0)&&(i0.i1.u19.p78==0)))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i0.i0.u76.p247==1)||((i2.i1.u10.p75==0)&&(i0.i1.u19.p78==0)))))] != FALSE
(forward)formula 4,1,802.368,3715164,1,0,3.01968e+06,3607,4328,3.073e+07,292,20371,4341597
FORMULA MedleyA-PT-18-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(A(!(AF((((i3.u14.p68==1)&&(i2.i1.u46.p102==1)) + AF(((i7.u3.p11==1)&&(i8.i0.u54.p188==1)))))) U (!((E((i2.i1.u15.p70==1) U (((i0.i0.u5....626
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(E(TRUE U (!(EX(!((i6.i1.u43.p163==1)))) * (((i3.u14.p65==1)&&(i6.i1.u44.p164==1))||(i0.i0....1808
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
ITS-tools command line returned an error code 139
[2026-05-25 10:08:52] [INFO ] Applying decomposition
[2026-05-25 10:08:52] [INFO ] Flatten gal took : 34 ms
[2026-05-25 10:08:52] [INFO ] Decomposing Gal with order
[2026-05-25 10:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:08:52] [INFO ] Removed a total of 839 redundant transitions.
[2026-05-25 10:08:52] [INFO ] Flatten gal took : 19 ms
[2026-05-25 10:08:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 202 labels/synchronizations in 4 ms.
[2026-05-25 10:08:53] [INFO ] Time to serialize gal into /tmp/CTLFireability5568160713020668222.gal : 2 ms
[2026-05-25 10:08:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17864804470995907090.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/CTLFireability5568160713020668222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17864804470995907090.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.29537e+07,2.68271,93416,1464,3470,63003,80042,273,332012,580,827290,0


Converting to forward existential form...Done !
original formula: A(A(!(AF((((i0.i0.i1.u7.p68==1)&&(i0.i1.u10.p102==1)) + AF(((i0.i0.i0.u4.p11==1)&&(i0.i1.u11.p188==1)))))) U (!((E((i0.i0.i1.u7.p70==1) U...654
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(E(TRUE U (!(EX(!((i0.i1.u10.p163==1)))) * (((i0.i0.i1.u7.p65==1)&&(i0.i1.u10.p164==1))||(i...1870
Reverse transition relation is NOT exact ! Due to transitions t271, t334, t335, u12.t1, u12.t3, u12.t5, i0.t499, i0.t467, i0.t460, i0.i0.i0.u4.t228, i0.i0....2173
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-18"
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-18, 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-177969020000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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