Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000242.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BART-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000242
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 710K Mar 5 09:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Mar 5 09:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 463K Mar 5 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Mar 5 09:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 281K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 752K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 352K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 950K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Mar 5 09:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.4M Mar 5 09:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 821K Mar 5 09:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Mar 5 09:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.4M 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 BART-PT-010-CTLFireability-2024-00
FORMULA_NAME BART-PT-010-CTLFireability-2024-01
FORMULA_NAME BART-PT-010-CTLFireability-2024-02
FORMULA_NAME BART-PT-010-CTLFireability-2024-03
FORMULA_NAME BART-PT-010-CTLFireability-2024-04
FORMULA_NAME BART-PT-010-CTLFireability-2024-05
FORMULA_NAME BART-PT-010-CTLFireability-2024-06
FORMULA_NAME BART-PT-010-CTLFireability-2024-07
FORMULA_NAME BART-PT-010-CTLFireability-2024-08
FORMULA_NAME BART-PT-010-CTLFireability-2024-09
FORMULA_NAME BART-PT-010-CTLFireability-2024-10
FORMULA_NAME BART-PT-010-CTLFireability-2024-11
FORMULA_NAME BART-PT-010-CTLFireability-2024-12
FORMULA_NAME BART-PT-010-CTLFireability-2024-13
FORMULA_NAME BART-PT-010-CTLFireability-2024-14
FORMULA_NAME BART-PT-010-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779550708063

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 15:38:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 15:38:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:38:31] [INFO ] Load time of PNML (sax parser for PT used): 593 ms
[2026-05-23 15:38:31] [INFO ] Transformed 1530 places.
[2026-05-23 15:38:31] [INFO ] Transformed 2020 transitions.
[2026-05-23 15:38:31] [INFO ] Found NUPN structural information;
[2026-05-23 15:38:31] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 800 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 130 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 37 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1196513672724012098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5556413770331259605.kers'
[2026-05-23 15:38:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1196513672724012098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5556413770331259605.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2020 rows 1320 cols 4040 entries
Finished phase 1 with 1310 SingleSign rule and 0 generalized
[2026-05-23 15:38:31] [INFO ] Computed 10 invariants in 10 ms
Computed 10 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-5556413770331259605.kers
Total runtime 14 ms.
[2026-05-23 15:38:32] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2026-05-23 15:38:32] [INFO ] Invariant cache hit.
[2026-05-23 15:38:35] [INFO ] Implicit Places using invariants and state equation in 2135 ms returned []
Implicit Place search using SMT with State Equation took 3310 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:38:35] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30130 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30094 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61154ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 61195ms
Finished structural reductions in LTL mode , in 1 iterations and 64607 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 19 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:39:36] [INFO ] Invariant cache hit.
[2026-05-23 15:39:36] [INFO ] Implicit Places using invariants in 632 ms returned []
[2026-05-23 15:39:36] [INFO ] Invariant cache hit.
[2026-05-23 15:39:38] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2135 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2156 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2026-05-23 15:39:39] [INFO ] Flatten gal took : 257 ms
[2026-05-23 15:39:39] [INFO ] Flatten gal took : 163 ms
[2026-05-23 15:39:40] [INFO ] Input system was already deterministic with 2020 transitions.
Reduction of identical properties reduced properties to check from 51 to 44
RANDOM walk for 40000 steps (8 resets) in 2371 ms. (16 steps per ms) remains 2/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/2 properties
BEST_FIRST walk for 38840 steps (8 resets) in 206 ms. (187 steps per ms) remains 0/1 properties
[2026-05-23 15:39:41] [INFO ] Flatten gal took : 107 ms
[2026-05-23 15:39:41] [INFO ] Flatten gal took : 136 ms
[2026-05-23 15:39:41] [INFO ] Input system was already deterministic with 2020 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Performed 230 Post agglomeration using F-continuation condition.Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1320 transition count 1790
Reduce places removed 230 places and 0 transitions.
Iterating post reduction 1 with 230 rules applied. Total rules applied 460 place count 1090 transition count 1790
Applied a total of 460 rules in 213 ms. Remains 1090 /1320 variables (removed 230) and now considering 1790/2020 (removed 230) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14809004547683474051.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7304956660520760672.kers'
[2026-05-23 15:39:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14809004547683474051.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7304956660520760672.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1790 rows 1090 cols 3580 entries
Finished phase 1 with 1080 SingleSign rule and 0 generalized
[2026-05-23 15:39:42] [INFO ] Computed 10 invariants in 10 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7304956660520760672.kers
Total runtime 12 ms.
[2026-05-23 15:39:42] [INFO ] Implicit Places using invariants in 444 ms returned []
[2026-05-23 15:39:42] [INFO ] Invariant cache hit.
[2026-05-23 15:39:43] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2026-05-23 15:39:44] [INFO ] Redundant transitions in 181 ms returned []
Running 1430 sub problems to find dead transitions.
[2026-05-23 15:39:44] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 1080/1080 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1080/2880 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1430 unsolved in 30041 ms.
Refiners :[Domain max(s): 1080/1090 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1090 constraints, PredecessorRefiner: 1430/1430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1080 variables, 1080/1080 constraints. Problems are: Problem set: 0 solved, 1430 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1080/2880 variables, and 1080 constraints, problems are : Problem set: 0 solved, 1430 unsolved in 30050 ms.
Refiners :[Domain max(s): 1080/1090 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1090 constraints, PredecessorRefiner: 0/1430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 1430 unsolved
Search for dead transitions found 0 dead transitions in 60557ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1090/1320 places, 1790/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62836 ms. Remains : 1090/1320 places, 1790/2020 transitions.
[2026-05-23 15:40:44] [INFO ] Flatten gal took : 62 ms
[2026-05-23 15:40:44] [INFO ] Flatten gal took : 71 ms
[2026-05-23 15:40:45] [INFO ] Input system was already deterministic with 1790 transitions.
[2026-05-23 15:40:45] [INFO ] Flatten gal took : 63 ms
[2026-05-23 15:40:45] [INFO ] Flatten gal took : 60 ms
[2026-05-23 15:40:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4595633703216351453.gal : 27 ms
[2026-05-23 15:40:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3827498280206179773.ctl : 25 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/CTLFireability4595633703216351453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3827498280206179773.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-23 15:41:15] [INFO ] Flatten gal took : 67 ms
[2026-05-23 15:41:15] [INFO ] Applying decomposition
[2026-05-23 15:41:15] [INFO ] Flatten gal took : 64 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/graph12526741847713433525.txt' '-o' '/tmp/graph12526741847713433525.bin' '-w' '/tmp/graph12526741847713433525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12526741847713433525.bin' '-l' '-1' '-v' '-w' '/tmp/graph12526741847713433525.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:41:16] [INFO ] Decomposing Gal with order
[2026-05-23 15:41:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:41:16] [INFO ] Removed a total of 108 redundant transitions.
[2026-05-23 15:41:16] [INFO ] Flatten gal took : 318 ms
[2026-05-23 15:41:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2026-05-23 15:41:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3417651908010029312.gal : 31 ms
[2026-05-23 15:41:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8210910274625344530.ctl : 11 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/CTLFireability3417651908010029312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8210910274625344530.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.36736e+20,0.529235,14944,543,75,8108,3070,1498,7440,252,2188,0


Converting to forward existential form...Done !
original formula: AF(!(A((((((((((((i1.u25.TrainState_1_1_33==1)||(i3.u237.TrainState_7_4_22==1))||((i1.u25.TrainState_1_1_17==1)||(i9.u344.TrainState_10_1...79034
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((((((((((((i9.u344.TrainState_10_0_0==1)||(i5.i0.u27.TrainState_5_0_0==1))||((i8.i0.u342....191591
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 : 1320/1320 places, 2020/2020 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 1230 transition count 1930
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 1230 transition count 1930
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 240 place count 1170 transition count 1870
Iterating global reduction 0 with 60 rules applied. Total rules applied 300 place count 1170 transition count 1870
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 330 place count 1140 transition count 1840
Iterating global reduction 0 with 30 rules applied. Total rules applied 360 place count 1140 transition count 1840
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 390 place count 1110 transition count 1810
Iterating global reduction 0 with 30 rules applied. Total rules applied 420 place count 1110 transition count 1810
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 450 place count 1080 transition count 1780
Iterating global reduction 0 with 30 rules applied. Total rules applied 480 place count 1080 transition count 1780
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 510 place count 1050 transition count 1750
Iterating global reduction 0 with 30 rules applied. Total rules applied 540 place count 1050 transition count 1750
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 560 place count 1030 transition count 1730
Iterating global reduction 0 with 20 rules applied. Total rules applied 580 place count 1030 transition count 1730
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 600 place count 1010 transition count 1710
Iterating global reduction 0 with 20 rules applied. Total rules applied 620 place count 1010 transition count 1710
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 630 place count 1000 transition count 1700
Iterating global reduction 0 with 10 rules applied. Total rules applied 640 place count 1000 transition count 1700
Applied a total of 640 rules in 189 ms. Remains 1000 /1320 variables (removed 320) and now considering 1700/2020 (removed 320) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7315299943483385973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13773330871605409977.kers'
[2026-05-23 15:41:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7315299943483385973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13773330871605409977.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1700 rows 1000 cols 3400 entries
Finished phase 1 with 990 SingleSign rule and 0 generalized
[2026-05-23 15:41:47] [INFO ] Computed 10 invariants in 14 ms
Computed 10 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-13773330871605409977.kers
Total runtime 17 ms.
[2026-05-23 15:41:47] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-23 15:41:47] [INFO ] Invariant cache hit.
[2026-05-23 15:41:48] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
Running 1340 sub problems to find dead transitions.
[2026-05-23 15:41:48] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1340/1340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1340 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 990/2700 variables, and 0 constraints, problems are : Problem set: 0 solved, 1340 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1340 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60488ms problems are : Problem set: 0 solved, 1340 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1320 places, 1700/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62031 ms. Remains : 1000/1320 places, 1700/2020 transitions.
[2026-05-23 15:42:49] [INFO ] Flatten gal took : 62 ms
[2026-05-23 15:42:49] [INFO ] Flatten gal took : 74 ms
[2026-05-23 15:42:49] [INFO ] Input system was already deterministic with 1700 transitions.
[2026-05-23 15:42:49] [INFO ] Flatten gal took : 47 ms
[2026-05-23 15:42:49] [INFO ] Flatten gal took : 47 ms
[2026-05-23 15:42:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5465301276358149601.gal : 13 ms
[2026-05-23 15:42:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10273973929803885733.ctl : 11 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/CTLFireability5465301276358149601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10273973929803885733.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-23 15:43:19] [INFO ] Flatten gal took : 47 ms
[2026-05-23 15:43:19] [INFO ] Applying decomposition
[2026-05-23 15:43:19] [INFO ] Flatten gal took : 41 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/graph8222522710975232274.txt' '-o' '/tmp/graph8222522710975232274.bin' '-w' '/tmp/graph8222522710975232274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8222522710975232274.bin' '-l' '-1' '-v' '-w' '/tmp/graph8222522710975232274.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:43:19] [INFO ] Decomposing Gal with order
[2026-05-23 15:43:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:43:20] [INFO ] Removed a total of 324 redundant transitions.
[2026-05-23 15:43:20] [INFO ] Flatten gal took : 190 ms
[2026-05-23 15:43:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 30 ms.
[2026-05-23 15:43:20] [INFO ] Time to serialize gal into /tmp/CTLFireability503541116262835003.gal : 13 ms
[2026-05-23 15:43:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2552936955764368209.ctl : 6 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/CTLFireability503541116262835003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2552936955764368209.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1e+20,0.466523,14348,351,91,6256,10149,1433,6267,479,14522,0


Converting to forward existential form...Done !
original formula: AG((((((i0.i0.u23.TrainState_10_0_0==1)||(i3.i0.u18.TrainState_5_0_0==1))||((i7.i0.u60.TrainState_6_0_0==1)||(i2.i0.u16.TrainState_1_0_0=...65468
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((((i0.i0.u23.TrainState_10_0_0==1)||(i3.i0.u18.TrainState_5_0_0==1))||((i7.i0.u60.Trai...67499
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.997452,26180,1,0,28839,16971,10846,69952,2415,31948,62855
FORMULA BART-PT-010-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 260 edges and 1320 vertex of which 60 / 1320 are part of one of the 10 SCC in 11 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 1270 transition count 1890
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 161 place count 1190 transition count 1890
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 401 place count 1070 transition count 1770
Applied a total of 401 rules in 133 ms. Remains 1070 /1320 variables (removed 250) and now considering 1770/2020 (removed 250) transitions.
[2026-05-23 15:43:21] [INFO ] Flow matrix only has 1761 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14208795929017283628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8214702909076928732.kers'
[2026-05-23 15:43:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14208795929017283628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8214702909076928732.kers]
Normalized transition count is 1760 out of 1761 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1760 rows 1070 cols 3520 entries
Finished phase 1 with 1060 SingleSign rule and 0 generalized
[2026-05-23 15:43:21] [INFO ] Computed 10 invariants in 14 ms
Computed 10 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-8214702909076928732.kers
Total runtime 16 ms.
[2026-05-23 15:43:22] [INFO ] Implicit Places using invariants in 447 ms returned []
[2026-05-23 15:43:22] [INFO ] Flow matrix only has 1761 transitions (discarded 9 similar events)
[2026-05-23 15:43:22] [INFO ] Invariant cache hit.
[2026-05-23 15:43:23] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1603 ms to find 0 implicit places.
[2026-05-23 15:43:23] [INFO ] Redundant transitions in 191 ms returned []
Running 1410 sub problems to find dead transitions.
[2026-05-23 15:43:23] [INFO ] Flow matrix only has 1761 transitions (discarded 9 similar events)
[2026-05-23 15:43:23] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 1060/1060 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1060/2831 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30053 ms.
Refiners :[Domain max(s): 1060/1070 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1070 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1060 variables, 1060/1060 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2831 variables, and 1060 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30055 ms.
Refiners :[Domain max(s): 1060/1070 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1070 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60579ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 60585ms
Starting structural reductions in SI_CTL mode, iteration 1 : 1070/1320 places, 1770/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62528 ms. Remains : 1070/1320 places, 1770/2020 transitions.
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 39 ms
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 43 ms
[2026-05-23 15:44:24] [INFO ] Input system was already deterministic with 1770 transitions.
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 44 ms
[2026-05-23 15:44:24] [INFO ] Flatten gal took : 46 ms
[2026-05-23 15:44:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9119410147228186877.gal : 11 ms
[2026-05-23 15:44:24] [INFO ] Time to serialize properties into /tmp/CTLFireability830376611312916857.ctl : 5 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/CTLFireability9119410147228186877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability830376611312916857.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.96715e+20,2.20489,19756,2,2131,5,23944,6,0,6043,16693,0


Converting to forward existential form...Done !
original formula: !(A(!((((((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==1)||(TrainState_6_3_7==1)))||(((TrainState_5_4_11==1)|...52801
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !(E(((((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==...149293
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 1530/0/240
(forward)formula 0,1,24.4172,291084,1,0,19,1.87266e+06,32,6,34001,492064,23
FORMULA BART-PT-010-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 8 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-60872719804809404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10239440814257118502.kers'
[2026-05-23 15:44:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-60872719804809404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10239440814257118502.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2020 rows 1320 cols 4040 entries
Finished phase 1 with 1310 SingleSign rule and 0 generalized
[2026-05-23 15:44:49] [INFO ] Computed 10 invariants in 9 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-10239440814257118502.kers
Total runtime 12 ms.
[2026-05-23 15:44:49] [INFO ] Implicit Places using invariants in 457 ms returned []
[2026-05-23 15:44:49] [INFO ] Invariant cache hit.
[2026-05-23 15:44:51] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:44:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30065 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30059 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60640ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Finished structural reductions in LTL mode , in 1 iterations and 62753 ms. Remains : 1320/1320 places, 2020/2020 transitions.
[2026-05-23 15:45:52] [INFO ] Flatten gal took : 47 ms
[2026-05-23 15:45:52] [INFO ] Flatten gal took : 52 ms
[2026-05-23 15:45:52] [INFO ] Input system was already deterministic with 2020 transitions.
[2026-05-23 15:45:52] [INFO ] Flatten gal took : 49 ms
[2026-05-23 15:45:52] [INFO ] Flatten gal took : 49 ms
[2026-05-23 15:45:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5239775573591750563.gal : 12 ms
[2026-05-23 15:45:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16325521859282395540.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/CTLFireability5239775573591750563.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16325521859282395540.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-23 15:46:22] [INFO ] Flatten gal took : 47 ms
[2026-05-23 15:46:22] [INFO ] Applying decomposition
[2026-05-23 15:46:22] [INFO ] Flatten gal took : 47 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/graph16758960717424635686.txt' '-o' '/tmp/graph16758960717424635686.bin' '-w' '/tmp/graph16758960717424635686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16758960717424635686.bin' '-l' '-1' '-v' '-w' '/tmp/graph16758960717424635686.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:46:22] [INFO ] Decomposing Gal with order
[2026-05-23 15:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:46:23] [INFO ] Removed a total of 175 redundant transitions.
[2026-05-23 15:46:23] [INFO ] Flatten gal took : 136 ms
[2026-05-23 15:46:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2026-05-23 15:46:23] [INFO ] Time to serialize gal into /tmp/CTLFireability3986505248605901851.gal : 19 ms
[2026-05-23 15:46:23] [INFO ] Time to serialize properties into /tmp/CTLFireability682126219682058042.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/CTLFireability3986505248605901851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability682126219682058042.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60598e+21,0.663179,17072,481,75,9307,3151,1697,8825,284,2480,0


Converting to forward existential form...Done !
original formula: AG(AF((EX((((((((((((i1.i0.u74.TrainState_1_2_13==1)||(i5.i1.u92.TrainState_3_2_12==1))||((i7.i0.u69.TrainState_5_2_11==1)||(i5.i0.u22.Tr...57470
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((EX((((((((((((i1.i0.u74.TrainState_1_2_13==1)||(i5.i1.u92.TrainState_3_2_12==1))||((i7....57522
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,4.0075,105448,1,0,151470,11158,15386,631828,1770,20996,264128
FORMULA BART-PT-010-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 6 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:46:27] [INFO ] Invariant cache hit.
[2026-05-23 15:46:27] [INFO ] Implicit Places using invariants in 526 ms returned []
[2026-05-23 15:46:27] [INFO ] Invariant cache hit.
[2026-05-23 15:46:29] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2079 ms. Remains : 1320/1320 places, 2020/2020 transitions.
[2026-05-23 15:46:29] [INFO ] Flatten gal took : 25 ms
[2026-05-23 15:46:29] [INFO ] Flatten gal took : 29 ms
[2026-05-23 15:46:29] [INFO ] Input system was already deterministic with 2020 transitions.
[2026-05-23 15:46:29] [INFO ] Flatten gal took : 45 ms
[2026-05-23 15:46:29] [INFO ] Flatten gal took : 46 ms
[2026-05-23 15:46:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12793614451214277400.gal : 10 ms
[2026-05-23 15:46:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1338673104383961994.ctl : 7 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/CTLFireability12793614451214277400.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1338673104383961994.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-23 15:46:59] [INFO ] Flatten gal took : 36 ms
[2026-05-23 15:46:59] [INFO ] Applying decomposition
[2026-05-23 15:46:59] [INFO ] Flatten gal took : 37 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/graph15932132995170003746.txt' '-o' '/tmp/graph15932132995170003746.bin' '-w' '/tmp/graph15932132995170003746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15932132995170003746.bin' '-l' '-1' '-v' '-w' '/tmp/graph15932132995170003746.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:47:00] [INFO ] Decomposing Gal with order
[2026-05-23 15:47:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:47:00] [INFO ] Removed a total of 177 redundant transitions.
[2026-05-23 15:47:00] [INFO ] Flatten gal took : 137 ms
[2026-05-23 15:47:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-23 15:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability503921947206809347.gal : 17 ms
[2026-05-23 15:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability14700402968147601197.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/CTLFireability503921947206809347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14700402968147601197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60598e+21,0.637157,17160,481,75,9050,2935,1599,8521,239,2211,0


Converting to forward existential form...Done !
original formula: E(AX((AX((((((((i7.i1.u2.TrainState_7_1_1==1)||(i1.i0.u3.TrainState_8_1_1==1))||((i2.i0.u4.TrainState_9_1_1==1)||(i6.i0.u9.TrainState_10_...58126
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!((!(EX(!((((((((i7.i1.u2.TrainState_7_1_1==1)||(i1.i0.u3.TrainState_8_1_1==1))||((i2.i0.u4.Tra...58184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.57651,24004,1,0,29355,8365,14074,58261,1534,15079,45266
FORMULA BART-PT-010-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 37 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:47:02] [INFO ] Invariant cache hit.
[2026-05-23 15:47:02] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-23 15:47:02] [INFO ] Invariant cache hit.
[2026-05-23 15:47:04] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2026-05-23 15:47:04] [INFO ] Redundant transitions in 73 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2211 ms. Remains : 1320/1320 places, 2020/2020 transitions.
[2026-05-23 15:47:04] [INFO ] Flatten gal took : 42 ms
[2026-05-23 15:47:04] [INFO ] Flatten gal took : 54 ms
[2026-05-23 15:47:04] [INFO ] Input system was already deterministic with 2020 transitions.
[2026-05-23 15:47:04] [INFO ] Flatten gal took : 53 ms
[2026-05-23 15:47:04] [INFO ] Flatten gal took : 53 ms
[2026-05-23 15:47:04] [INFO ] Time to serialize gal into /tmp/CTLFireability7879124595140314587.gal : 11 ms
[2026-05-23 15:47:04] [INFO ] Time to serialize properties into /tmp/CTLFireability17894646292092831196.ctl : 8 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/CTLFireability7879124595140314587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17894646292092831196.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-23 15:47:35] [INFO ] Flatten gal took : 33 ms
[2026-05-23 15:47:35] [INFO ] Applying decomposition
[2026-05-23 15:47:35] [INFO ] Flatten gal took : 47 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/graph17276683682737072389.txt' '-o' '/tmp/graph17276683682737072389.bin' '-w' '/tmp/graph17276683682737072389.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17276683682737072389.bin' '-l' '-1' '-v' '-w' '/tmp/graph17276683682737072389.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:47:35] [INFO ] Decomposing Gal with order
[2026-05-23 15:47:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:47:35] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-23 15:47:35] [INFO ] Flatten gal took : 77 ms
[2026-05-23 15:47:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-23 15:47:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17753253218184292537.gal : 13 ms
[2026-05-23 15:47:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7049975057180370136.ctl : 7 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/CTLFireability17753253218184292537.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7049975057180370136.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.60598e+21,0.662341,17440,527,75,12202,2933,1854,12573,245,2246,0


Converting to forward existential form...Done !
original formula: A(EF((((((i3.i0.u34.TrainState_10_0_0==1)||(i1.i0.u22.TrainState_5_0_0==1))||((i6.i0.u57.TrainState_6_0_0==1)||(i0.i0.u21.TrainState_1_0_...118406
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!((!((((!(((((((((((i0.i0.u79.TrainState_1_2_13==1)||(i8.i0.u69.TrainState_3_2_12==1))||((...354601
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,7.29156,83828,1,0,105614,165805,18789,232240,1695,217318,149348
FORMULA BART-PT-010-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 6 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:47:43] [INFO ] Invariant cache hit.
[2026-05-23 15:47:43] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-23 15:47:43] [INFO ] Invariant cache hit.
[2026-05-23 15:47:44] [INFO ] Implicit Places using invariants and state equation in 1166 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1541 ms. Remains : 1320/1320 places, 2020/2020 transitions.
[2026-05-23 15:47:44] [INFO ] Flatten gal took : 24 ms
[2026-05-23 15:47:44] [INFO ] Flatten gal took : 31 ms
[2026-05-23 15:47:44] [INFO ] Input system was already deterministic with 2020 transitions.
[2026-05-23 15:47:44] [INFO ] Flatten gal took : 31 ms
[2026-05-23 15:47:44] [INFO ] Flatten gal took : 31 ms
[2026-05-23 15:47:45] [INFO ] Time to serialize gal into /tmp/CTLFireability13242503301686094894.gal : 7 ms
[2026-05-23 15:47:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9742612497000310.ctl : 7 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/CTLFireability13242503301686094894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9742612497000310.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-23 15:48:15] [INFO ] Flatten gal took : 32 ms
[2026-05-23 15:48:15] [INFO ] Applying decomposition
[2026-05-23 15:48:15] [INFO ] Flatten gal took : 31 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/graph7305820347570191861.txt' '-o' '/tmp/graph7305820347570191861.bin' '-w' '/tmp/graph7305820347570191861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7305820347570191861.bin' '-l' '-1' '-v' '-w' '/tmp/graph7305820347570191861.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:48:15] [INFO ] Decomposing Gal with order
[2026-05-23 15:48:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:48:15] [INFO ] Removed a total of 240 redundant transitions.
[2026-05-23 15:48:15] [INFO ] Flatten gal took : 76 ms
[2026-05-23 15:48:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-23 15:48:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11943643154424529830.gal : 13 ms
[2026-05-23 15:48:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5601383081333442197.ctl : 9 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/CTLFireability11943643154424529830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5601383081333442197.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.60598e+21,0.685643,17112,497,75,7322,2922,1714,6974,241,2086,0


Converting to forward existential form...Done !
original formula: (AF((EG((AG((((((((((((i7.i6.u143.TrainState_1_2_13==0)&&(i3.i3.u90.TrainState_3_2_12==0))&&((i6.i4.u72.TrainState_5_2_11==0)&&(i3.i0.u10...130894
=> equivalent forward existential formula: ([FwdG(Init,!((EG((!(E(TRUE U !((((((((((((i7.i6.u143.TrainState_1_2_13==0)&&(i3.i3.u90.TrainState_3_2_12==0))&&...131009
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,5.25967,126432,1,0,177426,133383,34725,579821,3344,167986,313006
FORMULA BART-PT-010-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1780 edges and 1320 vertex of which 410 / 1320 are part of one of the 10 SCC in 3 ms
Free SCC test removed 400 places
Ensure Unique test removed 750 transitions
Reduce isomorphic transitions removed 750 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 561 place count 920 transition count 710
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 680 rules applied. Total rules applied 1241 place count 360 transition count 590
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 2 with 120 rules applied. Total rules applied 1361 place count 320 transition count 510
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 120 rules applied. Total rules applied 1481 place count 280 transition count 430
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 80 rules applied. Total rules applied 1561 place count 240 transition count 390
Discarding 50 places :
Symmetric choice reduction at 5 with 50 rule applications. Total rules 1611 place count 190 transition count 340
Iterating global reduction 5 with 50 rules applied. Total rules applied 1661 place count 190 transition count 340
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 5 with 50 rules applied. Total rules applied 1711 place count 190 transition count 290
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 1721 place count 190 transition count 280
Applied a total of 1721 rules in 61 ms. Remains 190 /1320 variables (removed 1130) and now considering 280/2020 (removed 1740) transitions.
[2026-05-23 15:48:21] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17275152649858105227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1038843756475021944.kers'
[2026-05-23 15:48:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17275152649858105227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1038843756475021944.kers]
Normalized transition count is 270 out of 271 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 190 cols 540 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-23 15:48:21] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1038843756475021944.kers
Total runtime 2 ms.
[2026-05-23 15:48:21] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 15:48:21] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2026-05-23 15:48:21] [INFO ] Invariant cache hit.
[2026-05-23 15:48:21] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2026-05-23 15:48:21] [INFO ] Redundant transitions in 1 ms returned []
Running 180 sub problems to find dead transitions.
[2026-05-23 15:48:21] [INFO ] Flow matrix only has 271 transitions (discarded 9 similar events)
[2026-05-23 15:48:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 10/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 270/460 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 0/460 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/461 variables, and 200 constraints, problems are : Problem set: 0 solved, 180 unsolved in 16406 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (OVERLAPS) 10/190 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (OVERLAPS) 270/460 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 180/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/461 variables, and 380 constraints, problems are : Problem set: 0 solved, 180 unsolved in 14703 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31119ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 31120ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/1320 places, 280/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31380 ms. Remains : 190/1320 places, 280/2020 transitions.
[2026-05-23 15:48:52] [INFO ] Flatten gal took : 7 ms
[2026-05-23 15:48:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:48:52] [INFO ] Input system was already deterministic with 280 transitions.
[2026-05-23 15:48:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:48:52] [INFO ] Flatten gal took : 6 ms
[2026-05-23 15:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability4279282705482302415.gal : 2 ms
[2026-05-23 15:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability521345014108806174.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/CTLFireability4279282705482302415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability521345014108806174.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.13107e+12,0.118778,5312,2,371,5,2192,6,0,1033,1463,0


Converting to forward existential form...Done !
original formula: AF(AG(((((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==1)||(TrainState_6_3_7==1)))||(((TrainState_5_4_11==1)||...2321
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==1)||(Train...2378
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.506974,10688,1,0,6,39202,19,1,5031,3755,10
FORMULA BART-PT-010-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1960 edges and 1320 vertex of which 1027 / 1320 are part of one of the 8 SCC in 4 ms
Free SCC test removed 1019 places
Ensure Unique test removed 1566 transitions
Reduce isomorphic transitions removed 1566 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 298 transition count 312
Reduce places removed 140 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 142 rules applied. Total rules applied 285 place count 158 transition count 310
Reduce places removed 1 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 2 with 3 rules applied. Total rules applied 288 place count 157 transition count 308
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 6 rules applied. Total rules applied 294 place count 156 transition count 303
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 152 transition count 301
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 300 place count 152 transition count 292
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 318 place count 143 transition count 292
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 331 place count 130 transition count 279
Iterating global reduction 5 with 13 rules applied. Total rules applied 344 place count 130 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 347 place count 130 transition count 276
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 355 place count 122 transition count 268
Iterating global reduction 6 with 8 rules applied. Total rules applied 363 place count 122 transition count 268
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 369 place count 116 transition count 262
Iterating global reduction 6 with 6 rules applied. Total rules applied 375 place count 116 transition count 262
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 381 place count 110 transition count 256
Iterating global reduction 6 with 6 rules applied. Total rules applied 387 place count 110 transition count 256
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 391 place count 106 transition count 252
Iterating global reduction 6 with 4 rules applied. Total rules applied 395 place count 106 transition count 252
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 399 place count 102 transition count 248
Iterating global reduction 6 with 4 rules applied. Total rules applied 403 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 405 place count 100 transition count 246
Iterating global reduction 6 with 2 rules applied. Total rules applied 407 place count 100 transition count 246
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 431 place count 88 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 435 place count 88 transition count 230
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 7 with 4 rules applied. Total rules applied 439 place count 86 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 443 place count 86 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 447 place count 84 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 451 place count 84 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 455 place count 82 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 459 place count 82 transition count 212
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 10 with 4 rules applied. Total rules applied 463 place count 80 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 467 place count 80 transition count 206
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 11 with 4 rules applied. Total rules applied 471 place count 78 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 475 place count 78 transition count 200
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 12 with 4 rules applied. Total rules applied 479 place count 76 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 483 place count 76 transition count 194
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 13 with 4 rules applied. Total rules applied 487 place count 74 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 491 place count 74 transition count 188
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 14 with 4 rules applied. Total rules applied 495 place count 72 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 499 place count 72 transition count 182
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 15 with 4 rules applied. Total rules applied 503 place count 70 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 507 place count 70 transition count 176
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 16 with 4 rules applied. Total rules applied 511 place count 68 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 515 place count 68 transition count 170
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 17 with 4 rules applied. Total rules applied 519 place count 66 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 523 place count 66 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 527 place count 64 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 531 place count 64 transition count 158
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 19 with 4 rules applied. Total rules applied 535 place count 62 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 539 place count 62 transition count 152
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 20 with 4 rules applied. Total rules applied 543 place count 60 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 547 place count 60 transition count 146
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 21 with 4 rules applied. Total rules applied 551 place count 58 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 555 place count 58 transition count 140
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 22 with 4 rules applied. Total rules applied 559 place count 56 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 563 place count 56 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 567 place count 54 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 571 place count 54 transition count 128
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 24 with 4 rules applied. Total rules applied 575 place count 52 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 579 place count 52 transition count 122
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 25 with 4 rules applied. Total rules applied 583 place count 50 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 587 place count 50 transition count 116
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 26 with 4 rules applied. Total rules applied 591 place count 48 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 595 place count 48 transition count 110
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 27 with 4 rules applied. Total rules applied 599 place count 46 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 603 place count 46 transition count 104
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 28 with 4 rules applied. Total rules applied 607 place count 44 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 611 place count 44 transition count 98
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 29 with 4 rules applied. Total rules applied 615 place count 42 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 619 place count 42 transition count 92
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 30 with 4 rules applied. Total rules applied 623 place count 40 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 627 place count 40 transition count 86
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 31 with 4 rules applied. Total rules applied 631 place count 38 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 635 place count 38 transition count 80
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 32 with 4 rules applied. Total rules applied 639 place count 36 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 643 place count 36 transition count 74
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 33 with 4 rules applied. Total rules applied 647 place count 34 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 651 place count 34 transition count 68
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 34 with 4 rules applied. Total rules applied 655 place count 32 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 659 place count 32 transition count 62
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 35 with 4 rules applied. Total rules applied 663 place count 30 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 667 place count 30 transition count 56
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 36 with 4 rules applied. Total rules applied 671 place count 28 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 675 place count 28 transition count 50
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 37 with 4 rules applied. Total rules applied 679 place count 26 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 683 place count 26 transition count 44
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 38 with 4 rules applied. Total rules applied 687 place count 24 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 691 place count 24 transition count 38
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 39 with 4 rules applied. Total rules applied 695 place count 22 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 39 with 5 rules applied. Total rules applied 700 place count 22 transition count 31
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 40 with 3 rules applied. Total rules applied 703 place count 21 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 705 place count 20 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 42 with 1 Pre rules applied. Total rules applied 705 place count 20 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 42 with 2 rules applied. Total rules applied 707 place count 19 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 42 with 5 rules applied. Total rules applied 712 place count 19 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 42 with 2 Pre rules applied. Total rules applied 712 place count 19 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 42 with 4 rules applied. Total rules applied 716 place count 17 transition count 20
Applied a total of 716 rules in 172 ms. Remains 17 /1320 variables (removed 1303) and now considering 20/2020 (removed 2000) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7637216592539205312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1430083451675764199.kers'
[2026-05-23 15:48:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7637216592539205312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1430083451675764199.kers]
Normalized transition count is 19 out of 20 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 19 rows 12 cols 28 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-23 15:48:53] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1430083451675764199.kers
Total runtime 1 ms.
[2026-05-23 15:48:53] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 15:48:53] [INFO ] Invariant cache hit.
[2026-05-23 15:48:53] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-23 15:48:53] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-23 15:48:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 7/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/36 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 24 constraints, problems are : Problem set: 0 solved, 10 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 7/17 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 19/36 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 10 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 435ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/1320 places, 20/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 714 ms. Remains : 17/1320 places, 20/2020 transitions.
[2026-05-23 15:48:53] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:53] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:53] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-23 15:48:53] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:53] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:53] [INFO ] Time to serialize gal into /tmp/CTLFireability6412587881142883896.gal : 0 ms
[2026-05-23 15:48:53] [INFO ] Time to serialize properties into /tmp/CTLFireability11560914699781058320.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/CTLFireability6412587881142883896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11560914699781058320.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,384,0.007721,3844,2,31,5,126,5,0,89,80,0


Converting to forward existential form...Done !
original formula: EF((EF((!(A((TrainState_5_0_0==1) U (TrainState_8_1_6==1))) * AG((TrainState_9_1_25==1)))) * (((TrainState_3_2_9==0)||(TrainState_9_3_34=...271
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * E(TRUE U (!(!((E(!((TrainState_8_1_6==1)) U (!((TrainState_5_0_0==1)) * !((TrainState_8_1_...834
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 17/0/3
(forward)formula 0,0,0.018922,4384,1,0,14,586,29,1,378,277,11
FORMULA BART-PT-010-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1823 edges and 1320 vertex of which 653 / 1320 are part of one of the 5 SCC in 4 ms
Free SCC test removed 648 places
Ensure Unique test removed 994 transitions
Reduce isomorphic transitions removed 994 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 322 rules applied. Total rules applied 323 place count 669 transition count 704
Reduce places removed 320 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 324 rules applied. Total rules applied 647 place count 349 transition count 700
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 653 place count 345 transition count 698
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 653 place count 345 transition count 673
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 703 place count 320 transition count 673
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 733 place count 290 transition count 643
Iterating global reduction 3 with 30 rules applied. Total rules applied 763 place count 290 transition count 643
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 768 place count 290 transition count 638
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 788 place count 270 transition count 618
Iterating global reduction 4 with 20 rules applied. Total rules applied 808 place count 270 transition count 618
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 823 place count 255 transition count 603
Iterating global reduction 4 with 15 rules applied. Total rules applied 838 place count 255 transition count 603
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 853 place count 240 transition count 588
Iterating global reduction 4 with 15 rules applied. Total rules applied 868 place count 240 transition count 588
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 878 place count 230 transition count 578
Iterating global reduction 4 with 10 rules applied. Total rules applied 888 place count 230 transition count 578
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 898 place count 220 transition count 568
Iterating global reduction 4 with 10 rules applied. Total rules applied 908 place count 220 transition count 568
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 913 place count 215 transition count 563
Iterating global reduction 4 with 5 rules applied. Total rules applied 918 place count 215 transition count 563
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 978 place count 185 transition count 533
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 988 place count 185 transition count 523
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 998 place count 180 transition count 518
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1008 place count 180 transition count 508
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1018 place count 175 transition count 503
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1028 place count 175 transition count 493
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1038 place count 170 transition count 488
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1048 place count 170 transition count 478
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1058 place count 165 transition count 473
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1068 place count 165 transition count 463
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1078 place count 160 transition count 458
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 1088 place count 160 transition count 448
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1098 place count 155 transition count 443
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1108 place count 155 transition count 433
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1118 place count 150 transition count 428
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1128 place count 150 transition count 418
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 12 with 10 rules applied. Total rules applied 1138 place count 145 transition count 413
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 1148 place count 145 transition count 403
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 13 with 10 rules applied. Total rules applied 1158 place count 140 transition count 398
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 1168 place count 140 transition count 388
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 14 with 10 rules applied. Total rules applied 1178 place count 135 transition count 383
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 1188 place count 135 transition count 373
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 15 with 10 rules applied. Total rules applied 1198 place count 130 transition count 368
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 1208 place count 130 transition count 358
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 16 with 10 rules applied. Total rules applied 1218 place count 125 transition count 353
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 16 with 10 rules applied. Total rules applied 1228 place count 125 transition count 343
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 1238 place count 120 transition count 338
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 1248 place count 120 transition count 328
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 18 with 10 rules applied. Total rules applied 1258 place count 115 transition count 323
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 1268 place count 115 transition count 313
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 19 with 10 rules applied. Total rules applied 1278 place count 110 transition count 308
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 19 with 10 rules applied. Total rules applied 1288 place count 110 transition count 298
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 20 with 10 rules applied. Total rules applied 1298 place count 105 transition count 293
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 10 rules applied. Total rules applied 1308 place count 105 transition count 283
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 21 with 10 rules applied. Total rules applied 1318 place count 100 transition count 278
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 21 with 10 rules applied. Total rules applied 1328 place count 100 transition count 268
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 22 with 10 rules applied. Total rules applied 1338 place count 95 transition count 263
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 22 with 9 rules applied. Total rules applied 1347 place count 95 transition count 254
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 1355 place count 91 transition count 250
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 23 with 8 rules applied. Total rules applied 1363 place count 91 transition count 242
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 24 with 8 rules applied. Total rules applied 1371 place count 87 transition count 238
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 24 with 8 rules applied. Total rules applied 1379 place count 87 transition count 230
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 25 with 8 rules applied. Total rules applied 1387 place count 83 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 25 with 8 rules applied. Total rules applied 1395 place count 83 transition count 218
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 1403 place count 79 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 26 with 8 rules applied. Total rules applied 1411 place count 79 transition count 206
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 1419 place count 75 transition count 202
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 27 with 8 rules applied. Total rules applied 1427 place count 75 transition count 194
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 28 with 6 rules applied. Total rules applied 1433 place count 72 transition count 191
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 28 with 6 rules applied. Total rules applied 1439 place count 72 transition count 185
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 29 with 6 rules applied. Total rules applied 1445 place count 69 transition count 182
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 29 with 6 rules applied. Total rules applied 1451 place count 69 transition count 176
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 30 with 6 rules applied. Total rules applied 1457 place count 66 transition count 173
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 30 with 6 rules applied. Total rules applied 1463 place count 66 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 31 with 6 rules applied. Total rules applied 1469 place count 63 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 31 with 6 rules applied. Total rules applied 1475 place count 63 transition count 158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 32 with 6 rules applied. Total rules applied 1481 place count 60 transition count 155
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 32 with 6 rules applied. Total rules applied 1487 place count 60 transition count 149
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 33 with 6 rules applied. Total rules applied 1493 place count 57 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 33 with 6 rules applied. Total rules applied 1499 place count 57 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 34 with 6 rules applied. Total rules applied 1505 place count 54 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 34 with 6 rules applied. Total rules applied 1511 place count 54 transition count 131
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 35 with 6 rules applied. Total rules applied 1517 place count 51 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 35 with 6 rules applied. Total rules applied 1523 place count 51 transition count 122
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 36 with 6 rules applied. Total rules applied 1529 place count 48 transition count 119
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 36 with 6 rules applied. Total rules applied 1535 place count 48 transition count 113
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 37 with 6 rules applied. Total rules applied 1541 place count 45 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 37 with 9 rules applied. Total rules applied 1550 place count 45 transition count 101
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 38 with 6 rules applied. Total rules applied 1556 place count 42 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 39 with 41 rules applied. Total rules applied 1597 place count 42 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 39 with 11 rules applied. Total rules applied 1608 place count 42 transition count 46
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 40 with 13 rules applied. Total rules applied 1621 place count 31 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 41 with 2 rules applied. Total rules applied 1623 place count 29 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 42 with 6 rules applied. Total rules applied 1629 place count 29 transition count 38
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 42 with 5 rules applied. Total rules applied 1634 place count 29 transition count 33
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 43 with 6 rules applied. Total rules applied 1640 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 44 with 1 rules applied. Total rules applied 1641 place count 23 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 45 with 3 rules applied. Total rules applied 1644 place count 23 transition count 29
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 45 with 2 rules applied. Total rules applied 1646 place count 23 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 46 with 3 rules applied. Total rules applied 1649 place count 21 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 1650 place count 20 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 48 with 2 rules applied. Total rules applied 1652 place count 20 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 48 with 2 rules applied. Total rules applied 1654 place count 20 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 49 with 2 rules applied. Total rules applied 1656 place count 18 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 50 with 2 rules applied. Total rules applied 1658 place count 18 transition count 22
Applied a total of 1658 rules in 259 ms. Remains 18 /1320 variables (removed 1302) and now considering 22/2020 (removed 1998) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5956880085755783481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17296851240341341527.kers'
[2026-05-23 15:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5956880085755783481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17296851240341341527.kers]
Normalized transition count is 21 out of 22 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 13 cols 32 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 15:48:54] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17296851240341341527.kers
Total runtime 0 ms.
[2026-05-23 15:48:54] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 15:48:54] [INFO ] Invariant cache hit.
[2026-05-23 15:48:54] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-23 15:48:54] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-23 15:48:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 36 constraints, problems are : Problem set: 0 solved, 11 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 440ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/1320 places, 22/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 790 ms. Remains : 18/1320 places, 22/2020 transitions.
[2026-05-23 15:48:54] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:54] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:54] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-23 15:48:54] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:54] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3091990242050612565.gal : 1 ms
[2026-05-23 15:48:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14322887656537302035.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/CTLFireability3091990242050612565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14322887656537302035.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,512,0.007689,3852,2,36,5,155,5,0,95,95,0


Converting to forward existential form...Done !
original formula: EF(((AF(((((TrainState_2_0_0==1)&&(TrainState_7_0_0==1))&&((TrainState_4_0_0==1)&&(TrainState_2_2_24==1)))||(TrainState_6_0_0==1))) * (Tr...263
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * (!(EG(!(((((TrainState_2_0_0==1)&&(TrainState_7_0_0==1))&&((TrainState_4_0_0==1)&&(TrainS...707
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.02027,4424,1,0,11,564,33,2,390,225,10
FORMULA BART-PT-010-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1894 edges and 1320 vertex of which 917 / 1320 are part of one of the 7 SCC in 1 ms
Free SCC test removed 910 places
Ensure Unique test removed 1396 transitions
Reduce isomorphic transitions removed 1396 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 192 rules applied. Total rules applied 193 place count 406 transition count 432
Reduce places removed 189 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 191 rules applied. Total rules applied 384 place count 217 transition count 430
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 387 place count 215 transition count 429
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 387 place count 215 transition count 415
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 415 place count 201 transition count 415
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 435 place count 181 transition count 395
Iterating global reduction 3 with 20 rules applied. Total rules applied 455 place count 181 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 458 place count 181 transition count 392
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 469 place count 170 transition count 381
Iterating global reduction 4 with 11 rules applied. Total rules applied 480 place count 170 transition count 381
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 488 place count 162 transition count 373
Iterating global reduction 4 with 8 rules applied. Total rules applied 496 place count 162 transition count 373
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 504 place count 154 transition count 365
Iterating global reduction 4 with 8 rules applied. Total rules applied 512 place count 154 transition count 365
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 518 place count 148 transition count 359
Iterating global reduction 4 with 6 rules applied. Total rules applied 524 place count 148 transition count 359
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 528 place count 144 transition count 355
Iterating global reduction 4 with 4 rules applied. Total rules applied 532 place count 144 transition count 355
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 535 place count 141 transition count 352
Iterating global reduction 4 with 3 rules applied. Total rules applied 538 place count 141 transition count 352
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 582 place count 119 transition count 330
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 588 place count 119 transition count 324
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 594 place count 116 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 600 place count 116 transition count 315
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 606 place count 113 transition count 312
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 612 place count 113 transition count 306
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 618 place count 110 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 624 place count 110 transition count 297
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 630 place count 107 transition count 294
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 636 place count 107 transition count 288
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 642 place count 104 transition count 285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 648 place count 104 transition count 279
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 654 place count 101 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 659 place count 101 transition count 271
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 11 with 4 rules applied. Total rules applied 663 place count 99 transition count 269
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 667 place count 99 transition count 265
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 12 with 4 rules applied. Total rules applied 671 place count 97 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 675 place count 97 transition count 259
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 679 place count 95 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 683 place count 95 transition count 253
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 14 with 4 rules applied. Total rules applied 687 place count 93 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 691 place count 93 transition count 247
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 15 with 4 rules applied. Total rules applied 695 place count 91 transition count 245
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 699 place count 91 transition count 241
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 703 place count 89 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 707 place count 89 transition count 235
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 17 with 4 rules applied. Total rules applied 711 place count 87 transition count 233
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 715 place count 87 transition count 229
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 18 with 4 rules applied. Total rules applied 719 place count 85 transition count 227
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 723 place count 85 transition count 223
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 19 with 4 rules applied. Total rules applied 727 place count 83 transition count 221
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 731 place count 83 transition count 217
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 20 with 4 rules applied. Total rules applied 735 place count 81 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 739 place count 81 transition count 211
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 21 with 4 rules applied. Total rules applied 743 place count 79 transition count 209
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 747 place count 79 transition count 205
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 22 with 4 rules applied. Total rules applied 751 place count 77 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 755 place count 77 transition count 199
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 23 with 4 rules applied. Total rules applied 759 place count 75 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 763 place count 75 transition count 193
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 24 with 4 rules applied. Total rules applied 767 place count 73 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 771 place count 73 transition count 187
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 25 with 4 rules applied. Total rules applied 775 place count 71 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 779 place count 71 transition count 181
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 26 with 4 rules applied. Total rules applied 783 place count 69 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 787 place count 69 transition count 175
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 27 with 4 rules applied. Total rules applied 791 place count 67 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 795 place count 67 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 28 with 4 rules applied. Total rules applied 799 place count 65 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 803 place count 65 transition count 163
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 29 with 4 rules applied. Total rules applied 807 place count 63 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 811 place count 63 transition count 157
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 30 with 4 rules applied. Total rules applied 815 place count 61 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 819 place count 61 transition count 151
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 31 with 4 rules applied. Total rules applied 823 place count 59 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 827 place count 59 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 831 place count 57 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 835 place count 57 transition count 139
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 33 with 4 rules applied. Total rules applied 839 place count 55 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 33 with 3 rules applied. Total rules applied 842 place count 55 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 844 place count 54 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 846 place count 54 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 848 place count 53 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 850 place count 53 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 852 place count 52 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 854 place count 52 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 856 place count 51 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 37 with 3 rules applied. Total rules applied 859 place count 51 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 861 place count 50 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 39 with 45 rules applied. Total rules applied 906 place count 50 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 39 with 9 rules applied. Total rules applied 915 place count 50 transition count 66
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 40 with 9 rules applied. Total rules applied 924 place count 41 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 41 with 1 Pre rules applied. Total rules applied 924 place count 41 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 41 with 2 rules applied. Total rules applied 926 place count 40 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 41 with 8 rules applied. Total rules applied 934 place count 40 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 41 with 8 rules applied. Total rules applied 942 place count 40 transition count 49
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 42 with 8 rules applied. Total rules applied 950 place count 32 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 43 with 2 rules applied. Total rules applied 952 place count 32 transition count 47
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 43 with 1 rules applied. Total rules applied 953 place count 32 transition count 46
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 44 with 2 rules applied. Total rules applied 955 place count 31 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 956 place count 30 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 46 with 1 rules applied. Total rules applied 957 place count 30 transition count 44
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 46 with 1 rules applied. Total rules applied 958 place count 30 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 47 with 1 rules applied. Total rules applied 959 place count 29 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 48 with 1 rules applied. Total rules applied 960 place count 29 transition count 42
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 48 with 1 rules applied. Total rules applied 961 place count 29 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 49 with 1 rules applied. Total rules applied 962 place count 28 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 50 with 1 rules applied. Total rules applied 963 place count 28 transition count 40
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 50 with 1 rules applied. Total rules applied 964 place count 28 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 51 with 1 rules applied. Total rules applied 965 place count 27 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 52 with 1 rules applied. Total rules applied 966 place count 27 transition count 38
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 52 with 1 rules applied. Total rules applied 967 place count 27 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 53 with 1 rules applied. Total rules applied 968 place count 26 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 54 with 1 rules applied. Total rules applied 969 place count 26 transition count 36
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 54 with 1 rules applied. Total rules applied 970 place count 26 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 55 with 1 rules applied. Total rules applied 971 place count 25 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 56 with 1 rules applied. Total rules applied 972 place count 25 transition count 34
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 56 with 1 rules applied. Total rules applied 973 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 57 with 1 rules applied. Total rules applied 974 place count 24 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 58 with 1 rules applied. Total rules applied 975 place count 24 transition count 32
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 58 with 1 rules applied. Total rules applied 976 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 59 with 1 rules applied. Total rules applied 977 place count 23 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 60 with 1 rules applied. Total rules applied 978 place count 23 transition count 30
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 60 with 1 rules applied. Total rules applied 979 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 61 with 1 rules applied. Total rules applied 980 place count 22 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 62 with 1 rules applied. Total rules applied 981 place count 22 transition count 28
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 62 with 1 rules applied. Total rules applied 982 place count 22 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 63 with 1 rules applied. Total rules applied 983 place count 21 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 64 with 1 rules applied. Total rules applied 984 place count 21 transition count 26
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 64 with 1 rules applied. Total rules applied 985 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 65 with 1 rules applied. Total rules applied 986 place count 20 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 66 with 1 rules applied. Total rules applied 987 place count 20 transition count 24
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 66 with 1 rules applied. Total rules applied 988 place count 20 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 67 with 1 rules applied. Total rules applied 989 place count 19 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 68 with 1 rules applied. Total rules applied 990 place count 19 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 68 with 1 rules applied. Total rules applied 991 place count 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 69 with 1 rules applied. Total rules applied 992 place count 18 transition count 21
Applied a total of 992 rules in 125 ms. Remains 18 /1320 variables (removed 1302) and now considering 21/2020 (removed 1999) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9881280350962761983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4291806673555330547.kers'
[2026-05-23 15:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9881280350962761983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4291806673555330547.kers]
Normalized transition count is 20 out of 21 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 20 rows 14 cols 32 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-23 15:48:54] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4291806673555330547.kers
Total runtime 1 ms.
[2026-05-23 15:48:54] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 15:48:54] [INFO ] Invariant cache hit.
[2026-05-23 15:48:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2026-05-23 15:48:55] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2026-05-23 15:48:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/39 variables, and 24 constraints, problems are : Problem set: 0 solved, 14 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 6/18 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 38 constraints, problems are : Problem set: 0 solved, 14 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 627ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/1320 places, 21/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 840 ms. Remains : 18/1320 places, 21/2020 transitions.
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:55] [INFO ] Input system was already deterministic with 21 transitions.
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13576617345052012975.gal : 0 ms
[2026-05-23 15:48:55] [INFO ] Time to serialize properties into /tmp/CTLFireability13000534299560842262.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/CTLFireability13576617345052012975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13000534299560842262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,400,0.006411,3848,2,31,5,139,5,0,94,88,0


Converting to forward existential form...Done !
original formula: EG(((((TrainState_3_4_30==1) + EF(((TrainState_10_0_0==0)&&(TrainState_1_3_14==0)))) + ((TrainState_8_2_39==0)||(TrainState_4_1_12==0))) ...232
=> equivalent forward existential formula: [FwdG(Init,((((TrainState_3_4_30==1) + E(TRUE U ((TrainState_10_0_0==0)&&(TrainState_1_3_14==0)))) + ((TrainStat...281
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.013582,4384,1,0,9,539,19,4,398,317,13
FORMULA BART-PT-010-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1983 edges and 1320 vertex of which 1188 / 1320 are part of one of the 9 SCC in 0 ms
Free SCC test removed 1179 places
Ensure Unique test removed 1809 transitions
Reduce isomorphic transitions removed 1809 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 132 transition count 139
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 137 place count 68 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 137 place count 68 transition count 134
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 147 place count 63 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 57 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 57 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 160 place count 57 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 164 place count 53 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 53 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 171 place count 50 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 174 place count 50 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 177 place count 47 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 180 place count 47 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 45 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 45 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 43 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 43 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 189 place count 42 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 190 place count 42 transition count 112
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 3 with 12 rules applied. Total rules applied 202 place count 36 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 204 place count 36 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 206 place count 35 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 208 place count 35 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 34 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 34 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 214 place count 33 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 216 place count 33 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 32 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 220 place count 32 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 222 place count 31 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 224 place count 31 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 226 place count 30 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 228 place count 30 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 230 place count 29 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 232 place count 29 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 234 place count 28 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 236 place count 28 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 238 place count 27 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 240 place count 27 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 242 place count 26 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 244 place count 26 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 246 place count 25 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 248 place count 25 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 250 place count 24 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 252 place count 24 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 254 place count 23 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 256 place count 23 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 258 place count 22 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 260 place count 22 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 262 place count 21 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 264 place count 21 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 266 place count 20 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 268 place count 20 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 270 place count 19 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 272 place count 19 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 274 place count 18 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 276 place count 18 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 278 place count 17 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 280 place count 17 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 282 place count 16 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 284 place count 16 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 286 place count 15 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 288 place count 15 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 290 place count 14 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 292 place count 14 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 294 place count 13 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 296 place count 13 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 298 place count 12 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 300 place count 12 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 302 place count 11 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 304 place count 11 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 306 place count 10 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 308 place count 10 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 310 place count 9 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 312 place count 9 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 314 place count 8 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 316 place count 8 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 318 place count 7 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 320 place count 7 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 322 place count 6 transition count 16
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 324 place count 6 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 326 place count 5 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 328 place count 5 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 330 place count 4 transition count 10
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 332 place count 4 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 334 place count 3 transition count 7
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 36 with 3 rules applied. Total rules applied 337 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 339 place count 2 transition count 3
Applied a total of 339 rules in 40 ms. Remains 2 /1320 variables (removed 1318) and now considering 3/2020 (removed 2017) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15186065713873446981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1816277021341357620.kers'
[2026-05-23 15:48:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15186065713873446981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1816277021341357620.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 15:48:55] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1816277021341357620.kers
Total runtime 0 ms.
[2026-05-23 15:48:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-23 15:48:55] [INFO ] Invariant cache hit.
[2026-05-23 15:48:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-23 15:48:55] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 15:48:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/1320 places, 3/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 180 ms. Remains : 2/1320 places, 3/2020 transitions.
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:48:55] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:55] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:48:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6280297330838200710.gal : 1 ms
[2026-05-23 15:48:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4329692148744272708.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/CTLFireability6280297330838200710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4329692148744272708.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((TrainState_10_0_0==1))
=> equivalent forward existential formula: [FwdG(Init,(TrainState_10_0_0==1))] != FALSE
Hit Full ! (commute/partial/dont) 0/0/3
(forward)formula 0,1,0.002789,3996,1,0,5,18,18,0,49,11,8
FORMULA BART-PT-010-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 266 places :
Symmetric choice reduction at 0 with 266 rule applications. Total rules 904 place count 735 transition count 1435
Iterating global reduction 0 with 266 rules applied. Total rules applied 1170 place count 735 transition count 1435
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1209 place count 696 transition count 1396
Iterating global reduction 0 with 39 rules applied. Total rules applied 1248 place count 696 transition count 1396
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1277 place count 667 transition count 1367
Iterating global reduction 0 with 29 rules applied. Total rules applied 1306 place count 667 transition count 1367
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1335 place count 638 transition count 1338
Iterating global reduction 0 with 29 rules applied. Total rules applied 1364 place count 638 transition count 1338
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1393 place count 609 transition count 1309
Iterating global reduction 0 with 29 rules applied. Total rules applied 1422 place count 609 transition count 1309
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1451 place count 580 transition count 1280
Iterating global reduction 0 with 29 rules applied. Total rules applied 1480 place count 580 transition count 1280
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1508 place count 552 transition count 1252
Iterating global reduction 0 with 28 rules applied. Total rules applied 1536 place count 552 transition count 1252
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1555 place count 533 transition count 1233
Iterating global reduction 0 with 19 rules applied. Total rules applied 1574 place count 533 transition count 1233
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 1592 place count 515 transition count 1215
Iterating global reduction 0 with 18 rules applied. Total rules applied 1610 place count 515 transition count 1215
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1620 place count 505 transition count 1205
Iterating global reduction 0 with 10 rules applied. Total rules applied 1630 place count 505 transition count 1205
Applied a total of 1630 rules in 319 ms. Remains 505 /1320 variables (removed 815) and now considering 1205/2020 (removed 815) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3931783156069034913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16134804052673951562.kers'
[2026-05-23 15:48:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3931783156069034913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16134804052673951562.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1205 rows 505 cols 2410 entries
Finished phase 1 with 495 SingleSign rule and 0 generalized
[2026-05-23 15:48:56] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16134804052673951562.kers
Total runtime 6 ms.
[2026-05-23 15:48:56] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-23 15:48:56] [INFO ] Invariant cache hit.
[2026-05-23 15:48:56] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 845 sub problems to find dead transitions.
[2026-05-23 15:48:56] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 845 unsolved
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 845 unsolved
Search for dead transitions found 0 dead transitions in 30123ms
Starting structural reductions in LTL mode, iteration 1 : 505/1320 places, 1205/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31161 ms. Remains : 505/1320 places, 1205/2020 transitions.
[2026-05-23 15:49:27] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:49:27] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:49:27] [INFO ] Input system was already deterministic with 1205 transitions.
[2026-05-23 15:49:27] [INFO ] Flatten gal took : 14 ms
[2026-05-23 15:49:27] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:49:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13350718855756148315.gal : 4 ms
[2026-05-23 15:49:27] [INFO ] Time to serialize properties into /tmp/CTLFireability13418367302360343921.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/CTLFireability13350718855756148315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13418367302360343921.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05886e+17,0.811684,9960,2,1001,5,8047,6,0,3228,4434,0


Converting to forward existential form...Done !
original formula: A((TrainState_2_1_20!=1) U E((!(AX((TrainState_3_1_1==1))) + !(((TrainState_7_2_35==1)&&(TrainState_5_0_0==1)))) U (E((TrainState_3_0_0==...262
=> equivalent forward existential formula: [((Init * !(EG(!(E((!(!(EX(!((TrainState_3_1_1==1))))) + !(((TrainState_7_2_35==1)&&(TrainState_5_0_0==1)))) U (...789
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 1168/0/37
(forward)formula 0,1,3.85658,54420,1,0,12,276665,35,3,14127,23054,14
FORMULA BART-PT-010-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 316 places :
Symmetric choice reduction at 0 with 316 rule applications. Total rules 316 place count 1004 transition count 1704
Iterating global reduction 0 with 316 rules applied. Total rules applied 632 place count 1004 transition count 1704
Discarding 266 places :
Symmetric choice reduction at 0 with 266 rule applications. Total rules 898 place count 738 transition count 1438
Iterating global reduction 0 with 266 rules applied. Total rules applied 1164 place count 738 transition count 1438
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 1203 place count 699 transition count 1399
Iterating global reduction 0 with 39 rules applied. Total rules applied 1242 place count 699 transition count 1399
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1271 place count 670 transition count 1370
Iterating global reduction 0 with 29 rules applied. Total rules applied 1300 place count 670 transition count 1370
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1328 place count 642 transition count 1342
Iterating global reduction 0 with 28 rules applied. Total rules applied 1356 place count 642 transition count 1342
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1384 place count 614 transition count 1314
Iterating global reduction 0 with 28 rules applied. Total rules applied 1412 place count 614 transition count 1314
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1440 place count 586 transition count 1286
Iterating global reduction 0 with 28 rules applied. Total rules applied 1468 place count 586 transition count 1286
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1496 place count 558 transition count 1258
Iterating global reduction 0 with 28 rules applied. Total rules applied 1524 place count 558 transition count 1258
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1543 place count 539 transition count 1239
Iterating global reduction 0 with 19 rules applied. Total rules applied 1562 place count 539 transition count 1239
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1581 place count 520 transition count 1220
Iterating global reduction 0 with 19 rules applied. Total rules applied 1600 place count 520 transition count 1220
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 1609 place count 511 transition count 1211
Iterating global reduction 0 with 9 rules applied. Total rules applied 1618 place count 511 transition count 1211
Applied a total of 1618 rules in 292 ms. Remains 511 /1320 variables (removed 809) and now considering 1211/2020 (removed 809) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13019962208764368074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16057603027175303038.kers'
[2026-05-23 15:49:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13019962208764368074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16057603027175303038.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1211 rows 511 cols 2422 entries
Finished phase 1 with 501 SingleSign rule and 0 generalized
[2026-05-23 15:49:31] [INFO ] Computed 10 invariants in 10 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-16057603027175303038.kers
Total runtime 13 ms.
[2026-05-23 15:49:31] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-23 15:49:31] [INFO ] Invariant cache hit.
[2026-05-23 15:49:32] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 851 sub problems to find dead transitions.
[2026-05-23 15:49:32] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 851 unsolved
SMT process timed out in 30135ms, After SMT, problems are : Problem set: 0 solved, 851 unsolved
Search for dead transitions found 0 dead transitions in 30136ms
Starting structural reductions in LTL mode, iteration 1 : 511/1320 places, 1211/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31266 ms. Remains : 511/1320 places, 1211/2020 transitions.
[2026-05-23 15:50:02] [INFO ] Flatten gal took : 22 ms
[2026-05-23 15:50:02] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:50:02] [INFO ] Input system was already deterministic with 1211 transitions.
[2026-05-23 15:50:02] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:50:02] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:50:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15213649101874659570.gal : 6 ms
[2026-05-23 15:50:02] [INFO ] Time to serialize properties into /tmp/CTLFireability15089594338057736147.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/CTLFireability15213649101874659570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15089594338057736147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15252e+17,0.894666,10196,2,1226,5,11598,6,0,3258,6371,0


Converting to forward existential form...Done !
original formula: (A(AF(!((!(AG((TrainState_10_1_9==1))) * !(E((TrainState_9_1_9==1) U (TrainState_10_0_0==1)))))) U A(AF((TrainState_6_1_21!=1)) U ((!(AF(...318
=> equivalent forward existential formula: ([((Init * !(EG(!(!((E(!(((!(!(EG(!((TrainState_4_1_25==1))))) + ((TrainState_7_3_33==1)&&(TrainState_5_3_33!=1)...1760
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 1207/0/4
Using saturation style SCC detection
(forward)formula 0,1,6.36219,118684,1,0,55,826040,51,44,14652,297969,58
FORMULA BART-PT-010-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1216 place count 692 transition count 1392
Iterating global reduction 0 with 40 rules applied. Total rules applied 1256 place count 692 transition count 1392
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1285 place count 663 transition count 1363
Iterating global reduction 0 with 29 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1343 place count 634 transition count 1334
Iterating global reduction 0 with 29 rules applied. Total rules applied 1372 place count 634 transition count 1334
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1401 place count 605 transition count 1305
Iterating global reduction 0 with 29 rules applied. Total rules applied 1430 place count 605 transition count 1305
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1459 place count 576 transition count 1276
Iterating global reduction 0 with 29 rules applied. Total rules applied 1488 place count 576 transition count 1276
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1517 place count 547 transition count 1247
Iterating global reduction 0 with 29 rules applied. Total rules applied 1546 place count 547 transition count 1247
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1565 place count 528 transition count 1228
Iterating global reduction 0 with 19 rules applied. Total rules applied 1584 place count 528 transition count 1228
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1603 place count 509 transition count 1209
Iterating global reduction 0 with 19 rules applied. Total rules applied 1622 place count 509 transition count 1209
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 1631 place count 500 transition count 1200
Iterating global reduction 0 with 9 rules applied. Total rules applied 1640 place count 500 transition count 1200
Applied a total of 1640 rules in 164 ms. Remains 500 /1320 variables (removed 820) and now considering 1200/2020 (removed 820) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5222058429088817036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12198012453321889835.kers'
[2026-05-23 15:50:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5222058429088817036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12198012453321889835.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1200 rows 500 cols 2400 entries
Finished phase 1 with 490 SingleSign rule and 0 generalized
[2026-05-23 15:50:09] [INFO ] Computed 10 invariants in 9 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12198012453321889835.kers
Total runtime 11 ms.
[2026-05-23 15:50:09] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-23 15:50:09] [INFO ] Invariant cache hit.
[2026-05-23 15:50:09] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Running 840 sub problems to find dead transitions.
[2026-05-23 15:50:09] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 840 unsolved
SMT process timed out in 30165ms, After SMT, problems are : Problem set: 0 solved, 840 unsolved
Search for dead transitions found 0 dead transitions in 30168ms
Starting structural reductions in LTL mode, iteration 1 : 500/1320 places, 1200/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31191 ms. Remains : 500/1320 places, 1200/2020 transitions.
[2026-05-23 15:50:40] [INFO ] Flatten gal took : 23 ms
[2026-05-23 15:50:40] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:50:40] [INFO ] Input system was already deterministic with 1200 transitions.
[2026-05-23 15:50:40] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:50:40] [INFO ] Flatten gal took : 21 ms
[2026-05-23 15:50:40] [INFO ] Time to serialize gal into /tmp/CTLFireability880096607891529518.gal : 6 ms
[2026-05-23 15:50:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8230559332688003950.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/CTLFireability880096607891529518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8230559332688003950.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.60764e+16,0.947325,9896,2,991,5,7893,6,0,3203,4323,0


Converting to forward existential form...Done !
original formula: AX(AX((TrainState_8_2_5==0)))
=> equivalent forward existential formula: [(EY(EY(Init)) * !((TrainState_8_2_5==0)))] = FALSE
(forward)formula 0,0,1.29046,10160,1,0,11,12635,9,2,4535,6054,3
FORMULA BART-PT-010-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1955 edges and 1320 vertex of which 1168 / 1320 are part of one of the 9 SCC in 1 ms
Free SCC test removed 1159 places
Ensure Unique test removed 1777 transitions
Reduce isomorphic transitions removed 1777 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 158 transition count 173
Reduce places removed 68 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 74 rules applied. Total rules applied 145 place count 90 transition count 167
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 84 transition count 164
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 154 place count 84 transition count 159
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 164 place count 79 transition count 159
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 73 transition count 153
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 73 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 73 transition count 152
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 181 place count 69 transition count 148
Iterating global reduction 4 with 4 rules applied. Total rules applied 185 place count 69 transition count 148
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 188 place count 66 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 191 place count 66 transition count 145
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 194 place count 63 transition count 142
Iterating global reduction 4 with 3 rules applied. Total rules applied 197 place count 63 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 199 place count 61 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 201 place count 61 transition count 140
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 59 transition count 138
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 59 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 206 place count 58 transition count 137
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 58 transition count 137
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 4 with 12 rules applied. Total rules applied 219 place count 52 transition count 131
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 52 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 51 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 225 place count 51 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 50 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 229 place count 50 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 231 place count 49 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 233 place count 49 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 235 place count 48 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 237 place count 48 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 239 place count 47 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 241 place count 47 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 243 place count 46 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 245 place count 46 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 247 place count 45 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 249 place count 45 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 251 place count 44 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 253 place count 44 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 255 place count 43 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 257 place count 43 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 259 place count 42 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 261 place count 42 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 263 place count 41 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 265 place count 41 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 267 place count 40 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 269 place count 40 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 271 place count 39 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 273 place count 39 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 275 place count 38 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 277 place count 38 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 279 place count 37 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 281 place count 37 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 283 place count 36 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 285 place count 36 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 287 place count 35 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 289 place count 35 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 291 place count 34 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 293 place count 34 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 295 place count 33 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 297 place count 33 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 299 place count 32 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 301 place count 32 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 303 place count 31 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 305 place count 31 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 307 place count 30 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 309 place count 30 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 311 place count 29 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 313 place count 29 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 315 place count 28 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 317 place count 28 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 319 place count 27 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 321 place count 27 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 323 place count 26 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 325 place count 26 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 327 place count 25 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 329 place count 25 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 331 place count 24 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 333 place count 24 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 335 place count 23 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 337 place count 23 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 339 place count 22 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 341 place count 22 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 343 place count 21 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 345 place count 21 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 36 with 2 rules applied. Total rules applied 347 place count 20 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 349 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 37 with 2 rules applied. Total rules applied 351 place count 19 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 37 with 3 rules applied. Total rules applied 354 place count 19 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 356 place count 18 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 39 with 6 rules applied. Total rules applied 362 place count 18 transition count 22
Applied a total of 362 rules in 49 ms. Remains 18 /1320 variables (removed 1302) and now considering 22/2020 (removed 1998) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3746058781695931742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9466552640558732869.kers'
[2026-05-23 15:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3746058781695931742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9466552640558732869.kers]
Normalized transition count is 21 out of 22 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 21 rows 13 cols 32 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-23 15:50:41] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9466552640558732869.kers
Total runtime 1 ms.
[2026-05-23 15:50:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 15:50:41] [INFO ] Invariant cache hit.
[2026-05-23 15:50:41] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-23 15:50:41] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-23 15:50:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 21/39 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 37 constraints, problems are : Problem set: 0 solved, 12 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 542ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/1320 places, 22/2020 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 684 ms. Remains : 18/1320 places, 22/2020 transitions.
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 0 ms
[2026-05-23 15:50:42] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 1 ms
[2026-05-23 15:50:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1358636981394387794.gal : 1 ms
[2026-05-23 15:50:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16589527992836083094.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/CTLFireability1358636981394387794.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16589527992836083094.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,512,0.010571,3852,2,33,5,135,5,0,95,86,0


Converting to forward existential form...Done !
original formula: AG(!(E((A((TrainState_4_1_39==1) U ((TrainState_5_1_8==1)||(TrainState_7_1_30==1))) + AG(((TrainState_8_1_5==1)||(TrainState_4_2_38==1)))...294
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,TRUE),(!((E(!(((TrainState_5_1_8==1)||(TrainState_7_1_30==1))) U (!((TrainState_4_1_39==...780
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 17/4/5
Hit Full ! (commute/partial/dont) 17/0/5
(forward)formula 0,0,0.023076,4400,1,0,10,718,40,2,451,450,20
FORMULA BART-PT-010-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 49 ms
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 49 ms
[2026-05-23 15:50:42] [INFO ] Applying decomposition
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 48 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/graph1865212160755474358.txt' '-o' '/tmp/graph1865212160755474358.bin' '-w' '/tmp/graph1865212160755474358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1865212160755474358.bin' '-l' '-1' '-v' '-w' '/tmp/graph1865212160755474358.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:50:42] [INFO ] Decomposing Gal with order
[2026-05-23 15:50:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:50:42] [INFO ] Removed a total of 172 redundant transitions.
[2026-05-23 15:50:42] [INFO ] Flatten gal took : 111 ms
[2026-05-23 15:50:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2026-05-23 15:50:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17594203527344886288.gal : 14 ms
[2026-05-23 15:50:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2011681320606703326.ctl : 5 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/CTLFireability17594203527344886288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2011681320606703326.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.60598e+21,0.714986,17196,461,75,9545,2897,1701,9358,240,2196,0


Converting to forward existential form...Done !
original formula: AF(!(A((((((((((((i0.i0.u367.TrainState_1_1_33==1)||(i2.i2.u269.TrainState_7_4_22==1))||((i0.i0.u171.TrainState_1_1_17==1)||(i9.i0.u29.Tr...82413
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((((((((((((i9.i0.u29.TrainState_10_0_0==1)||(i4.i1.u24.TrainState_5_0_0==1))||((i5.i0.u25...199760
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,32.4816,597212,1,0,1.04797e+06,294412,10469,3.71739e+06,1236,923004,396281
FORMULA BART-PT-010-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 765792 ms.

BK_STOP 1779551476109

--------------------
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="BART-PT-010"
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 BART-PT-010, 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 r018-smll-177946788000242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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