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-177946788100258.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-030, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 60M
-rw-r--r-- 1 mcc users 1.5M Mar 5 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Mar 5 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 742K Mar 5 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M Mar 5 09:32 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 804K Mar 15 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.1M Mar 15 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Mar 15 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Mar 15 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1M Mar 5 09:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15M Mar 5 09:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2M Mar 5 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14M Mar 5 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 94K Mar 15 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 189K Mar 15 07:24 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 7.1M 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-030-CTLFireability-2024-00
FORMULA_NAME BART-PT-030-CTLFireability-2024-01
FORMULA_NAME BART-PT-030-CTLFireability-2024-02
FORMULA_NAME BART-PT-030-CTLFireability-2024-03
FORMULA_NAME BART-PT-030-CTLFireability-2024-04
FORMULA_NAME BART-PT-030-CTLFireability-2024-05
FORMULA_NAME BART-PT-030-CTLFireability-2024-06
FORMULA_NAME BART-PT-030-CTLFireability-2024-07
FORMULA_NAME BART-PT-030-CTLFireability-2024-08
FORMULA_NAME BART-PT-030-CTLFireability-2024-09
FORMULA_NAME BART-PT-030-CTLFireability-2024-10
FORMULA_NAME BART-PT-030-CTLFireability-2024-11
FORMULA_NAME BART-PT-030-CTLFireability-2024-12
FORMULA_NAME BART-PT-030-CTLFireability-2024-13
FORMULA_NAME BART-PT-030-CTLFireability-2024-14
FORMULA_NAME BART-PT-030-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779553375963

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-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 16:22:58] [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 16:22:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:23:00] [INFO ] Load time of PNML (sax parser for PT used): 1246 ms
[2026-05-23 16:23:00] [INFO ] Transformed 4170 places.
[2026-05-23 16:23:00] [INFO ] Transformed 6060 transitions.
[2026-05-23 16:23:00] [INFO ] Found NUPN structural information;
[2026-05-23 16:23:00] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 1640 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 122 ms.
Reduce places removed 210 places and 0 transitions.
Support contains 3960 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 82 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (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-15284939503025261224.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9107970889188542674.kers'
[2026-05-23 16:23:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15284939503025261224.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9107970889188542674.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 6060 rows 3960 cols 12120 entries
Finished phase 1 with 3930 SingleSign rule and 0 generalized
[2026-05-23 16:23:01] [INFO ] Computed 30 invariants in 30 ms
Computed 30 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-9107970889188542674.kers
Total runtime 41 ms.
[2026-05-23 16:23:03] [INFO ] Implicit Places using invariants in 2325 ms returned []
[2026-05-23 16:23:03] [INFO ] Invariant cache hit.
[2026-05-23 16:23:09] [INFO ] Implicit Places using invariants and state equation in 5577 ms returned []
Implicit Place search using SMT with State Equation took 7986 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2026-05-23 16:23:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30340 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30157 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64327ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 64418ms
Finished structural reductions in LTL mode , in 1 iterations and 72608 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 42 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
[2026-05-23 16:24:13] [INFO ] Invariant cache hit.
[2026-05-23 16:24:15] [INFO ] Implicit Places using invariants in 1559 ms returned []
[2026-05-23 16:24:15] [INFO ] Invariant cache hit.
[2026-05-23 16:24:20] [INFO ] Implicit Places using invariants and state equation in 4848 ms returned []
Implicit Place search using SMT with State Equation took 6412 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6462 ms. Remains : 3960/3960 places, 6060/6060 transitions.
Support contains 3960 out of 3960 places after structural reductions.
[2026-05-23 16:24:21] [INFO ] Flatten gal took : 562 ms
[2026-05-23 16:24:22] [INFO ] Flatten gal took : 315 ms
[2026-05-23 16:24:22] [INFO ] Input system was already deterministic with 6060 transitions.
Reduction of identical properties reduced properties to check from 55 to 52
RANDOM walk for 40000 steps (8 resets) in 2987 ms. (13 steps per ms) remains 4/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
[2026-05-23 16:24:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1047/1056 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1056 variables, 1047/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1616/2672 variables, 1056/2120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2672 variables, 0/2120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/2672 variables, 0/2120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2672/10020 variables, and 2120 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1661 ms.
Refiners :[Domain max(s): 1056/3960 constraints, Positive P Invariants (semi-flows): 8/30 constraints, State Equation: 1056/3960 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1047/1056 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1056 variables, 1047/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1056 variables, 0/1064 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1616/2672 variables, 1056/2120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2672 variables, 3/2123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2672 variables, 0/2123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/2672 variables, 0/2123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2672/10020 variables, and 2123 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3700 ms.
Refiners :[Domain max(s): 1056/3960 constraints, Positive P Invariants (semi-flows): 8/30 constraints, State Equation: 1056/3960 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5453ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 38 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 20 ms.
[2026-05-23 16:24:30] [INFO ] Flatten gal took : 223 ms
[2026-05-23 16:24:30] [INFO ] Flatten gal took : 186 ms
[2026-05-23 16:24:31] [INFO ] Input system was already deterministic with 6060 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 3960 transition count 6030
Reduce places removed 30 places and 0 transitions.
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Iterating post reduction 1 with 270 rules applied. Total rules applied 300 place count 3930 transition count 5790
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 2 with 240 rules applied. Total rules applied 540 place count 3690 transition count 5790
Performed 420 Post agglomeration using F-continuation condition.Transition count delta: 420
Deduced a syphon composed of 420 places in 6 ms
Reduce places removed 420 places and 0 transitions.
Iterating global reduction 3 with 840 rules applied. Total rules applied 1380 place count 3270 transition count 5370
Applied a total of 1380 rules in 742 ms. Remains 3270 /3960 variables (removed 690) and now considering 5370/6060 (removed 690) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4492707163192365478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9261177338373046784.kers'
[2026-05-23 16:24:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4492707163192365478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9261177338373046784.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 5370 rows 3270 cols 10740 entries
Finished phase 1 with 3240 SingleSign rule and 0 generalized
[2026-05-23 16:24:32] [INFO ] Computed 30 invariants in 35 ms
Computed 30 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-9261177338373046784.kers
Total runtime 41 ms.
[2026-05-23 16:24:33] [INFO ] Implicit Places using invariants in 1213 ms returned []
[2026-05-23 16:24:33] [INFO ] Invariant cache hit.
[2026-05-23 16:24:38] [INFO ] Implicit Places using invariants and state equation in 4635 ms returned []
Implicit Place search using SMT with State Equation took 5855 ms to find 0 implicit places.
[2026-05-23 16:24:38] [INFO ] Redundant transitions in 788 ms returned []
Running 4290 sub problems to find dead transitions.
[2026-05-23 16:24:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 3240/3240 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3240/8640 variables, and 3240 constraints, problems are : Problem set: 0 solved, 4290 unsolved in 30155 ms.
Refiners :[Domain max(s): 3240/3270 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3270 constraints, PredecessorRefiner: 4290/4290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3240 variables, 3240/3240 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3240/8640 variables, and 3240 constraints, problems are : Problem set: 0 solved, 4290 unsolved in 30145 ms.
Refiners :[Domain max(s): 3240/3270 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3270 constraints, PredecessorRefiner: 0/4290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62645ms problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 62661ms
Starting structural reductions in SI_CTL mode, iteration 1 : 3270/3960 places, 5370/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70074 ms. Remains : 3270/3960 places, 5370/6060 transitions.
[2026-05-23 16:25:41] [INFO ] Flatten gal took : 124 ms
[2026-05-23 16:25:41] [INFO ] Flatten gal took : 142 ms
[2026-05-23 16:25:42] [INFO ] Input system was already deterministic with 5370 transitions.
[2026-05-23 16:25:42] [INFO ] Flatten gal took : 88 ms
[2026-05-23 16:25:42] [INFO ] Flatten gal took : 92 ms
[2026-05-23 16:25:42] [INFO ] Time to serialize gal into /tmp/CTLFireability17325081782777197521.gal : 55 ms
[2026-05-23 16:25:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16679467740458082419.ctl : 22 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/CTLFireability17325081782777197521.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16679467740458082419.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.32677e+61,19.5048,96532,2,6511,5,80165,6,0,18453,74559,0


Converting to forward existential form...Done !
original formula: AF(((AF((((((((((((TrainState_17_2_4==0)&&(TrainState_2_3_7==0))&&((TrainState_15_3_8==0)&&(TrainState_28_3_9==0)))&&(((TrainState_17_4_1...85285
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!((((((((((((TrainState_17_2_4==0)&&(TrainState_2_3_7==0))&&((TrainState_15_3_8==0)&&(TrainS...82650
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:26:12] [INFO ] Flatten gal took : 128 ms
[2026-05-23 16:26:12] [INFO ] Applying decomposition
[2026-05-23 16:26:12] [INFO ] Flatten gal took : 133 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/graph14751567785297870071.txt' '-o' '/tmp/graph14751567785297870071.bin' '-w' '/tmp/graph14751567785297870071.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14751567785297870071.bin' '-l' '-1' '-v' '-w' '/tmp/graph14751567785297870071.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:26:13] [INFO ] Decomposing Gal with order
[2026-05-23 16:26:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:26:15] [INFO ] Removed a total of 651 redundant transitions.
[2026-05-23 16:26:15] [INFO ] Flatten gal took : 504 ms
[2026-05-23 16:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 55 ms.
[2026-05-23 16:26:16] [INFO ] Time to serialize gal into /tmp/CTLFireability9033952298742990195.gal : 67 ms
[2026-05-23 16:26:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10562506794844919993.ctl : 19 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/CTLFireability9033952298742990195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10562506794844919993.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.32677e+61,3.26597,37956,787,85,22540,8403,2541,23713,371,8845,0


Converting to forward existential form...Done !
original formula: AF(((AF((((((((((((i28.i0.u9.TrainState_17_2_4==0)&&(i10.i0.u141.TrainState_2_3_7==0))&&((i26.i2.u108.TrainState_15_3_8==0)&&(i12.i1.u201...121212
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!((((((((((((i28.i0.u9.TrainState_17_2_4==0)&&(i10.i0.u141.TrainState_2_3_7==0))&&((i26.i2.u...121269
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,5.77677,80096,1,0,81635,156128,32703,158903,2603,201568,168452
FORMULA BART-PT-030-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 5340 edges and 3960 vertex of which 1230 / 3960 are part of one of the 30 SCC in 10 ms
Free SCC test removed 1200 places
Ensure Unique test removed 2250 transitions
Reduce isomorphic transitions removed 2250 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1680 transitions
Trivial Post-agglo rules discarded 1680 transitions
Performed 1680 trivial Post agglomeration. Transition count delta: 1680
Iterating post reduction 0 with 1680 rules applied. Total rules applied 1681 place count 2760 transition count 2130
Reduce places removed 1680 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 1 with 2040 rules applied. Total rules applied 3721 place count 1080 transition count 1770
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 2 with 360 rules applied. Total rules applied 4081 place count 960 transition count 1530
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 3 with 360 rules applied. Total rules applied 4441 place count 840 transition count 1290
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 4 with 240 rules applied. Total rules applied 4681 place count 720 transition count 1170
Discarding 150 places :
Symmetric choice reduction at 5 with 150 rule applications. Total rules 4831 place count 570 transition count 1020
Iterating global reduction 5 with 150 rules applied. Total rules applied 4981 place count 570 transition count 1020
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 5 with 150 rules applied. Total rules applied 5131 place count 570 transition count 870
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 6 with 30 rules applied. Total rules applied 5161 place count 570 transition count 840
Applied a total of 5161 rules in 224 ms. Remains 570 /3960 variables (removed 3390) and now considering 840/6060 (removed 5220) transitions.
[2026-05-23 16:26:22] [INFO ] Flow matrix only has 811 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14865729630259369537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3550713481315599820.kers'
[2026-05-23 16:26:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14865729630259369537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3550713481315599820.kers]
Normalized transition count is 810 out of 811 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 810 rows 570 cols 1620 entries
Finished phase 1 with 540 SingleSign rule and 0 generalized
[2026-05-23 16:26:22] [INFO ] Computed 30 invariants in 12 ms
Computed 30 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3550713481315599820.kers
Total runtime 14 ms.
[2026-05-23 16:26:22] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-23 16:26:22] [INFO ] Flow matrix only has 811 transitions (discarded 29 similar events)
[2026-05-23 16:26:22] [INFO ] Invariant cache hit.
[2026-05-23 16:26:23] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2026-05-23 16:26:23] [INFO ] Redundant transitions in 9 ms returned []
Running 540 sub problems to find dead transitions.
[2026-05-23 16:26:23] [INFO ] Flow matrix only has 811 transitions (discarded 29 similar events)
[2026-05-23 16:26:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 30/570 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 570/1381 variables, and 30 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 0/570 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (OVERLAPS) 30/570 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 570/1381 variables, and 30 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 0/570 constraints, PredecessorRefiner: 0/540 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in SI_CTL mode, iteration 1 : 570/3960 places, 840/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61116 ms. Remains : 570/3960 places, 840/6060 transitions.
[2026-05-23 16:27:23] [INFO ] Flatten gal took : 24 ms
[2026-05-23 16:27:23] [INFO ] Flatten gal took : 23 ms
[2026-05-23 16:27:23] [INFO ] Input system was already deterministic with 840 transitions.
RANDOM walk for 36 steps (0 resets) in 10 ms. (3 steps per ms) remains 0/1 properties
FORMULA BART-PT-030-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 16:27:23] [INFO ] Flatten gal took : 24 ms
[2026-05-23 16:27:23] [INFO ] Flatten gal took : 22 ms
[2026-05-23 16:27:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1510609885406459162.gal : 6 ms
[2026-05-23 16:27:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18293184338826721153.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1510609885406459162.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18293184338826721153.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 690 places :
Symmetric choice reduction at 0 with 690 rule applications. Total rules 690 place count 3270 transition count 5370
Iterating global reduction 0 with 690 rules applied. Total rules applied 1380 place count 3270 transition count 5370
Discarding 570 places :
Symmetric choice reduction at 0 with 570 rule applications. Total rules 1950 place count 2700 transition count 4800
Iterating global reduction 0 with 570 rules applied. Total rules applied 2520 place count 2700 transition count 4800
Applied a total of 2520 rules in 917 ms. Remains 2700 /3960 variables (removed 1260) and now considering 4800/6060 (removed 1260) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3413528806671303547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15181174173879071075.kers'
[2026-05-23 16:27:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3413528806671303547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15181174173879071075.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4800 rows 2700 cols 9600 entries
Finished phase 1 with 2670 SingleSign rule and 0 generalized
[2026-05-23 16:27:24] [INFO ] Computed 30 invariants in 23 ms
Computed 30 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-15181174173879071075.kers
Total runtime 29 ms.
[2026-05-23 16:27:25] [INFO ] Implicit Places using invariants in 590 ms returned []
[2026-05-23 16:27:25] [INFO ] Invariant cache hit.
[2026-05-23 16:27:28] [INFO ] Implicit Places using invariants and state equation in 3341 ms returned []
Implicit Place search using SMT with State Equation took 3941 ms to find 0 implicit places.
Running 3720 sub problems to find dead transitions.
[2026-05-23 16:27:28] [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 2670/7500 variables, and 0 constraints, problems are : Problem set: 0 solved, 3720 unsolved in 30130 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2700 constraints, PredecessorRefiner: 3720/3720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3720 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2670/7500 variables, and 0 constraints, problems are : Problem set: 0 solved, 3720 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/2700 constraints, PredecessorRefiner: 0/3720 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62222ms problems are : Problem set: 0 solved, 3720 unsolved
Search for dead transitions found 0 dead transitions in 62234ms
Starting structural reductions in LTL mode, iteration 1 : 2700/3960 places, 4800/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67110 ms. Remains : 2700/3960 places, 4800/6060 transitions.
[2026-05-23 16:28:31] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:28:31] [INFO ] Flatten gal took : 70 ms
[2026-05-23 16:28:31] [INFO ] Input system was already deterministic with 4800 transitions.
[2026-05-23 16:28:31] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:28:31] [INFO ] Flatten gal took : 69 ms
[2026-05-23 16:28:31] [INFO ] Time to serialize gal into /tmp/CTLFireability1269134954186467347.gal : 17 ms
[2026-05-23 16:28:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15804112157929169953.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1269134954186467347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15804112157929169953.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,4.23912e+58,13.7478,78684,2,5371,5,69038,6,0,15603,100595,0


Converting to forward existential form...Done !
original formula: EG(AF(EX(EG(((((((((((TrainState_17_2_4==0)&&(TrainState_2_3_7==0))&&((TrainState_15_3_8==0)&&(TrainState_28_3_9==0)))&&(((TrainState_17_...7089
Detected timeout of ITS tools.
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(EG(((((((((((TrainState_17_2_4==0)&&(TrainState_2_3_7==0))&&((TrainState_15_3_8==0)&&(Train...5198
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:29:01] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:29:01] [INFO ] Applying decomposition
[2026-05-23 16:29:01] [INFO ] Flatten gal took : 63 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/graph11293004300734825832.txt' '-o' '/tmp/graph11293004300734825832.bin' '-w' '/tmp/graph11293004300734825832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11293004300734825832.bin' '-l' '-1' '-v' '-w' '/tmp/graph11293004300734825832.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:29:01] [INFO ] Decomposing Gal with order
[2026-05-23 16:29:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:29:02] [INFO ] Removed a total of 363 redundant transitions.
[2026-05-23 16:29:02] [INFO ] Flatten gal took : 210 ms
[2026-05-23 16:29:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2026-05-23 16:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13218453979396489661.gal : 29 ms
[2026-05-23 16:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability11215411476502886456.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13218453979396489661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11215411476502886456.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23912e+58,2.48996,31964,1051,75,14764,2944,2071,14568,232,1860,0


Converting to forward existential form...Done !
original formula: EG(AF(EX(EG(((((((((((i3.u59.TrainState_17_2_4==0)&&(i23.u110.TrainState_2_3_7==0))&&((i2.u250.TrainState_15_3_8==0)&&(i29.u288.TrainStat...9393
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(EX(EG(((((((((((i3.u59.TrainState_17_2_4==0)&&(i23.u110.TrainState_2_3_7==0))&&((i2.u250.Train...9442
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,11.3329,266540,1,0,476383,38646,11023,1.39509e+06,890,124830,697110
FORMULA BART-PT-030-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 690 places :
Symmetric choice reduction at 0 with 690 rule applications. Total rules 690 place count 3270 transition count 5370
Iterating global reduction 0 with 690 rules applied. Total rules applied 1380 place count 3270 transition count 5370
Discarding 570 places :
Symmetric choice reduction at 0 with 570 rule applications. Total rules 1950 place count 2700 transition count 4800
Iterating global reduction 0 with 570 rules applied. Total rules applied 2520 place count 2700 transition count 4800
Applied a total of 2520 rules in 1049 ms. Remains 2700 /3960 variables (removed 1260) and now considering 4800/6060 (removed 1260) transitions.
[2026-05-23 16:29:15] [INFO ] Invariant cache hit.
[2026-05-23 16:29:15] [INFO ] Implicit Places using invariants in 704 ms returned []
[2026-05-23 16:29:15] [INFO ] Invariant cache hit.
[2026-05-23 16:29:19] [INFO ] Implicit Places using invariants and state equation in 3072 ms returned []
Implicit Place search using SMT with State Equation took 3779 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 2700/3960 places, 4800/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4829 ms. Remains : 2700/3960 places, 4800/6060 transitions.
[2026-05-23 16:29:19] [INFO ] Flatten gal took : 94 ms
[2026-05-23 16:29:19] [INFO ] Flatten gal took : 99 ms
[2026-05-23 16:29:19] [INFO ] Input system was already deterministic with 4800 transitions.
[2026-05-23 16:29:19] [INFO ] Flatten gal took : 96 ms
[2026-05-23 16:29:19] [INFO ] Flatten gal took : 95 ms
[2026-05-23 16:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2685717205951769705.gal : 15 ms
[2026-05-23 16:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4094867253881968152.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/CTLFireability2685717205951769705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4094867253881968152.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,4.23912e+58,14.6828,78704,2,5371,5,69038,6,0,15603,100595,0


Converting to forward existential form...Done !
original formula: EG((EX(((((((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))&&((TrainState_3_1_1==0)&&(TrainState_4_1_1==0)))&&(((TrainState_5_1_1==0)&&(Tra...7853
=> equivalent forward existential formula: [FwdG(Init,(EX(((((((TrainState_1_1_1==0)&&(TrainState_2_1_1==0))&&((TrainState_3_1_1==0)&&(TrainState_4_1_1==0)...4434
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:29:49] [INFO ] Flatten gal took : 61 ms
[2026-05-23 16:29:49] [INFO ] Applying decomposition
[2026-05-23 16:29:49] [INFO ] Flatten gal took : 81 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/graph18403299500124605840.txt' '-o' '/tmp/graph18403299500124605840.bin' '-w' '/tmp/graph18403299500124605840.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18403299500124605840.bin' '-l' '-1' '-v' '-w' '/tmp/graph18403299500124605840.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:29:50] [INFO ] Decomposing Gal with order
[2026-05-23 16:29:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:29:50] [INFO ] Removed a total of 381 redundant transitions.
[2026-05-23 16:29:50] [INFO ] Flatten gal took : 151 ms
[2026-05-23 16:29:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-23 16:29:50] [INFO ] Time to serialize gal into /tmp/CTLFireability16121275499251798931.gal : 27 ms
[2026-05-23 16:29:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10358089660803943602.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16121275499251798931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10358089660803943602.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.23912e+58,2.72416,31948,1071,75,14397,1727,2156,14791,232,1064,0


Converting to forward existential form...Done !
original formula: EG((EX(((((((i0.u0.TrainState_1_1_1==0)&&(i10.u19.TrainState_2_1_1==0))&&((i1.u20.TrainState_3_1_1==0)&&(i2.u56.TrainState_4_1_1==0)))&&(...10344
=> equivalent forward existential formula: [FwdG(Init,(EX(((((((i0.u0.TrainState_1_1_1==0)&&(i10.u19.TrainState_2_1_1==0))&&((i1.u20.TrainState_3_1_1==0)&&...10387
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,7.15881,126812,1,0,234435,9839,11502,491264,893,22515,375729
FORMULA BART-PT-030-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 60 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (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-6142096132414052507.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13137573614659334878.kers'
[2026-05-23 16:29:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6142096132414052507.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13137573614659334878.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 6060 rows 3960 cols 12120 entries
Finished phase 1 with 3930 SingleSign rule and 0 generalized
[2026-05-23 16:29:58] [INFO ] Computed 30 invariants in 30 ms
Computed 30 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-13137573614659334878.kers
Total runtime 37 ms.
[2026-05-23 16:29:59] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2026-05-23 16:29:59] [INFO ] Invariant cache hit.
[2026-05-23 16:30:04] [INFO ] Implicit Places using invariants and state equation in 5155 ms returned []
Implicit Place search using SMT with State Equation took 6419 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2026-05-23 16:30:04] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30162 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30161 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63211ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 63227ms
Finished structural reductions in LTL mode , in 1 iterations and 69729 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2026-05-23 16:31:07] [INFO ] Flatten gal took : 118 ms
[2026-05-23 16:31:08] [INFO ] Flatten gal took : 146 ms
[2026-05-23 16:31:08] [INFO ] Input system was already deterministic with 6060 transitions.
[2026-05-23 16:31:08] [INFO ] Flatten gal took : 142 ms
[2026-05-23 16:31:08] [INFO ] Flatten gal took : 141 ms
[2026-05-23 16:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17714999762580345841.gal : 21 ms
[2026-05-23 16:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability10567843396658648878.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/CTLFireability17714999762580345841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10567843396658648878.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-23 16:31:38] [INFO ] Flatten gal took : 90 ms
[2026-05-23 16:31:38] [INFO ] Applying decomposition
[2026-05-23 16:31:38] [INFO ] Flatten gal took : 98 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/graph17405253656448417014.txt' '-o' '/tmp/graph17405253656448417014.bin' '-w' '/tmp/graph17405253656448417014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17405253656448417014.bin' '-l' '-1' '-v' '-w' '/tmp/graph17405253656448417014.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:31:39] [INFO ] Decomposing Gal with order
[2026-05-23 16:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:31:40] [INFO ] Removed a total of 419 redundant transitions.
[2026-05-23 16:31:40] [INFO ] Flatten gal took : 205 ms
[2026-05-23 16:31:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2026-05-23 16:31:43] [INFO ] Time to serialize gal into /tmp/CTLFireability4777639919268426816.gal : 33 ms
[2026-05-23 16:31:43] [INFO ] Time to serialize properties into /tmp/CTLFireability18091033325491636602.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/CTLFireability4777639919268426816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18091033325491636602.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,4.14207e+63,4.87118,44632,1011,75,21554,3084,3232,20906,245,2660,0


Converting to forward existential form...Done !
original formula: AF(E((((((((((((((i27.i1.u794.TrainState_8_2_26==1)||(i6.i0.u346.TrainState_19_2_16==1))||((i26.i4.u372.TrainState_1_3_15==1)||(i22.i7.u9...223071
=> equivalent forward existential formula: [FwdG(Init,!(E((((((((((((((i27.i1.u794.TrainState_8_2_26==1)||(i6.i0.u346.TrainState_19_2_16==1))||((i26.i4.u37...223134
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,10.2003,97048,1,0,85861,244554,41050,125274,2071,286230,178690
FORMULA BART-PT-030-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 : 3960/3960 places, 6060/6060 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1920 transitions
Trivial Post-agglo rules discarded 1920 transitions
Performed 1920 trivial Post agglomeration. Transition count delta: 1920
Iterating post reduction 0 with 1920 rules applied. Total rules applied 1920 place count 3960 transition count 4140
Reduce places removed 1920 places and 0 transitions.
Iterating post reduction 1 with 1920 rules applied. Total rules applied 3840 place count 2040 transition count 4140
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 3840 place count 2040 transition count 4020
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 4080 place count 1920 transition count 4020
Discarding 180 places :
Symmetric choice reduction at 2 with 180 rule applications. Total rules 4260 place count 1740 transition count 3840
Iterating global reduction 2 with 180 rules applied. Total rules applied 4440 place count 1740 transition count 3840
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 4470 place count 1740 transition count 3810
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 4590 place count 1620 transition count 3690
Iterating global reduction 3 with 120 rules applied. Total rules applied 4710 place count 1620 transition count 3690
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 4800 place count 1530 transition count 3600
Iterating global reduction 3 with 90 rules applied. Total rules applied 4890 place count 1530 transition count 3600
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 4980 place count 1440 transition count 3510
Iterating global reduction 3 with 90 rules applied. Total rules applied 5070 place count 1440 transition count 3510
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 5130 place count 1380 transition count 3450
Iterating global reduction 3 with 60 rules applied. Total rules applied 5190 place count 1380 transition count 3450
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 5250 place count 1320 transition count 3390
Iterating global reduction 3 with 60 rules applied. Total rules applied 5310 place count 1320 transition count 3390
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 5340 place count 1290 transition count 3360
Iterating global reduction 3 with 30 rules applied. Total rules applied 5370 place count 1290 transition count 3360
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 3 with 360 rules applied. Total rules applied 5730 place count 1110 transition count 3180
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 3 with 60 rules applied. Total rules applied 5790 place count 1110 transition count 3120
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 5850 place count 1080 transition count 3090
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 4 with 60 rules applied. Total rules applied 5910 place count 1080 transition count 3030
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 5970 place count 1050 transition count 3000
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 60 rules applied. Total rules applied 6030 place count 1050 transition count 2940
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 6 with 60 rules applied. Total rules applied 6090 place count 1020 transition count 2910
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 6 with 60 rules applied. Total rules applied 6150 place count 1020 transition count 2850
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 7 with 60 rules applied. Total rules applied 6210 place count 990 transition count 2820
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 7 with 60 rules applied. Total rules applied 6270 place count 990 transition count 2760
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 8 with 60 rules applied. Total rules applied 6330 place count 960 transition count 2730
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 8 with 60 rules applied. Total rules applied 6390 place count 960 transition count 2670
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 9 with 60 rules applied. Total rules applied 6450 place count 930 transition count 2640
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 9 with 60 rules applied. Total rules applied 6510 place count 930 transition count 2580
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 10 with 60 rules applied. Total rules applied 6570 place count 900 transition count 2550
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 10 with 60 rules applied. Total rules applied 6630 place count 900 transition count 2490
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 11 with 60 rules applied. Total rules applied 6690 place count 870 transition count 2460
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 11 with 60 rules applied. Total rules applied 6750 place count 870 transition count 2400
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 12 with 60 rules applied. Total rules applied 6810 place count 840 transition count 2370
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 12 with 60 rules applied. Total rules applied 6870 place count 840 transition count 2310
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 13 with 60 rules applied. Total rules applied 6930 place count 810 transition count 2280
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 13 with 60 rules applied. Total rules applied 6990 place count 810 transition count 2220
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 14 with 60 rules applied. Total rules applied 7050 place count 780 transition count 2190
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 14 with 60 rules applied. Total rules applied 7110 place count 780 transition count 2130
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 15 with 60 rules applied. Total rules applied 7170 place count 750 transition count 2100
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 15 with 60 rules applied. Total rules applied 7230 place count 750 transition count 2040
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 16 with 60 rules applied. Total rules applied 7290 place count 720 transition count 2010
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 16 with 60 rules applied. Total rules applied 7350 place count 720 transition count 1950
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 17 with 60 rules applied. Total rules applied 7410 place count 690 transition count 1920
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 17 with 60 rules applied. Total rules applied 7470 place count 690 transition count 1860
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 18 with 60 rules applied. Total rules applied 7530 place count 660 transition count 1830
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 18 with 60 rules applied. Total rules applied 7590 place count 660 transition count 1770
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 19 with 60 rules applied. Total rules applied 7650 place count 630 transition count 1740
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 19 with 60 rules applied. Total rules applied 7710 place count 630 transition count 1680
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 20 with 60 rules applied. Total rules applied 7770 place count 600 transition count 1650
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 20 with 60 rules applied. Total rules applied 7830 place count 600 transition count 1590
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 21 with 60 rules applied. Total rules applied 7890 place count 570 transition count 1560
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 21 with 60 rules applied. Total rules applied 7950 place count 570 transition count 1500
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 22 with 60 rules applied. Total rules applied 8010 place count 540 transition count 1470
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 22 with 60 rules applied. Total rules applied 8070 place count 540 transition count 1410
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 23 with 60 rules applied. Total rules applied 8130 place count 510 transition count 1380
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 23 with 60 rules applied. Total rules applied 8190 place count 510 transition count 1320
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 24 with 60 rules applied. Total rules applied 8250 place count 480 transition count 1290
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 24 with 60 rules applied. Total rules applied 8310 place count 480 transition count 1230
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 25 with 60 rules applied. Total rules applied 8370 place count 450 transition count 1200
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 25 with 60 rules applied. Total rules applied 8430 place count 450 transition count 1140
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 26 with 60 rules applied. Total rules applied 8490 place count 420 transition count 1110
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 26 with 60 rules applied. Total rules applied 8550 place count 420 transition count 1050
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 27 with 60 rules applied. Total rules applied 8610 place count 390 transition count 1020
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 27 with 60 rules applied. Total rules applied 8670 place count 390 transition count 960
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 28 with 60 rules applied. Total rules applied 8730 place count 360 transition count 930
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 28 with 60 rules applied. Total rules applied 8790 place count 360 transition count 870
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 29 with 60 rules applied. Total rules applied 8850 place count 330 transition count 840
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 29 with 60 rules applied. Total rules applied 8910 place count 330 transition count 780
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 30 with 60 rules applied. Total rules applied 8970 place count 300 transition count 750
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 30 with 60 rules applied. Total rules applied 9030 place count 300 transition count 690
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 31 with 60 rules applied. Total rules applied 9090 place count 270 transition count 660
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 31 with 60 rules applied. Total rules applied 9150 place count 270 transition count 600
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 32 with 60 rules applied. Total rules applied 9210 place count 240 transition count 570
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 32 with 60 rules applied. Total rules applied 9270 place count 240 transition count 510
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 33 with 60 rules applied. Total rules applied 9330 place count 210 transition count 480
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 33 with 60 rules applied. Total rules applied 9390 place count 210 transition count 420
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 34 with 60 rules applied. Total rules applied 9450 place count 180 transition count 390
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 34 with 60 rules applied. Total rules applied 9510 place count 180 transition count 330
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 35 with 60 rules applied. Total rules applied 9570 place count 150 transition count 300
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 35 with 60 rules applied. Total rules applied 9630 place count 150 transition count 240
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 36 with 60 rules applied. Total rules applied 9690 place count 120 transition count 210
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 36 with 90 rules applied. Total rules applied 9780 place count 120 transition count 120
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 37 with 60 rules applied. Total rules applied 9840 place count 90 transition count 90
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 38 with 30 Pre rules applied. Total rules applied 9840 place count 90 transition count 60
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 38 with 60 rules applied. Total rules applied 9900 place count 60 transition count 60
Applied a total of 9900 rules in 2195 ms. Remains 60 /3960 variables (removed 3900) and now considering 60/6060 (removed 6000) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-332560483037316191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3227970042155549814.kers'
[2026-05-23 16:31:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-332560483037316191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3227970042155549814.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 60 rows 30 cols 60 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-23 16:31:55] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3227970042155549814.kers
Total runtime 1 ms.
[2026-05-23 16:31:55] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 16:31:55] [INFO ] Invariant cache hit.
[2026-05-23 16:31:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2026-05-23 16:31:56] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-23 16:31:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 30/60 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 60/120 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 30 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 30/60 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 60/120 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 120 constraints, problems are : Problem set: 0 solved, 30 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1654ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1654ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/3960 places, 60/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3969 ms. Remains : 60/3960 places, 60/6060 transitions.
[2026-05-23 16:31:57] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:31:57] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:31:57] [INFO ] Input system was already deterministic with 60 transitions.
[2026-05-23 16:31:57] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:31:57] [INFO ] Flatten gal took : 2 ms
[2026-05-23 16:31:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17719853838445848614.gal : 1 ms
[2026-05-23 16:31:57] [INFO ] Time to serialize properties into /tmp/CTLFireability14427841587313524499.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/CTLFireability17719853838445848614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14427841587313524499.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.07374e+09,0.01526,4140,2,91,5,389,6,0,303,238,0


Converting to forward existential form...Done !
original formula: EG(AF(((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1==1)))||(((TrainState_5_1_1==1)||(Trai...793
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((((((TrainState_1_1_1==1)||(TrainState_2_1_1==1))||((TrainState_3_1_1==1)||(TrainState_4_1_1=...842
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.052915,4556,1,0,5,3476,21,1,1297,504,8
FORMULA BART-PT-030-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 18 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (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-15099485194988211165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14416979374323732801.kers'
[2026-05-23 16:31:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15099485194988211165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14416979374323732801.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 6060 rows 3960 cols 12120 entries
Finished phase 1 with 3930 SingleSign rule and 0 generalized
[2026-05-23 16:31:57] [INFO ] Computed 30 invariants in 48 ms
Computed 30 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-14416979374323732801.kers
Total runtime 54 ms.
[2026-05-23 16:31:59] [INFO ] Implicit Places using invariants in 1548 ms returned []
[2026-05-23 16:31:59] [INFO ] Invariant cache hit.
[2026-05-23 16:32:04] [INFO ] Implicit Places using invariants and state equation in 4801 ms returned []
Implicit Place search using SMT with State Equation took 6352 ms to find 0 implicit places.
Running 4980 sub problems to find dead transitions.
[2026-05-23 16:32:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30162 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 4980/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3930 variables, 3930/3930 constraints. Problems are: Problem set: 0 solved, 4980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3930/10020 variables, and 3930 constraints, problems are : Problem set: 0 solved, 4980 unsolved in 30164 ms.
Refiners :[Domain max(s): 3930/3960 constraints, Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/3960 constraints, PredecessorRefiner: 0/4980 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63760ms problems are : Problem set: 0 solved, 4980 unsolved
Search for dead transitions found 0 dead transitions in 63774ms
Finished structural reductions in LTL mode , in 1 iterations and 70166 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2026-05-23 16:33:08] [INFO ] Flatten gal took : 119 ms
[2026-05-23 16:33:08] [INFO ] Flatten gal took : 156 ms
[2026-05-23 16:33:08] [INFO ] Input system was already deterministic with 6060 transitions.
[2026-05-23 16:33:08] [INFO ] Flatten gal took : 141 ms
[2026-05-23 16:33:09] [INFO ] Flatten gal took : 145 ms
[2026-05-23 16:33:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11263227006596523766.gal : 31 ms
[2026-05-23 16:33:09] [INFO ] Time to serialize properties into /tmp/CTLFireability4681625983231434032.ctl : 34 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/CTLFireability11263227006596523766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4681625983231434032.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 16:33:39] [INFO ] Flatten gal took : 94 ms
[2026-05-23 16:33:39] [INFO ] Applying decomposition
[2026-05-23 16:33:39] [INFO ] Flatten gal took : 97 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/graph10304991662730088109.txt' '-o' '/tmp/graph10304991662730088109.bin' '-w' '/tmp/graph10304991662730088109.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10304991662730088109.bin' '-l' '-1' '-v' '-w' '/tmp/graph10304991662730088109.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:33:39] [INFO ] Decomposing Gal with order
[2026-05-23 16:33:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:33:41] [INFO ] Removed a total of 483 redundant transitions.
[2026-05-23 16:33:41] [INFO ] Flatten gal took : 203 ms
[2026-05-23 16:33:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 20 ms.
[2026-05-23 16:33:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3442378268432317932.gal : 33 ms
[2026-05-23 16:33:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9267809994312845877.ctl : 16 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/CTLFireability3442378268432317932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9267809994312845877.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,4.14207e+63,5.26145,45056,1045,75,21740,3193,3165,21646,255,2806,0


Converting to forward existential form...Done !
original formula: AF(!(A((!(EX(((((((((((i20.i0.u26.TrainState_17_2_4==1)||(i13.i0.u118.TrainState_2_3_7==1))||((i7.i0.u147.TrainState_15_3_8==1)||(i19.i0....307511
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(E(TRUE U ((((((((((((((i22.i7.u823.TrainState_8_2_26==1)||(i8.i0.u357.TrainState_19_2_16==...747501
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,13.9742,76612,1,0,59692,179881,41922,71170,2087,191387,145269
FORMULA BART-PT-030-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Applied a total of 0 rules in 186 ms. Remains 3960 /3960 variables (removed 0) and now considering 6060/6060 (removed 0) transitions.
[2026-05-23 16:33:59] [INFO ] Invariant cache hit.
[2026-05-23 16:34:01] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2026-05-23 16:34:01] [INFO ] Invariant cache hit.
[2026-05-23 16:34:06] [INFO ] Implicit Places using invariants and state equation in 5238 ms returned []
Implicit Place search using SMT with State Equation took 6773 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 6962 ms. Remains : 3960/3960 places, 6060/6060 transitions.
[2026-05-23 16:34:06] [INFO ] Flatten gal took : 124 ms
[2026-05-23 16:34:06] [INFO ] Flatten gal took : 149 ms
[2026-05-23 16:34:07] [INFO ] Input system was already deterministic with 6060 transitions.
[2026-05-23 16:34:07] [INFO ] Flatten gal took : 138 ms
[2026-05-23 16:34:07] [INFO ] Flatten gal took : 142 ms
[2026-05-23 16:34:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8495389063893512021.gal : 32 ms
[2026-05-23 16:34:07] [INFO ] Time to serialize properties into /tmp/CTLFireability8407746140953384450.ctl : 12 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/CTLFireability8495389063893512021.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8407746140953384450.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 16:34:37] [INFO ] Flatten gal took : 86 ms
[2026-05-23 16:34:37] [INFO ] Applying decomposition
[2026-05-23 16:34:37] [INFO ] Flatten gal took : 87 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/graph5827344304345563977.txt' '-o' '/tmp/graph5827344304345563977.bin' '-w' '/tmp/graph5827344304345563977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5827344304345563977.bin' '-l' '-1' '-v' '-w' '/tmp/graph5827344304345563977.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:34:38] [INFO ] Decomposing Gal with order
[2026-05-23 16:34:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:34:39] [INFO ] Removed a total of 690 redundant transitions.
[2026-05-23 16:34:39] [INFO ] Flatten gal took : 198 ms
[2026-05-23 16:34:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2026-05-23 16:34:41] [INFO ] Time to serialize gal into /tmp/CTLFireability3740337723612715195.gal : 34 ms
[2026-05-23 16:34:41] [INFO ] Time to serialize properties into /tmp/CTLFireability9754377673853910994.ctl : 12 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/CTLFireability3740337723612715195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9754377673853910994.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,4.14207e+63,4.89164,44292,1383,75,33327,3295,3611,34838,249,2947,0


Converting to forward existential form...Done !
original formula: EX((EX(AG(((((((((((((i12.i0.u106.TrainState_20_1_5==0)&&(i1.i0.u71.TrainState_21_1_8==0))&&((i8.i0.u19.TrainState_18_2_6==0)&&(i28.i9.u1...205369
=> equivalent forward existential formula: [((EY(Init) * EX(!(E(TRUE U !(((((((((((((i12.i0.u106.TrainState_20_1_5==0)&&(i1.i0.u71.TrainState_21_1_8==0))&&...205444
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,11.22,160036,1,0,245169,213434,33311,476106,1821,278433,326109
FORMULA BART-PT-030-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 953 places :
Symmetric choice reduction at 0 with 953 rule applications. Total rules 953 place count 3007 transition count 5107
Iterating global reduction 0 with 953 rules applied. Total rules applied 1906 place count 3007 transition count 5107
Discarding 802 places :
Symmetric choice reduction at 0 with 802 rule applications. Total rules 2708 place count 2205 transition count 4305
Iterating global reduction 0 with 802 rules applied. Total rules applied 3510 place count 2205 transition count 4305
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3630 place count 2085 transition count 4185
Iterating global reduction 0 with 120 rules applied. Total rules applied 3750 place count 2085 transition count 4185
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3840 place count 1995 transition count 4095
Iterating global reduction 0 with 90 rules applied. Total rules applied 3930 place count 1995 transition count 4095
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4020 place count 1905 transition count 4005
Iterating global reduction 0 with 90 rules applied. Total rules applied 4110 place count 1905 transition count 4005
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4200 place count 1815 transition count 3915
Iterating global reduction 0 with 90 rules applied. Total rules applied 4290 place count 1815 transition count 3915
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4380 place count 1725 transition count 3825
Iterating global reduction 0 with 90 rules applied. Total rules applied 4470 place count 1725 transition count 3825
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4559 place count 1636 transition count 3736
Iterating global reduction 0 with 89 rules applied. Total rules applied 4648 place count 1636 transition count 3736
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4707 place count 1577 transition count 3677
Iterating global reduction 0 with 59 rules applied. Total rules applied 4766 place count 1577 transition count 3677
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 4824 place count 1519 transition count 3619
Iterating global reduction 0 with 58 rules applied. Total rules applied 4882 place count 1519 transition count 3619
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4911 place count 1490 transition count 3590
Iterating global reduction 0 with 29 rules applied. Total rules applied 4940 place count 1490 transition count 3590
Applied a total of 4940 rules in 1715 ms. Remains 1490 /3960 variables (removed 2470) and now considering 3590/6060 (removed 2470) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15533446754446333064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2724222256311934809.kers'
[2026-05-23 16:34:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15533446754446333064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2724222256311934809.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3590 rows 1490 cols 7180 entries
Finished phase 1 with 1460 SingleSign rule and 0 generalized
[2026-05-23 16:34:54] [INFO ] Computed 30 invariants in 22 ms
Computed 30 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-2724222256311934809.kers
Total runtime 27 ms.
[2026-05-23 16:34:55] [INFO ] Implicit Places using invariants in 457 ms returned []
[2026-05-23 16:34:55] [INFO ] Invariant cache hit.
[2026-05-23 16:34:57] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2359 ms to find 0 implicit places.
Running 2510 sub problems to find dead transitions.
[2026-05-23 16:34:57] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1460/5080 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1490 constraints, PredecessorRefiner: 2510/2510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2510 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1460/5080 variables, and 0 constraints, problems are : Problem set: 0 solved, 2510 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1490 constraints, PredecessorRefiner: 0/2510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61341ms problems are : Problem set: 0 solved, 2510 unsolved
Search for dead transitions found 0 dead transitions in 61353ms
Starting structural reductions in LTL mode, iteration 1 : 1490/3960 places, 3590/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65445 ms. Remains : 1490/3960 places, 3590/6060 transitions.
[2026-05-23 16:35:58] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:35:58] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:35:58] [INFO ] Input system was already deterministic with 3590 transitions.
[2026-05-23 16:35:58] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:35:59] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:35:59] [INFO ] Time to serialize gal into /tmp/CTLFireability84181536329811915.gal : 18 ms
[2026-05-23 16:35:59] [INFO ] Time to serialize properties into /tmp/CTLFireability1333532507450316077.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/CTLFireability84181536329811915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1333532507450316077.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.53323e+50,5.85093,41480,2,2951,5,23602,6,0,9553,12864,0


Converting to forward existential form...Done !
original formula: E((AG(EX((TrainState_10_3_31==1))) + (AX(EX(EX((TrainState_11_1_22==1)))) * ((TrainState_23_1_12==1) + E((((TrainState_20_1_15==1)&&(Trai...437
=> equivalent forward existential formula: [((FwdU(Init,(!(E(TRUE U !(EX((TrainState_10_3_31==1))))) + (!(EX(!(EX(EX((TrainState_11_1_22==1)))))) * ((Train...602
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-23 16:36:29] [INFO ] Flatten gal took : 45 ms
[2026-05-23 16:36:29] [INFO ] Applying decomposition
[2026-05-23 16:36:29] [INFO ] Flatten gal took : 58 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/graph4312107666130427716.txt' '-o' '/tmp/graph4312107666130427716.bin' '-w' '/tmp/graph4312107666130427716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4312107666130427716.bin' '-l' '-1' '-v' '-w' '/tmp/graph4312107666130427716.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:36:29] [INFO ] Decomposing Gal with order
[2026-05-23 16:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:36:29] [INFO ] Removed a total of 1157 redundant transitions.
[2026-05-23 16:36:29] [INFO ] Flatten gal took : 119 ms
[2026-05-23 16:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 21 ms.
[2026-05-23 16:36:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12773808785078337702.gal : 20 ms
[2026-05-23 16:36:29] [INFO ] Time to serialize properties into /tmp/CTLFireability726148989120014810.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/CTLFireability12773808785078337702.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability726148989120014810.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.53323e+50,0.994609,20424,204,25,1346,777,709,845,130,1216,0


Converting to forward existential form...Done !
original formula: E((AG(EX((i1.u258.TrainState_10_3_31==1))) + (AX(EX(EX((i9.u175.TrainState_11_1_22==1)))) * ((i7.u98.TrainState_23_1_12==1) + E((((i16.u1...555
=> equivalent forward existential formula: [((FwdU(Init,(!(E(TRUE U !(EX((i1.u258.TrainState_10_3_31==1))))) + (!(EX(!(EX(EX((i9.u175.TrainState_11_1_22==1...738
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,1.10508,20696,1,0,2340,1495,3395,1760,533,1609,7359
FORMULA BART-PT-030-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6048 edges and 3960 vertex of which 3950 / 3960 are part of one of the 30 SCC in 2 ms
Free SCC test removed 3920 places
Ensure Unique test removed 6014 transitions
Reduce isomorphic transitions removed 6014 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 14 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 34 place count 12 transition count 15
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 40 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 8 transition count 9
Applied a total of 44 rules in 19 ms. Remains 8 /3960 variables (removed 3952) and now considering 9/6060 (removed 6051) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5200412302130910030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5635897724885614600.kers'
[2026-05-23 16:36:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5200412302130910030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5635897724885614600.kers]
Normalized transition count is 8 out of 9 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 8 rows 4 cols 8 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-23 16:36:30] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5635897724885614600.kers
Total runtime 1 ms.
[2026-05-23 16:36:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-23 16:36:30] [INFO ] Invariant cache hit.
[2026-05-23 16:36:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2026-05-23 16:36:30] [INFO ] Redundant transitions in 1 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-23 16:36:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 20 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/8 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 variables, and 24 constraints, problems are : Problem set: 0 solved, 4 unsolved in 85 ms.
Refiners :[Domain max(s): 8/8 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/3960 places, 9/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 233 ms. Remains : 8/3960 places, 9/6060 transitions.
[2026-05-23 16:36:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:36:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:36:31] [INFO ] Input system was already deterministic with 9 transitions.
[2026-05-23 16:36:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:36:31] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:36:31] [INFO ] Time to serialize gal into /tmp/CTLFireability5476633995132146389.gal : 0 ms
[2026-05-23 16:36:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13682890519286502803.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/CTLFireability5476633995132146389.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13682890519286502803.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,16,0.003196,3780,2,25,5,77,5,0,42,48,0


Converting to forward existential form...Done !
original formula: (AF(EG(((TrainState_4_1_31==0) + EG((TrainState_12_2_26==0))))) * AF((EG((TrainState_19_1_18==1)) + (TrainState_13_2_20==1))))
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((TrainState_4_1_31==0) + EG((TrainState_12_2_26==0))))))] = FALSE * [FwdG(Init,!((EG((TrainSta...209
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.005403,4192,1,0,13,241,22,8,161,173,15
FORMULA BART-PT-030-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 5897 edges and 3960 vertex of which 3494 / 3960 are part of one of the 27 SCC in 2 ms
Free SCC test removed 3467 places
Ensure Unique test removed 5323 transitions
Reduce isomorphic transitions removed 5323 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 236 rules applied. Total rules applied 237 place count 478 transition count 501
Reduce places removed 222 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 224 rules applied. Total rules applied 461 place count 256 transition count 499
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 464 place count 255 transition count 497
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 3 with 3 rules applied. Total rules applied 467 place count 254 transition count 495
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 4 with 3 rules applied. Total rules applied 470 place count 253 transition count 493
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 5 with 11 rules applied. Total rules applied 481 place count 252 transition count 483
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 497 place count 243 transition count 476
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 497 place count 243 transition count 461
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 527 place count 228 transition count 461
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 548 place count 207 transition count 440
Iterating global reduction 7 with 21 rules applied. Total rules applied 569 place count 207 transition count 440
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 575 place count 207 transition count 434
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 587 place count 195 transition count 422
Iterating global reduction 8 with 12 rules applied. Total rules applied 599 place count 195 transition count 422
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 608 place count 186 transition count 413
Iterating global reduction 8 with 9 rules applied. Total rules applied 617 place count 186 transition count 413
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 626 place count 177 transition count 404
Iterating global reduction 8 with 9 rules applied. Total rules applied 635 place count 177 transition count 404
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 641 place count 171 transition count 398
Iterating global reduction 8 with 6 rules applied. Total rules applied 647 place count 171 transition count 398
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 653 place count 165 transition count 392
Iterating global reduction 8 with 6 rules applied. Total rules applied 659 place count 165 transition count 392
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 662 place count 162 transition count 389
Iterating global reduction 8 with 3 rules applied. Total rules applied 665 place count 162 transition count 389
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 707 place count 141 transition count 368
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 716 place count 141 transition count 359
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 9 with 6 rules applied. Total rules applied 722 place count 138 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 728 place count 138 transition count 350
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 734 place count 135 transition count 347
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 740 place count 135 transition count 341
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 11 with 6 rules applied. Total rules applied 746 place count 132 transition count 338
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 752 place count 132 transition count 332
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 12 with 6 rules applied. Total rules applied 758 place count 129 transition count 329
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 764 place count 129 transition count 323
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 13 with 6 rules applied. Total rules applied 770 place count 126 transition count 320
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 776 place count 126 transition count 314
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 14 with 6 rules applied. Total rules applied 782 place count 123 transition count 311
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 788 place count 123 transition count 305
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 15 with 6 rules applied. Total rules applied 794 place count 120 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 800 place count 120 transition count 296
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 16 with 6 rules applied. Total rules applied 806 place count 117 transition count 293
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 812 place count 117 transition count 287
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 17 with 6 rules applied. Total rules applied 818 place count 114 transition count 284
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 824 place count 114 transition count 278
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 18 with 6 rules applied. Total rules applied 830 place count 111 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 836 place count 111 transition count 269
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 19 with 6 rules applied. Total rules applied 842 place count 108 transition count 266
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 848 place count 108 transition count 260
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 20 with 6 rules applied. Total rules applied 854 place count 105 transition count 257
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 860 place count 105 transition count 251
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 21 with 6 rules applied. Total rules applied 866 place count 102 transition count 248
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 872 place count 102 transition count 242
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 22 with 6 rules applied. Total rules applied 878 place count 99 transition count 239
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 884 place count 99 transition count 233
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 23 with 6 rules applied. Total rules applied 890 place count 96 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 896 place count 96 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 24 with 4 rules applied. Total rules applied 900 place count 94 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 904 place count 94 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 25 with 4 rules applied. Total rules applied 908 place count 92 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 912 place count 92 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 26 with 4 rules applied. Total rules applied 916 place count 90 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 920 place count 90 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 27 with 4 rules applied. Total rules applied 924 place count 88 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 928 place count 88 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 28 with 4 rules applied. Total rules applied 932 place count 86 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 936 place count 86 transition count 194
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 29 with 4 rules applied. Total rules applied 940 place count 84 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 944 place count 84 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 30 with 4 rules applied. Total rules applied 948 place count 82 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 952 place count 82 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 31 with 4 rules applied. Total rules applied 956 place count 80 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 960 place count 80 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 32 with 4 rules applied. Total rules applied 964 place count 78 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 968 place count 78 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 33 with 4 rules applied. Total rules applied 972 place count 76 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 976 place count 76 transition count 164
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 980 place count 74 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 984 place count 74 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 35 with 4 rules applied. Total rules applied 988 place count 72 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 992 place count 72 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 36 with 4 rules applied. Total rules applied 996 place count 70 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 1000 place count 70 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 37 with 4 rules applied. Total rules applied 1004 place count 68 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 1008 place count 68 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 38 with 4 rules applied. Total rules applied 1012 place count 66 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 1016 place count 66 transition count 134
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 1020 place count 64 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 1024 place count 64 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 40 with 4 rules applied. Total rules applied 1028 place count 62 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 1032 place count 62 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 41 with 4 rules applied. Total rules applied 1036 place count 60 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 41 with 6 rules applied. Total rules applied 1042 place count 60 transition count 114
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 1046 place count 58 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 43 with 40 rules applied. Total rules applied 1086 place count 58 transition count 72
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 43 with 8 rules applied. Total rules applied 1094 place count 58 transition count 64
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 44 with 9 rules applied. Total rules applied 1103 place count 50 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 45 with 1 rules applied. Total rules applied 1104 place count 49 transition count 63
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 46 with 4 Pre rules applied. Total rules applied 1104 place count 49 transition count 59
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 1112 place count 45 transition count 59
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 46 with 4 rules applied. Total rules applied 1116 place count 45 transition count 55
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 46 with 4 rules applied. Total rules applied 1120 place count 45 transition count 51
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 1124 place count 41 transition count 51
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 1126 place count 41 transition count 49
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 48 with 2 rules applied. Total rules applied 1128 place count 41 transition count 47
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 49 with 2 rules applied. Total rules applied 1130 place count 39 transition count 47
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 1131 place count 39 transition count 46
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 1132 place count 39 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 51 with 1 rules applied. Total rules applied 1133 place count 38 transition count 45
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 1134 place count 38 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 52 with 1 rules applied. Total rules applied 1135 place count 38 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 53 with 1 rules applied. Total rules applied 1136 place count 37 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 54 with 1 rules applied. Total rules applied 1137 place count 37 transition count 43
Applied a total of 1137 rules in 139 ms. Remains 37 /3960 variables (removed 3923) and now considering 43/6060 (removed 6017) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17722913472980241804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13473238391391776590.kers'
[2026-05-23 16:36:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17722913472980241804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13473238391391776590.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 42 rows 26 cols 62 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-23 16:36:31] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13473238391391776590.kers
Total runtime 1 ms.
[2026-05-23 16:36:31] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-23 16:36:31] [INFO ] Invariant cache hit.
[2026-05-23 16:36:31] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-23 16:36:31] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2026-05-23 16:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 15/37 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 42/79 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/79 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 52 constraints, problems are : Problem set: 0 solved, 22 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 15/37 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 42/79 variables, 37/52 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 22/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 74 constraints, problems are : Problem set: 0 solved, 22 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1001ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/3960 places, 43/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1218 ms. Remains : 37/3960 places, 43/6060 transitions.
[2026-05-23 16:36:32] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:36:32] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:36:32] [INFO ] Input system was already deterministic with 43 transitions.
[2026-05-23 16:36:32] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:36:32] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:36:32] [INFO ] Time to serialize gal into /tmp/CTLFireability1222451674560783005.gal : 1 ms
[2026-05-23 16:36:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14548956823679064978.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1222451674560783005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14548956823679064978.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,393216,0.00736,4008,2,69,5,298,5,0,192,189,0


Converting to forward existential form...Done !
original formula: ((AG(((((((TrainState_17_4_12==0)&&((TrainState_1_1_12==1)||(TrainState_3_1_22==1))) * (A((TrainState_16_3_33==1) U (TrainState_4_3_28==1...559
=> equivalent forward existential formula: [(FwdU(((Init * !(!((E(!((TrainState_17_1_34==1)) U (!(!(!(E(TRUE U !(E(EG((TrainState_12_1_9==1)) U (TrainState...797
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 40/0/3
(forward)formula 0,0,0.033296,5044,1,0,39,4661,71,22,840,4775,39
FORMULA BART-PT-030-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 954 places :
Symmetric choice reduction at 0 with 954 rule applications. Total rules 954 place count 3006 transition count 5106
Iterating global reduction 0 with 954 rules applied. Total rules applied 1908 place count 3006 transition count 5106
Discarding 802 places :
Symmetric choice reduction at 0 with 802 rule applications. Total rules 2710 place count 2204 transition count 4304
Iterating global reduction 0 with 802 rules applied. Total rules applied 3512 place count 2204 transition count 4304
Discarding 119 places :
Symmetric choice reduction at 0 with 119 rule applications. Total rules 3631 place count 2085 transition count 4185
Iterating global reduction 0 with 119 rules applied. Total rules applied 3750 place count 2085 transition count 4185
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3839 place count 1996 transition count 4096
Iterating global reduction 0 with 89 rules applied. Total rules applied 3928 place count 1996 transition count 4096
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4016 place count 1908 transition count 4008
Iterating global reduction 0 with 88 rules applied. Total rules applied 4104 place count 1908 transition count 4008
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4192 place count 1820 transition count 3920
Iterating global reduction 0 with 88 rules applied. Total rules applied 4280 place count 1820 transition count 3920
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4368 place count 1732 transition count 3832
Iterating global reduction 0 with 88 rules applied. Total rules applied 4456 place count 1732 transition count 3832
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 4543 place count 1645 transition count 3745
Iterating global reduction 0 with 87 rules applied. Total rules applied 4630 place count 1645 transition count 3745
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4689 place count 1586 transition count 3686
Iterating global reduction 0 with 59 rules applied. Total rules applied 4748 place count 1586 transition count 3686
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 4806 place count 1528 transition count 3628
Iterating global reduction 0 with 58 rules applied. Total rules applied 4864 place count 1528 transition count 3628
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4894 place count 1498 transition count 3598
Iterating global reduction 0 with 30 rules applied. Total rules applied 4924 place count 1498 transition count 3598
Applied a total of 4924 rules in 2110 ms. Remains 1498 /3960 variables (removed 2462) and now considering 3598/6060 (removed 2462) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14976352403578879665.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-658655001267703224.kers'
[2026-05-23 16:36:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14976352403578879665.kers, --Pflows, --basisKERS=/tmp/petrispot-output-658655001267703224.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3598 rows 1498 cols 7196 entries
Finished phase 1 with 1468 SingleSign rule and 0 generalized
[2026-05-23 16:36:34] [INFO ] Computed 30 invariants in 14 ms
Computed 30 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-658655001267703224.kers
Total runtime 19 ms.
[2026-05-23 16:36:34] [INFO ] Implicit Places using invariants in 452 ms returned []
[2026-05-23 16:36:34] [INFO ] Invariant cache hit.
[2026-05-23 16:36:36] [INFO ] Implicit Places using invariants and state equation in 1964 ms returned []
Implicit Place search using SMT with State Equation took 2423 ms to find 0 implicit places.
Running 2518 sub problems to find dead transitions.
[2026-05-23 16:36:36] [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 1468/5096 variables, and 0 constraints, problems are : Problem set: 0 solved, 2518 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1498 constraints, PredecessorRefiner: 2518/2518 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2518 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1468/5096 variables, and 0 constraints, problems are : Problem set: 0 solved, 2518 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1498 constraints, PredecessorRefiner: 0/2518 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61162ms problems are : Problem set: 0 solved, 2518 unsolved
Search for dead transitions found 0 dead transitions in 61168ms
Starting structural reductions in LTL mode, iteration 1 : 1498/3960 places, 3598/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65720 ms. Remains : 1498/3960 places, 3598/6060 transitions.
[2026-05-23 16:37:38] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:37:38] [INFO ] Flatten gal took : 49 ms
[2026-05-23 16:37:38] [INFO ] Input system was already deterministic with 3598 transitions.
[2026-05-23 16:37:38] [INFO ] Flatten gal took : 47 ms
[2026-05-23 16:37:38] [INFO ] Flatten gal took : 49 ms
[2026-05-23 16:37:38] [INFO ] Time to serialize gal into /tmp/CTLFireability18261521522682537507.gal : 15 ms
[2026-05-23 16:37:38] [INFO ] Time to serialize properties into /tmp/CTLFireability7534122915058325799.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/CTLFireability18261521522682537507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7534122915058325799.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,8.67465e+50,6.40634,41724,2,3361,5,29473,6,0,9593,15671,0


Converting to forward existential form...Done !
original formula: (AG((AF((((TrainState_20_1_5==0)||(TrainState_9_1_18==0))||(TrainState_16_3_28==0))) * ((TrainState_28_4_11==1) + AG(AF((TrainState_17_0_...350
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !((EG(!(E((TrainState_8_1_24==1) U (TrainState_11_3_30==1)))) * !((E(!(E(!(EX((TrainState_14...929
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 16:38:08] [INFO ] Flatten gal took : 40 ms
[2026-05-23 16:38:08] [INFO ] Applying decomposition
[2026-05-23 16:38:08] [INFO ] Flatten gal took : 40 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/graph12755646755262184639.txt' '-o' '/tmp/graph12755646755262184639.bin' '-w' '/tmp/graph12755646755262184639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12755646755262184639.bin' '-l' '-1' '-v' '-w' '/tmp/graph12755646755262184639.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:38:08] [INFO ] Decomposing Gal with order
[2026-05-23 16:38:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:38:09] [INFO ] Removed a total of 1162 redundant transitions.
[2026-05-23 16:38:09] [INFO ] Flatten gal took : 137 ms
[2026-05-23 16:38:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 642 labels/synchronizations in 15 ms.
[2026-05-23 16:38:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11815339531148447568.gal : 18 ms
[2026-05-23 16:38:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16870466200135483089.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/CTLFireability11815339531148447568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16870466200135483089.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.67465e+50,0.887138,20516,221,25,1489,889,773,956,138,1368,0


Converting to forward existential form...Done !
original formula: (AG((AF((((i21.u52.TrainState_20_1_5==0)||(i5.u144.TrainState_9_1_18==0))||(i23.u229.TrainState_16_3_28==0))) * ((i15.u94.TrainState_28_4...442
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !((EG(!(E((i2.u166.TrainState_8_1_24==1) U (i20.u263.TrainState_11_3_30==1)))) * !((E(!(E(!(...1141
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,1,1.16094,20792,1,0,8821,2168,3706,13972,595,2433,19409
FORMULA BART-PT-030-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 960 places :
Symmetric choice reduction at 0 with 960 rule applications. Total rules 960 place count 3000 transition count 5100
Iterating global reduction 0 with 960 rules applied. Total rules applied 1920 place count 3000 transition count 5100
Discarding 810 places :
Symmetric choice reduction at 0 with 810 rule applications. Total rules 2730 place count 2190 transition count 4290
Iterating global reduction 0 with 810 rules applied. Total rules applied 3540 place count 2190 transition count 4290
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3660 place count 2070 transition count 4170
Iterating global reduction 0 with 120 rules applied. Total rules applied 3780 place count 2070 transition count 4170
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3870 place count 1980 transition count 4080
Iterating global reduction 0 with 90 rules applied. Total rules applied 3960 place count 1980 transition count 4080
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4050 place count 1890 transition count 3990
Iterating global reduction 0 with 90 rules applied. Total rules applied 4140 place count 1890 transition count 3990
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4230 place count 1800 transition count 3900
Iterating global reduction 0 with 90 rules applied. Total rules applied 4320 place count 1800 transition count 3900
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4410 place count 1710 transition count 3810
Iterating global reduction 0 with 90 rules applied. Total rules applied 4500 place count 1710 transition count 3810
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 4590 place count 1620 transition count 3720
Iterating global reduction 0 with 90 rules applied. Total rules applied 4680 place count 1620 transition count 3720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4740 place count 1560 transition count 3660
Iterating global reduction 0 with 60 rules applied. Total rules applied 4800 place count 1560 transition count 3660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 4860 place count 1500 transition count 3600
Iterating global reduction 0 with 60 rules applied. Total rules applied 4920 place count 1500 transition count 3600
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 4950 place count 1470 transition count 3570
Iterating global reduction 0 with 30 rules applied. Total rules applied 4980 place count 1470 transition count 3570
Applied a total of 4980 rules in 1895 ms. Remains 1470 /3960 variables (removed 2490) and now considering 3570/6060 (removed 2490) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7003461094907909009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15547691857764161523.kers'
[2026-05-23 16:38:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7003461094907909009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15547691857764161523.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3570 rows 1470 cols 7140 entries
Finished phase 1 with 1440 SingleSign rule and 0 generalized
[2026-05-23 16:38:12] [INFO ] Computed 30 invariants in 16 ms
Computed 30 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-15547691857764161523.kers
Total runtime 31 ms.
[2026-05-23 16:38:12] [INFO ] Implicit Places using invariants in 363 ms returned []
[2026-05-23 16:38:12] [INFO ] Invariant cache hit.
[2026-05-23 16:38:14] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2026-05-23 16:38:14] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 2490/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1470 constraints, PredecessorRefiner: 0/2490 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61118ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 61123ms
Starting structural reductions in LTL mode, iteration 1 : 1470/3960 places, 3570/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65115 ms. Remains : 1470/3960 places, 3570/6060 transitions.
[2026-05-23 16:39:15] [INFO ] Flatten gal took : 61 ms
[2026-05-23 16:39:15] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:39:15] [INFO ] Input system was already deterministic with 3570 transitions.
[2026-05-23 16:39:15] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:39:15] [INFO ] Flatten gal took : 77 ms
[2026-05-23 16:39:15] [INFO ] Time to serialize gal into /tmp/CTLFireability990550830600197868.gal : 16 ms
[2026-05-23 16:39:15] [INFO ] Time to serialize properties into /tmp/CTLFireability16016877106068565136.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/CTLFireability990550830600197868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16016877106068565136.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,5.08022e+50,6.52374,40996,2,2916,5,22988,6,0,9453,12401,0


Converting to forward existential form...Done !
original formula: EX(AG((TrainState_12_0_0==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((TrainState_12_0_0==1)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,29.1916,348172,1,0,6,2.1553e+06,15,0,37815,20390,5
FORMULA BART-PT-030-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 957 places :
Symmetric choice reduction at 0 with 957 rule applications. Total rules 957 place count 3003 transition count 5103
Iterating global reduction 0 with 957 rules applied. Total rules applied 1914 place count 3003 transition count 5103
Discarding 807 places :
Symmetric choice reduction at 0 with 807 rule applications. Total rules 2721 place count 2196 transition count 4296
Iterating global reduction 0 with 807 rules applied. Total rules applied 3528 place count 2196 transition count 4296
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 3648 place count 2076 transition count 4176
Iterating global reduction 0 with 120 rules applied. Total rules applied 3768 place count 2076 transition count 4176
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 3858 place count 1986 transition count 4086
Iterating global reduction 0 with 90 rules applied. Total rules applied 3948 place count 1986 transition count 4086
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4037 place count 1897 transition count 3997
Iterating global reduction 0 with 89 rules applied. Total rules applied 4126 place count 1897 transition count 3997
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4215 place count 1808 transition count 3908
Iterating global reduction 0 with 89 rules applied. Total rules applied 4304 place count 1808 transition count 3908
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4393 place count 1719 transition count 3819
Iterating global reduction 0 with 89 rules applied. Total rules applied 4482 place count 1719 transition count 3819
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 4571 place count 1630 transition count 3730
Iterating global reduction 0 with 89 rules applied. Total rules applied 4660 place count 1630 transition count 3730
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4719 place count 1571 transition count 3671
Iterating global reduction 0 with 59 rules applied. Total rules applied 4778 place count 1571 transition count 3671
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 4837 place count 1512 transition count 3612
Iterating global reduction 0 with 59 rules applied. Total rules applied 4896 place count 1512 transition count 3612
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 4925 place count 1483 transition count 3583
Iterating global reduction 0 with 29 rules applied. Total rules applied 4954 place count 1483 transition count 3583
Applied a total of 4954 rules in 1732 ms. Remains 1483 /3960 variables (removed 2477) and now considering 3583/6060 (removed 2477) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1296083370084643153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18274688136668219429.kers'
[2026-05-23 16:39:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1296083370084643153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18274688136668219429.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3583 rows 1483 cols 7166 entries
Finished phase 1 with 1453 SingleSign rule and 0 generalized
[2026-05-23 16:39:47] [INFO ] Computed 30 invariants in 14 ms
Computed 30 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-18274688136668219429.kers
Total runtime 21 ms.
[2026-05-23 16:39:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-23 16:39:47] [INFO ] Invariant cache hit.
[2026-05-23 16:39:48] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1815 ms to find 0 implicit places.
Running 2503 sub problems to find dead transitions.
[2026-05-23 16:39:48] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1453/5066 variables, and 0 constraints, problems are : Problem set: 0 solved, 2503 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1483 constraints, PredecessorRefiner: 2503/2503 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2503 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1453/5066 variables, and 0 constraints, problems are : Problem set: 0 solved, 2503 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1483 constraints, PredecessorRefiner: 0/2503 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60984ms problems are : Problem set: 0 solved, 2503 unsolved
Search for dead transitions found 0 dead transitions in 60988ms
Starting structural reductions in LTL mode, iteration 1 : 1483/3960 places, 3583/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64543 ms. Remains : 1483/3960 places, 3583/6060 transitions.
[2026-05-23 16:40:49] [INFO ] Flatten gal took : 61 ms
[2026-05-23 16:40:49] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:40:50] [INFO ] Input system was already deterministic with 3583 transitions.
[2026-05-23 16:40:50] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:40:50] [INFO ] Flatten gal took : 65 ms
[2026-05-23 16:40:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14955096458573087660.gal : 18 ms
[2026-05-23 16:40:50] [INFO ] Time to serialize properties into /tmp/CTLFireability14392311962738347077.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14955096458573087660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14392311962738347077.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51422e+50,5.97856,41340,2,3144,5,26318,6,0,9518,14086,0


Converting to forward existential form...Done !
original formula: (EX(EX(EX((TrainState_4_3_22==1)))) * AF(((!(A(((TrainState_15_3_8==1) * EG((TrainState_2_1_10==1))) U (TrainState_13_1_15==1))) * (Train...200
=> equivalent forward existential formula: ([(Init * !(EX(EX(EX((TrainState_4_3_22==1))))))] = FALSE * [FwdG(Init,!(((!(!((E(!((TrainState_13_1_15==1)) U (...342
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 16:41:20] [INFO ] Flatten gal took : 37 ms
[2026-05-23 16:41:20] [INFO ] Applying decomposition
[2026-05-23 16:41:20] [INFO ] Flatten gal took : 38 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/graph16040236801724145046.txt' '-o' '/tmp/graph16040236801724145046.bin' '-w' '/tmp/graph16040236801724145046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16040236801724145046.bin' '-l' '-1' '-v' '-w' '/tmp/graph16040236801724145046.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:41:20] [INFO ] Decomposing Gal with order
[2026-05-23 16:41:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:41:20] [INFO ] Removed a total of 1163 redundant transitions.
[2026-05-23 16:41:20] [INFO ] Flatten gal took : 87 ms
[2026-05-23 16:41:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 640 labels/synchronizations in 9 ms.
[2026-05-23 16:41:20] [INFO ] Time to serialize gal into /tmp/CTLFireability6958499714931623259.gal : 13 ms
[2026-05-23 16:41:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15673477651992729930.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6958499714931623259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15673477651992729930.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.51422e+50,0.949374,20400,182,21,1131,720,674,712,120,1127,0


Converting to forward existential form...Done !
original formula: (EX(EX(EX((i16.u201.TrainState_4_3_22==1)))) * AF(((!(A(((i6.u73.TrainState_15_3_8==1) * EG((i2.u92.TrainState_2_1_10==1))) U (i22.u126.T...247
=> equivalent forward existential formula: ([(Init * !(EX(EX(EX((i16.u201.TrainState_4_3_22==1))))))] = FALSE * [FwdG(Init,!(((!(!((E(!((i22.u126.TrainStat...407
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
(forward)formula 0,0,1.41286,22460,1,0,35738,1546,3470,42606,529,2677,28649
FORMULA BART-PT-030-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6058 edges and 3960 vertex of which 3958 / 3960 are part of one of the 30 SCC in 2 ms
Free SCC test removed 3928 places
Ensure Unique test removed 6027 transitions
Reduce isomorphic transitions removed 6027 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 3 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 30 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 2 transition count 3
Applied a total of 32 rules in 15 ms. Remains 2 /3960 variables (removed 3958) and now considering 3/6060 (removed 6057) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12548624109013833963.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10660328189584959150.kers'
[2026-05-23 16:41:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12548624109013833963.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10660328189584959150.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 16:41:22] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10660328189584959150.kers
Total runtime 1 ms.
[2026-05-23 16:41:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 16:41:22] [INFO ] Invariant cache hit.
[2026-05-23 16:41:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2026-05-23 16:41:22] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 16:41:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Domain max(s): 2/2 constraints, 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Domain max(s): 2/2 constraints, 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/3960 places, 3/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 173 ms. Remains : 2/3960 places, 3/6060 transitions.
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:41:22] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 0 ms
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA BART-PT-030-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-23 16:41:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1950371378493110178.gal : 0 ms
[2026-05-23 16:41:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16872054968656851670.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1950371378493110178.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16872054968656851670.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16872054968656851670.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.005843,3808,2,4,5,12,5,0,13,6,0
Total reachable state count : 2

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Graph (trivial) has 6010 edges and 3960 vertex of which 3803 / 3960 are part of one of the 29 SCC in 3 ms
Free SCC test removed 3774 places
Ensure Unique test removed 5794 transitions
Reduce isomorphic transitions removed 5794 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 162 transition count 169
Reduce places removed 74 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 76 rules applied. Total rules applied 174 place count 88 transition count 167
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 177 place count 87 transition count 165
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 183 place count 86 transition count 160
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 188 place count 82 transition count 159
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 188 place count 82 transition count 154
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 198 place count 77 transition count 154
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 205 place count 70 transition count 147
Iterating global reduction 5 with 7 rules applied. Total rules applied 212 place count 70 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 214 place count 70 transition count 145
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 218 place count 66 transition count 141
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 66 transition count 141
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 225 place count 63 transition count 138
Iterating global reduction 6 with 3 rules applied. Total rules applied 228 place count 63 transition count 138
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 231 place count 60 transition count 135
Iterating global reduction 6 with 3 rules applied. Total rules applied 234 place count 60 transition count 135
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 236 place count 58 transition count 133
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 58 transition count 133
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 240 place count 56 transition count 131
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 56 transition count 131
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 55 transition count 130
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 55 transition count 130
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 6 with 12 rules applied. Total rules applied 256 place count 49 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 258 place count 49 transition count 122
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 260 place count 48 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 262 place count 48 transition count 119
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 264 place count 47 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 266 place count 47 transition count 116
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 268 place count 46 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 270 place count 46 transition count 113
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 272 place count 45 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 274 place count 45 transition count 110
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 276 place count 44 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 278 place count 44 transition count 107
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 280 place count 43 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 282 place count 43 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 13 with 2 rules applied. Total rules applied 284 place count 42 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 286 place count 42 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 14 with 2 rules applied. Total rules applied 288 place count 41 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 290 place count 41 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 15 with 2 rules applied. Total rules applied 292 place count 40 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 294 place count 40 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 16 with 2 rules applied. Total rules applied 296 place count 39 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 298 place count 39 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 17 with 2 rules applied. Total rules applied 300 place count 38 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 302 place count 38 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 18 with 2 rules applied. Total rules applied 304 place count 37 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 306 place count 37 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 19 with 2 rules applied. Total rules applied 308 place count 36 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 310 place count 36 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 20 with 2 rules applied. Total rules applied 312 place count 35 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 314 place count 35 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 21 with 2 rules applied. Total rules applied 316 place count 34 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 318 place count 34 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 22 with 2 rules applied. Total rules applied 320 place count 33 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 322 place count 33 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 23 with 2 rules applied. Total rules applied 324 place count 32 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 326 place count 32 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 24 with 2 rules applied. Total rules applied 328 place count 31 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 330 place count 31 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 25 with 2 rules applied. Total rules applied 332 place count 30 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 334 place count 30 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 26 with 2 rules applied. Total rules applied 336 place count 29 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 338 place count 29 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 27 with 2 rules applied. Total rules applied 340 place count 28 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 342 place count 28 transition count 59
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 28 with 2 rules applied. Total rules applied 344 place count 27 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 346 place count 27 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 29 with 2 rules applied. Total rules applied 348 place count 26 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 350 place count 26 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 30 with 2 rules applied. Total rules applied 352 place count 25 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 354 place count 25 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 31 with 2 rules applied. Total rules applied 356 place count 24 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 358 place count 24 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 32 with 2 rules applied. Total rules applied 360 place count 23 transition count 46
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 362 place count 23 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 33 with 2 rules applied. Total rules applied 364 place count 22 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 366 place count 22 transition count 41
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 368 place count 21 transition count 40
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 370 place count 21 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 35 with 2 rules applied. Total rules applied 372 place count 20 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 374 place count 20 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 36 with 2 rules applied. Total rules applied 376 place count 19 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 36 with 2 rules applied. Total rules applied 378 place count 19 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 37 with 2 rules applied. Total rules applied 380 place count 18 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 37 with 2 rules applied. Total rules applied 382 place count 18 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 38 with 2 rules applied. Total rules applied 384 place count 17 transition count 28
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 38 with 2 rules applied. Total rules applied 386 place count 17 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 39 with 2 rules applied. Total rules applied 388 place count 16 transition count 25
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 39 with 3 rules applied. Total rules applied 391 place count 16 transition count 22
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 40 with 2 rules applied. Total rules applied 393 place count 15 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 41 with 5 rules applied. Total rules applied 398 place count 15 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 41 with 3 Pre rules applied. Total rules applied 398 place count 15 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 41 with 6 rules applied. Total rules applied 404 place count 12 transition count 13
Applied a total of 404 rules in 37 ms. Remains 12 /3960 variables (removed 3948) and now considering 13/6060 (removed 6047) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15595508831818118808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9832693780740004148.kers'
[2026-05-23 16:41:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15595508831818118808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9832693780740004148.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 12 rows 6 cols 12 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-23 16:41:22] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9832693780740004148.kers
Total runtime 1 ms.
[2026-05-23 16:41:22] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 16:41:22] [INFO ] Invariant cache hit.
[2026-05-23 16:41:22] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2026-05-23 16:41:22] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-23 16:41:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 12/24 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 24 constraints, problems are : Problem set: 0 solved, 6 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Starting structural reductions in SI_CTL mode, iteration 1 : 12/3960 places, 13/6060 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 330 ms. Remains : 12/3960 places, 13/6060 transitions.
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:41:22] [INFO ] Input system was already deterministic with 13 transitions.
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:41:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15872851304389399875.gal : 0 ms
[2026-05-23 16:41:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5479403414638003637.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/CTLFireability15872851304389399875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5479403414638003637.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,64,0.005986,3800,2,22,5,84,5,0,62,51,0


Converting to forward existential form...Done !
original formula: EF(EG((EG((TrainState_20_4_16==0)) + (AF((TrainState_22_1_14==0)) * (((TrainState_17_3_34==0)&&(TrainState_26_2_32==0))||((TrainState_8_3...192
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EG((TrainState_20_4_16==0)) + (!(EG(!((TrainState_22_1_14==0)))) * (((TrainState_17_3_34=...248
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.011971,4348,1,0,11,409,30,4,248,361,13
FORMULA BART-PT-030-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 112 ms
[2026-05-23 16:41:22] [INFO ] Flatten gal took : 117 ms
Total runtime 1104462 ms.

BK_STOP 1779554483080

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

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