fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r018-smll-177946788100257
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for BART-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1758.044 763137.00 902651.00 2427.60 FFFFTTFTFTTFTFTT normal

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-177946788100257.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100257
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME BART-PT-030-CTLCardinality-2024-01
FORMULA_NAME BART-PT-030-CTLCardinality-2024-02
FORMULA_NAME BART-PT-030-CTLCardinality-2024-03
FORMULA_NAME BART-PT-030-CTLCardinality-2024-04
FORMULA_NAME BART-PT-030-CTLCardinality-2024-05
FORMULA_NAME BART-PT-030-CTLCardinality-2024-06
FORMULA_NAME BART-PT-030-CTLCardinality-2024-07
FORMULA_NAME BART-PT-030-CTLCardinality-2024-08
FORMULA_NAME BART-PT-030-CTLCardinality-2024-09
FORMULA_NAME BART-PT-030-CTLCardinality-2024-10
FORMULA_NAME BART-PT-030-CTLCardinality-2024-11
FORMULA_NAME BART-PT-030-CTLCardinality-2024-12
FORMULA_NAME BART-PT-030-CTLCardinality-2024-13
FORMULA_NAME BART-PT-030-CTLCardinality-2024-14
FORMULA_NAME BART-PT-030-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779553332726

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202604301425
[2026-05-23 16:22:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:22:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:22:16] [INFO ] Load time of PNML (sax parser for PT used): 1162 ms
[2026-05-23 16:22:16] [INFO ] Transformed 4170 places.
[2026-05-23 16:22:16] [INFO ] Transformed 6060 transitions.
[2026-05-23 16:22:16] [INFO ] Found NUPN structural information;
[2026-05-23 16:22:16] [INFO ] Parsed PT model containing 4170 places and 6060 transitions and 48600 arcs in 1431 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 332 ms.
Reduce places removed 210 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BART-PT-030-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 3960 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3960/3960 places, 6060/6060 transitions.
Discarding 950 places :
Symmetric choice reduction at 0 with 950 rule applications. Total rules 950 place count 3010 transition count 5110
Iterating global reduction 0 with 950 rules applied. Total rules applied 1900 place count 3010 transition count 5110
Discarding 795 places :
Symmetric choice reduction at 0 with 795 rule applications. Total rules 2695 place count 2215 transition count 4315
Iterating global reduction 0 with 795 rules applied. Total rules applied 3490 place count 2215 transition count 4315
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 3607 place count 2098 transition count 4198
Iterating global reduction 0 with 117 rules applied. Total rules applied 3724 place count 2098 transition count 4198
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 3813 place count 2009 transition count 4109
Iterating global reduction 0 with 89 rules applied. Total rules applied 3902 place count 2009 transition count 4109
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 3990 place count 1921 transition count 4021
Iterating global reduction 0 with 88 rules applied. Total rules applied 4078 place count 1921 transition count 4021
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 4166 place count 1833 transition count 3933
Iterating global reduction 0 with 88 rules applied. Total rules applied 4254 place count 1833 transition count 3933
Discarding 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 4339 place count 1748 transition count 3848
Iterating global reduction 0 with 85 rules applied. Total rules applied 4424 place count 1748 transition count 3848
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 4508 place count 1664 transition count 3764
Iterating global reduction 0 with 84 rules applied. Total rules applied 4592 place count 1664 transition count 3764
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 4649 place count 1607 transition count 3707
Iterating global reduction 0 with 57 rules applied. Total rules applied 4706 place count 1607 transition count 3707
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 4763 place count 1550 transition count 3650
Iterating global reduction 0 with 57 rules applied. Total rules applied 4820 place count 1550 transition count 3650
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 4848 place count 1522 transition count 3622
Iterating global reduction 0 with 28 rules applied. Total rules applied 4876 place count 1522 transition count 3622
Applied a total of 4876 rules in 3850 ms. Remains 1522 /3960 variables (removed 2438) and now considering 3622/6060 (removed 2438) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4429154305477339227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2738340209682306289.kers'
[2026-05-23 16:22:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4429154305477339227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2738340209682306289.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3622 rows 1522 cols 7244 entries
Finished phase 1 with 1492 SingleSign rule and 0 generalized
[2026-05-23 16:22:21] [INFO ] Computed 30 invariants in 25 ms
Computed 30 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-2738340209682306289.kers
Total runtime 37 ms.
[2026-05-23 16:22:22] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2026-05-23 16:22:22] [INFO ] Invariant cache hit.
[2026-05-23 16:22:24] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 3866 ms to find 0 implicit places.
Running 2542 sub problems to find dead transitions.
[2026-05-23 16:22:25] [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 1492/5144 variables, and 0 constraints, problems are : Problem set: 0 solved, 2542 unsolved in 30183 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 2542/2542 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2542 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1492/5144 variables, and 0 constraints, problems are : Problem set: 0 solved, 2542 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1522 constraints, PredecessorRefiner: 0/2542 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61906ms problems are : Problem set: 0 solved, 2542 unsolved
Search for dead transitions found 0 dead transitions in 61947ms
Starting structural reductions in LTL mode, iteration 1 : 1522/3960 places, 3622/6060 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69733 ms. Remains : 1522/3960 places, 3622/6060 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Applied a total of 0 rules in 115 ms. Remains 1522 /1522 variables (removed 0) and now considering 3622/3622 (removed 0) transitions.
[2026-05-23 16:23:27] [INFO ] Invariant cache hit.
[2026-05-23 16:23:27] [INFO ] Implicit Places using invariants in 507 ms returned []
[2026-05-23 16:23:27] [INFO ] Invariant cache hit.
[2026-05-23 16:23:29] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2582 ms. Remains : 1522/1522 places, 3622/3622 transitions.
Support contains 33 out of 1522 places after structural reductions.
[2026-05-23 16:23:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-23 16:23:30] [INFO ] Flatten gal took : 344 ms
FORMULA BART-PT-030-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-030-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 16:23:30] [INFO ] Flatten gal took : 219 ms
[2026-05-23 16:23:30] [INFO ] Input system was already deterministic with 3622 transitions.
Support contains 31 out of 1522 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2271 ms. (17 steps per ms) remains 0/21 properties
[2026-05-23 16:23:31] [INFO ] Flatten gal took : 77 ms
[2026-05-23 16:23:31] [INFO ] Flatten gal took : 71 ms
[2026-05-23 16:23:31] [INFO ] Input system was already deterministic with 3622 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1503 transition count 3603
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1503 transition count 3603
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 1493 transition count 3593
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1493 transition count 3593
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1489 transition count 3589
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1477 transition count 3577
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1473 transition count 3573
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1473 transition count 3573
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1470 transition count 3570
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1470 transition count 3570
Applied a total of 104 rules in 814 ms. Remains 1470 /1522 variables (removed 52) and now considering 3570/3622 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1567994320452080902.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1440128930525873020.kers'
[2026-05-23 16:23:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1567994320452080902.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1440128930525873020.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:23:32] [INFO ] Computed 30 invariants in 13 ms
Computed 30 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1440128930525873020.kers
Total runtime 17 ms.
[2026-05-23 16:23:32] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-23 16:23:32] [INFO ] Invariant cache hit.
[2026-05-23 16:23:34] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2026-05-23 16:23:34] [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 30101 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 30072 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 61170ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 61180ms
Starting structural reductions in LTL mode, iteration 1 : 1470/1522 places, 3570/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63681 ms. Remains : 1470/1522 places, 3570/3622 transitions.
[2026-05-23 16:24:35] [INFO ] Flatten gal took : 93 ms
[2026-05-23 16:24:35] [INFO ] Flatten gal took : 91 ms
[2026-05-23 16:24:35] [INFO ] Input system was already deterministic with 3570 transitions.
[2026-05-23 16:24:36] [INFO ] Flatten gal took : 60 ms
[2026-05-23 16:24:36] [INFO ] Flatten gal took : 56 ms
[2026-05-23 16:24:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality17548794246210360656.gal : 69 ms
[2026-05-23 16:24:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality1714824653685369683.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17548794246210360656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1714824653685369683.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,5.08022e+50,4.89477,40908,2,2916,5,22988,6,0,9453,12401,0


Converting to forward existential form...Done !
original formula: EX(AX(FALSE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,18.6232,328052,1,0,5,2.15263e+06,9,0,34937,20312,2
FORMULA BART-PT-030-CTLCardinality-2024-00 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 : 1522/1522 places, 3622/3622 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1503 transition count 3603
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1503 transition count 3603
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 1493 transition count 3593
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1493 transition count 3593
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1489 transition count 3589
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1477 transition count 3577
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1473 transition count 3573
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1473 transition count 3573
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1470 transition count 3570
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1470 transition count 3570
Applied a total of 104 rules in 854 ms. Remains 1470 /1522 variables (removed 52) and now considering 3570/3622 (removed 52) transitions.
[2026-05-23 16:24:55] [INFO ] Invariant cache hit.
[2026-05-23 16:24:56] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-23 16:24:56] [INFO ] Invariant cache hit.
[2026-05-23 16:24:58] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2277 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1470/1522 places, 3570/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3133 ms. Remains : 1470/1522 places, 3570/3622 transitions.
[2026-05-23 16:24:58] [INFO ] Flatten gal took : 52 ms
[2026-05-23 16:24:58] [INFO ] Flatten gal took : 53 ms
[2026-05-23 16:24:58] [INFO ] Input system was already deterministic with 3570 transitions.
[2026-05-23 16:24:58] [INFO ] Flatten gal took : 52 ms
[2026-05-23 16:24:58] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:24:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality18138015755210091849.gal : 58 ms
[2026-05-23 16:24:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality18203989793380245437.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/CTLCardinality18138015755210091849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18203989793380245437.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,5.08022e+50,5.08756,41012,2,2916,5,22988,6,0,9453,12401,0


Converting to forward existential form...Done !
original formula: (EF(AX(FALSE)) * EG(AF(EX(TRUE))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(EX(!(FALSE))))),!(EG(!(EX(TRUE)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,22.9949,349848,1,0,5,2.15488e+06,20,0,36378,26871,4
FORMULA BART-PT-030-CTLCardinality-2024-01 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 : 1522/1522 places, 3622/3622 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1503 transition count 3603
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1503 transition count 3603
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 1493 transition count 3593
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1493 transition count 3593
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1489 transition count 3589
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1477 transition count 3577
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1473 transition count 3573
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1473 transition count 3573
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1470 transition count 3570
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1470 transition count 3570
Applied a total of 104 rules in 756 ms. Remains 1470 /1522 variables (removed 52) and now considering 3570/3622 (removed 52) transitions.
[2026-05-23 16:25:22] [INFO ] Invariant cache hit.
[2026-05-23 16:25:22] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-23 16:25:22] [INFO ] Invariant cache hit.
[2026-05-23 16:25:24] [INFO ] Implicit Places using invariants and state equation in 1508 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1470/1522 places, 3570/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2545 ms. Remains : 1470/1522 places, 3570/3622 transitions.
[2026-05-23 16:25:24] [INFO ] Flatten gal took : 51 ms
[2026-05-23 16:25:24] [INFO ] Flatten gal took : 50 ms
[2026-05-23 16:25:24] [INFO ] Input system was already deterministic with 3570 transitions.
[2026-05-23 16:25:24] [INFO ] Flatten gal took : 69 ms
[2026-05-23 16:25:24] [INFO ] Flatten gal took : 73 ms
[2026-05-23 16:25:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16506195632445281199.gal : 23 ms
[2026-05-23 16:25:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality3511198850420384063.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/CTLCardinality16506195632445281199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3511198850420384063.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,5.08022e+50,5.22767,41028,2,2916,5,22988,6,0,9453,12401,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,8.99329,41028,1,0,6,22988,7,1,12030,12401,1
FORMULA BART-PT-030-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1505 transition count 3605
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1505 transition count 3605
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 1497 transition count 3597
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 1497 transition count 3597
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 1493 transition count 3593
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 1493 transition count 3593
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1489 transition count 3589
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1477 transition count 3577
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 1474 transition count 3574
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 1474 transition count 3574
Applied a total of 96 rules in 736 ms. Remains 1474 /1522 variables (removed 48) and now considering 3574/3622 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18028061835887171237.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6462820684421732918.kers'
[2026-05-23 16:25:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18028061835887171237.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6462820684421732918.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3574 rows 1474 cols 7148 entries
Finished phase 1 with 1444 SingleSign rule and 0 generalized
[2026-05-23 16:25:34] [INFO ] Computed 30 invariants in 13 ms
Computed 30 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6462820684421732918.kers
Total runtime 16 ms.
[2026-05-23 16:25:34] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-23 16:25:34] [INFO ] Invariant cache hit.
[2026-05-23 16:25:36] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Running 2494 sub problems to find dead transitions.
[2026-05-23 16:25: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 1444/5048 variables, and 0 constraints, problems are : Problem set: 0 solved, 2494 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1474 constraints, PredecessorRefiner: 2494/2494 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2494 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1444/5048 variables, and 0 constraints, problems are : Problem set: 0 solved, 2494 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1474 constraints, PredecessorRefiner: 0/2494 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61183ms problems are : Problem set: 0 solved, 2494 unsolved
Search for dead transitions found 0 dead transitions in 61190ms
Starting structural reductions in LTL mode, iteration 1 : 1474/1522 places, 3574/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63655 ms. Remains : 1474/1522 places, 3574/3622 transitions.
[2026-05-23 16:26:37] [INFO ] Flatten gal took : 65 ms
[2026-05-23 16:26:37] [INFO ] Flatten gal took : 66 ms
[2026-05-23 16:26:37] [INFO ] Input system was already deterministic with 3574 transitions.
[2026-05-23 16:26:37] [INFO ] Flatten gal took : 67 ms
[2026-05-23 16:26:37] [INFO ] Flatten gal took : 63 ms
[2026-05-23 16:26:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality2331943893458781884.gal : 19 ms
[2026-05-23 16:26:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11668559419713232283.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2331943893458781884.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11668559419713232283.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,5.50339e+50,5.36625,41128,2,3102,5,25882,6,0,9473,13933,0


Converting to forward existential form...Done !
original formula: AF(((TrainState_29_3_17==0) * ((TrainState_9_1_21==1) + (EX((TrainState_26_1_30==1)) * AG(EX((TrainState_30_3_31==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((TrainState_29_3_17==0) * ((TrainState_9_1_21==1) + (EX((TrainState_26_1_30==1)) * !(E(TRUE U !(EX...197
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 16:27:07] [INFO ] Flatten gal took : 35 ms
[2026-05-23 16:27:07] [INFO ] Applying decomposition
[2026-05-23 16:27:07] [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/graph10258452103725830319.txt' '-o' '/tmp/graph10258452103725830319.bin' '-w' '/tmp/graph10258452103725830319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10258452103725830319.bin' '-l' '-1' '-v' '-w' '/tmp/graph10258452103725830319.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:27:08] [INFO ] Decomposing Gal with order
[2026-05-23 16:27:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:27:08] [INFO ] Removed a total of 1135 redundant transitions.
[2026-05-23 16:27:09] [INFO ] Flatten gal took : 331 ms
[2026-05-23 16:27:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 633 labels/synchronizations in 40 ms.
[2026-05-23 16:27:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality7561813972502511450.gal : 36 ms
[2026-05-23 16:27:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality15971314668949845540.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/CTLCardinality7561813972502511450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15971314668949845540.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,5.50339e+50,0.921647,20316,193,33,1243,1036,662,781,176,1658,0


Converting to forward existential form...Done !
original formula: AF(((i5.u142.TrainState_29_3_17==0) * ((i12.u154.TrainState_9_1_21==1) + (EX((i22.u245.TrainState_26_1_30==1)) * AG(EX((i8.u253.TrainStat...174
=> equivalent forward existential formula: [FwdG(Init,!(((i5.u142.TrainState_29_3_17==0) * ((i12.u154.TrainState_9_1_21==1) + (EX((i22.u245.TrainState_26_1...231
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.29445,20596,1,0,30529,2777,3351,33943,780,4309,25825
FORMULA BART-PT-030-CTLCardinality-2024-08 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 : 1522/1522 places, 3622/3622 transitions.
Graph (trivial) has 3618 edges and 1522 vertex of which 1514 / 1522 are part of one of the 30 SCC in 10 ms
Free SCC test removed 1484 places
Ensure Unique test removed 3578 transitions
Reduce isomorphic transitions removed 3578 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 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 0 with 28 rules applied. Total rules applied 29 place count 10 transition count 16
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 1 with 3 rules applied. Total rules applied 32 place count 9 transition count 14
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 35 place count 8 transition count 12
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 38 place count 7 transition count 10
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 41 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 42 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 44 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 44 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 46 place count 4 transition count 5
Applied a total of 46 rules in 46 ms. Remains 4 /1522 variables (removed 1518) and now considering 5/3622 (removed 3617) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11446310078860499403.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13458155254767247462.kers'
[2026-05-23 16:27:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11446310078860499403.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13458155254767247462.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 16:27:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13458155254767247462.kers
Total runtime 1 ms.
[2026-05-23 16:27:10] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 16:27:10] [INFO ] Invariant cache hit.
[2026-05-23 16:27:10] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2026-05-23 16:27:10] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 16:27:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/1522 places, 5/3622 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 223 ms. Remains : 4/1522 places, 5/3622 transitions.
[2026-05-23 16:27:10] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:27:10] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:27:10] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-23 16:27:10] [INFO ] Flatten gal took : 1 ms
[2026-05-23 16:27:10] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:27:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality335325268850403019.gal : 0 ms
[2026-05-23 16:27:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality11564934349735414180.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/CTLCardinality335325268850403019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11564934349735414180.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,0.001995,3736,2,7,5,25,5,0,22,14,0


Converting to forward existential form...Done !
original formula: EG(EF(((TrainState_18_2_36==0)||(TrainState_10_4_16==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((TrainState_18_2_36==0)||(TrainState_10_4_16==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.003425,4020,1,0,6,46,16,1,87,25,10
FORMULA BART-PT-030-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1505 transition count 3605
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1505 transition count 3605
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 1496 transition count 3596
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 1496 transition count 3596
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1492 transition count 3592
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1492 transition count 3592
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 1488 transition count 3588
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 1488 transition count 3588
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 1484 transition count 3584
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 1484 transition count 3584
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 1480 transition count 3580
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 1480 transition count 3580
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 1476 transition count 3576
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 1476 transition count 3576
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 95 place count 1473 transition count 3573
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 1473 transition count 3573
Applied a total of 98 rules in 950 ms. Remains 1473 /1522 variables (removed 49) and now considering 3573/3622 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6395182607067259519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3249232912543557384.kers'
[2026-05-23 16:27:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6395182607067259519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3249232912543557384.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3573 rows 1473 cols 7146 entries
Finished phase 1 with 1443 SingleSign rule and 0 generalized
[2026-05-23 16:27:11] [INFO ] Computed 30 invariants in 12 ms
Computed 30 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3249232912543557384.kers
Total runtime 16 ms.
[2026-05-23 16:27:12] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-23 16:27:12] [INFO ] Invariant cache hit.
[2026-05-23 16:27:13] [INFO ] Implicit Places using invariants and state equation in 1562 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
Running 2493 sub problems to find dead transitions.
[2026-05-23 16:27:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 2493/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1443/5046 variables, and 0 constraints, problems are : Problem set: 0 solved, 2493 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1473 constraints, PredecessorRefiner: 0/2493 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61242ms problems are : Problem set: 0 solved, 2493 unsolved
Search for dead transitions found 0 dead transitions in 61247ms
Starting structural reductions in LTL mode, iteration 1 : 1473/1522 places, 3573/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64077 ms. Remains : 1473/1522 places, 3573/3622 transitions.
[2026-05-23 16:28:14] [INFO ] Flatten gal took : 68 ms
[2026-05-23 16:28:14] [INFO ] Flatten gal took : 72 ms
[2026-05-23 16:28:15] [INFO ] Input system was already deterministic with 3573 transitions.
[2026-05-23 16:28:15] [INFO ] Flatten gal took : 81 ms
[2026-05-23 16:28:15] [INFO ] Flatten gal took : 82 ms
[2026-05-23 16:28:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality7000783114900135506.gal : 28 ms
[2026-05-23 16:28:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11138377013968946952.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/CTLCardinality7000783114900135506.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11138377013968946952.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,5.39548e+50,5.22625,41056,2,2926,5,23161,6,0,9468,12554,0


Converting to forward existential form...Done !
original formula: AG(EX((((TrainState_22_1_31==0)||(TrainState_21_1_20==1)) + A((TrainState_16_3_22==1) U (TrainState_17_2_22!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((TrainState_22_1_31==0)||(TrainState_21_1_20==1)) + !((E(!((TrainState_17_2_22!=1)) U...262
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 3571/0/2
(forward)formula 0,1,29.4546,382124,1,0,10,2.23718e+06,25,2,39331,76380,11
FORMULA BART-PT-030-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 1503 transition count 3603
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 1503 transition count 3603
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 1493 transition count 3593
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 1493 transition count 3593
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 1489 transition count 3589
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 1489 transition count 3589
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 1485 transition count 3585
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 1485 transition count 3585
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 1481 transition count 3581
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 1481 transition count 3581
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 1477 transition count 3577
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 1477 transition count 3577
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 1473 transition count 3573
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 1473 transition count 3573
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 1470 transition count 3570
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 1470 transition count 3570
Applied a total of 104 rules in 731 ms. Remains 1470 /1522 variables (removed 52) and now considering 3570/3622 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13749605163366017768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18094482352301941193.kers'
[2026-05-23 16:28:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13749605163366017768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18094482352301941193.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:28:45] [INFO ] Computed 30 invariants in 14 ms
Computed 30 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-18094482352301941193.kers
Total runtime 18 ms.
[2026-05-23 16:28:46] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-23 16:28:46] [INFO ] Invariant cache hit.
[2026-05-23 16:28:47] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
Running 2490 sub problems to find dead transitions.
[2026-05-23 16:28:47] [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 1440/5040 variables, and 0 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30074 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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30074 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 60942ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60947ms
Starting structural reductions in LTL mode, iteration 1 : 1470/1522 places, 3570/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63436 ms. Remains : 1470/1522 places, 3570/3622 transitions.
[2026-05-23 16:29:48] [INFO ] Flatten gal took : 79 ms
[2026-05-23 16:29:48] [INFO ] Flatten gal took : 85 ms
[2026-05-23 16:29:48] [INFO ] Input system was already deterministic with 3570 transitions.
[2026-05-23 16:29:48] [INFO ] Flatten gal took : 84 ms
[2026-05-23 16:29:48] [INFO ] Flatten gal took : 76 ms
[2026-05-23 16:29:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14528973417574514986.gal : 13 ms
[2026-05-23 16:29:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13818234532183937216.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/CTLCardinality14528973417574514986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13818234532183937216.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,5.08022e+50,5.11704,40980,2,2916,5,22988,6,0,9453,12401,0


Converting to forward existential form...Done !
original formula: AG(AF(AX(AF((TrainState_6_1_13==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(!(EG(!((TrainState_6_1_13==1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,27.6834,370588,1,0,6,2.15968e+06,21,0,39255,29230,10
FORMULA BART-PT-030-CTLCardinality-2024-11 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 : 1522/1522 places, 3622/3622 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1509 transition count 3609
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1509 transition count 3609
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 1503 transition count 3603
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 1503 transition count 3603
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 1500 transition count 3600
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 1500 transition count 3600
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 1497 transition count 3597
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 1497 transition count 3597
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 1494 transition count 3594
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 1494 transition count 3594
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 1491 transition count 3591
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 1491 transition count 3591
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 1488 transition count 3588
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 1488 transition count 3588
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 1486 transition count 3586
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 1486 transition count 3586
Applied a total of 72 rules in 715 ms. Remains 1486 /1522 variables (removed 36) and now considering 3586/3622 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15269247533119400060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10947666781955169527.kers'
[2026-05-23 16:30:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15269247533119400060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10947666781955169527.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3586 rows 1486 cols 7172 entries
Finished phase 1 with 1456 SingleSign rule and 0 generalized
[2026-05-23 16:30:17] [INFO ] Computed 30 invariants in 14 ms
Computed 30 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-10947666781955169527.kers
Total runtime 17 ms.
[2026-05-23 16:30:17] [INFO ] Implicit Places using invariants in 299 ms returned []
[2026-05-23 16:30:17] [INFO ] Invariant cache hit.
[2026-05-23 16:30:19] [INFO ] Implicit Places using invariants and state equation in 1795 ms returned []
Implicit Place search using SMT with State Equation took 2096 ms to find 0 implicit places.
Running 2506 sub problems to find dead transitions.
[2026-05-23 16:30:19] [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 1456/5072 variables, and 0 constraints, problems are : Problem set: 0 solved, 2506 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1486 constraints, PredecessorRefiner: 2506/2506 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2506 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1456/5072 variables, and 0 constraints, problems are : Problem set: 0 solved, 2506 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1486 constraints, PredecessorRefiner: 0/2506 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61045ms problems are : Problem set: 0 solved, 2506 unsolved
Search for dead transitions found 0 dead transitions in 61051ms
Starting structural reductions in LTL mode, iteration 1 : 1486/1522 places, 3586/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63869 ms. Remains : 1486/1522 places, 3586/3622 transitions.
[2026-05-23 16:31:20] [INFO ] Flatten gal took : 65 ms
[2026-05-23 16:31:20] [INFO ] Flatten gal took : 67 ms
[2026-05-23 16:31:20] [INFO ] Input system was already deterministic with 3586 transitions.
[2026-05-23 16:31:21] [INFO ] Flatten gal took : 68 ms
[2026-05-23 16:31:21] [INFO ] Flatten gal took : 70 ms
[2026-05-23 16:31:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality2833839612889468886.gal : 18 ms
[2026-05-23 16:31:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality654726215131004222.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2833839612889468886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality654726215131004222.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93795e+50,5.40142,41456,2,3337,5,29202,6,0,9533,15347,0


Converting to forward existential form...Done !
original formula: (AF((!(A(((TrainState_21_1_1==0)||(TrainState_17_3_14==1)) U AX((TrainState_24_2_15==1)))) + (((TrainState_27_1_31==0)&&(TrainState_22_4_...399
=> equivalent forward existential formula: ([FwdG(Init,!((!(!((E(!(!(EX(!((TrainState_24_2_15==1))))) U (!(((TrainState_21_1_1==0)||(TrainState_17_3_14==1)...743
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 16:31:51] [INFO ] Flatten gal took : 38 ms
[2026-05-23 16:31:51] [INFO ] Applying decomposition
[2026-05-23 16:31:51] [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/graph7695921575491091631.txt' '-o' '/tmp/graph7695921575491091631.bin' '-w' '/tmp/graph7695921575491091631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7695921575491091631.bin' '-l' '-1' '-v' '-w' '/tmp/graph7695921575491091631.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:31:51] [INFO ] Decomposing Gal with order
[2026-05-23 16:31:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:31:51] [INFO ] Removed a total of 1161 redundant transitions.
[2026-05-23 16:31:51] [INFO ] Flatten gal took : 165 ms
[2026-05-23 16:31:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 641 labels/synchronizations in 48 ms.
[2026-05-23 16:31:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality4175697840747502190.gal : 19 ms
[2026-05-23 16:31:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality7695951502219646048.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/CTLCardinality4175697840747502190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7695951502219646048.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.93795e+50,0.748895,20460,213,35,1558,823,756,1178,180,1312,0


Converting to forward existential form...Done !
original formula: (AF((!(A(((i17.u5.TrainState_21_1_1==0)||(i12.u132.TrainState_17_3_14==1)) U AX((i16.u106.TrainState_24_2_15==1)))) + (((i6.u257.TrainSta...511
=> equivalent forward existential formula: ([FwdG(Init,!((!(!((E(!(!(EX(!((i16.u106.TrainState_24_2_15==1))))) U (!(((i17.u5.TrainState_21_1_1==0)||(i12.u1...901
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,0.879195,20744,1,0,3411,3200,3398,3135,761,3399,9748
FORMULA BART-PT-030-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1505 transition count 3605
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1505 transition count 3605
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 1495 transition count 3595
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 1495 transition count 3595
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 1491 transition count 3591
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 1491 transition count 3591
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 1487 transition count 3587
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 1487 transition count 3587
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 1483 transition count 3583
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 1483 transition count 3583
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 1479 transition count 3579
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 1479 transition count 3579
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 90 place count 1475 transition count 3575
Iterating global reduction 0 with 4 rules applied. Total rules applied 94 place count 1475 transition count 3575
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 97 place count 1472 transition count 3572
Iterating global reduction 0 with 3 rules applied. Total rules applied 100 place count 1472 transition count 3572
Applied a total of 100 rules in 714 ms. Remains 1472 /1522 variables (removed 50) and now considering 3572/3622 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10614670223390679907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8735041438992325508.kers'
[2026-05-23 16:31:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10614670223390679907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8735041438992325508.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3572 rows 1472 cols 7144 entries
Finished phase 1 with 1442 SingleSign rule and 0 generalized
[2026-05-23 16:31:53] [INFO ] Computed 30 invariants in 12 ms
Computed 30 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-8735041438992325508.kers
Total runtime 16 ms.
[2026-05-23 16:31:53] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-23 16:31:53] [INFO ] Invariant cache hit.
[2026-05-23 16:31:55] [INFO ] Implicit Places using invariants and state equation in 1878 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Running 2492 sub problems to find dead transitions.
[2026-05-23 16:31:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1442/5044 variables, and 0 constraints, problems are : Problem set: 0 solved, 2492 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1472 constraints, PredecessorRefiner: 2492/2492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2492 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1442/5044 variables, and 0 constraints, problems are : Problem set: 0 solved, 2492 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1472 constraints, PredecessorRefiner: 0/2492 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60941ms problems are : Problem set: 0 solved, 2492 unsolved
Search for dead transitions found 0 dead transitions in 60946ms
Starting structural reductions in LTL mode, iteration 1 : 1472/1522 places, 3572/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63844 ms. Remains : 1472/1522 places, 3572/3622 transitions.
[2026-05-23 16:32:56] [INFO ] Flatten gal took : 62 ms
[2026-05-23 16:32:56] [INFO ] Flatten gal took : 62 ms
[2026-05-23 16:32:56] [INFO ] Input system was already deterministic with 3572 transitions.
[2026-05-23 16:32:57] [INFO ] Flatten gal took : 61 ms
[2026-05-23 16:32:57] [INFO ] Flatten gal took : 65 ms
[2026-05-23 16:32:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality7265162200678726490.gal : 18 ms
[2026-05-23 16:32:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality12395745110538763695.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/CTLCardinality7265162200678726490.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12395745110538763695.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,5.28969e+50,5.44168,41060,2,2915,5,23107,6,0,9463,12471,0


Converting to forward existential form...Done !
original formula: EG(AX((AX((TrainState_5_2_9==0)) * AX(((TrainState_11_2_19==0)||(TrainState_7_1_31==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(EX(!((TrainState_5_2_9==0)))) * !(EX(!(((TrainState_11_2_19==0)||(TrainState_7_1_31==1)))))...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,24.6812,361956,1,0,15,2.25171e+06,19,6,36421,111151,9
FORMULA BART-PT-030-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Graph (trivial) has 3618 edges and 1522 vertex of which 1506 / 1522 are part of one of the 30 SCC in 6 ms
Free SCC test removed 1476 places
Ensure Unique test removed 3565 transitions
Reduce isomorphic transitions removed 3565 transitions.
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 18 transition count 27
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 38 place count 15 transition count 23
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 13 transition count 19
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 50 place count 11 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 56 place count 9 transition count 11
Reduce places removed 2 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 5 with 4 rules applied. Total rules applied 60 place count 7 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 61 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 63 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 63 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 67 place count 4 transition count 5
Applied a total of 67 rules in 19 ms. Remains 4 /1522 variables (removed 1518) and now considering 5/3622 (removed 3617) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10810654516738576740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9409686397309918446.kers'
[2026-05-23 16:33:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10810654516738576740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9409686397309918446.kers]
Normalized transition count is 4 out of 5 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 16:33:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9409686397309918446.kers
Total runtime 0 ms.
[2026-05-23 16:33:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-23 16:33:21] [INFO ] Invariant cache hit.
[2026-05-23 16:33:21] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2026-05-23 16:33:21] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 16:33:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/1522 places, 5/3622 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 182 ms. Remains : 4/1522 places, 5/3622 transitions.
[2026-05-23 16:33:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:33:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:33:22] [INFO ] Input system was already deterministic with 5 transitions.
[2026-05-23 16:33:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:33:22] [INFO ] Flatten gal took : 0 ms
[2026-05-23 16:33:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12194038748074506319.gal : 1 ms
[2026-05-23 16:33:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality1839309562003298326.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/CTLCardinality12194038748074506319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1839309562003298326.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,0.002857,3744,2,10,5,31,5,0,22,18,0


Converting to forward existential form...Done !
original formula: AG(!(E(AG((TrainState_1_4_12==0)) U AG(AF((TrainState_28_4_11==0))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),!(E(TRUE U !((TrainState_1_4_12==0))))) * !(E(TRUE U !(!(EG(!((TrainState_28_4_11==0)))))...167
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004529,4036,1,0,6,58,21,0,86,26,8
FORMULA BART-PT-030-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 1522/1522 places, 3622/3622 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1504 transition count 3604
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1504 transition count 3604
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 1494 transition count 3594
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 1494 transition count 3594
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 1490 transition count 3590
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 1490 transition count 3590
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 1486 transition count 3586
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 1486 transition count 3586
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 1482 transition count 3582
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 1482 transition count 3582
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 1478 transition count 3578
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 1478 transition count 3578
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 1474 transition count 3574
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 1474 transition count 3574
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 1471 transition count 3571
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 1471 transition count 3571
Applied a total of 102 rules in 1046 ms. Remains 1471 /1522 variables (removed 51) and now considering 3571/3622 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10920175187370261580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12344526976212874397.kers'
[2026-05-23 16:33:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10920175187370261580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12344526976212874397.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 3571 rows 1471 cols 7142 entries
Finished phase 1 with 1441 SingleSign rule and 0 generalized
[2026-05-23 16:33:23] [INFO ] Computed 30 invariants in 13 ms
Computed 30 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12344526976212874397.kers
Total runtime 16 ms.
[2026-05-23 16:33:23] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-23 16:33:23] [INFO ] Invariant cache hit.
[2026-05-23 16:33:25] [INFO ] Implicit Places using invariants and state equation in 1739 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
Running 2491 sub problems to find dead transitions.
[2026-05-23 16:33:25] [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 1441/5042 variables, and 0 constraints, problems are : Problem set: 0 solved, 2491 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 2491/2491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2491 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1441/5042 variables, and 0 constraints, problems are : Problem set: 0 solved, 2491 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 0/30 constraints, State Equation: 0/1471 constraints, PredecessorRefiner: 0/2491 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61075ms problems are : Problem set: 0 solved, 2491 unsolved
Search for dead transitions found 0 dead transitions in 61079ms
Starting structural reductions in LTL mode, iteration 1 : 1471/1522 places, 3571/3622 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64166 ms. Remains : 1471/1522 places, 3571/3622 transitions.
[2026-05-23 16:34:26] [INFO ] Flatten gal took : 57 ms
[2026-05-23 16:34:26] [INFO ] Flatten gal took : 60 ms
[2026-05-23 16:34:26] [INFO ] Input system was already deterministic with 3571 transitions.
[2026-05-23 16:34:26] [INFO ] Flatten gal took : 60 ms
[2026-05-23 16:34:26] [INFO ] Flatten gal took : 67 ms
[2026-05-23 16:34:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality16783840885120215193.gal : 16 ms
[2026-05-23 16:34:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality18227716002253300206.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/CTLCardinality16783840885120215193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18227716002253300206.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,5.1839e+50,5.20977,41036,2,2913,5,22984,6,0,9458,12458,0


Converting to forward existential form...Done !
original formula: EX(EG(((TrainState_14_2_13==0)||(TrainState_25_1_30==1))))
=> equivalent forward existential formula: [FwdG(EY(Init),((TrainState_14_2_13==0)||(TrainState_25_1_30==1)))] != FALSE
Hit Full ! (commute/partial/dont) 3565/0/6
(forward)formula 0,1,28.9826,374840,1,0,7,2.18309e+06,19,1,39284,62597,9
FORMULA BART-PT-030-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-23 16:34:55] [INFO ] Flatten gal took : 36 ms
[2026-05-23 16:34:55] [INFO ] Flatten gal took : 36 ms
Total runtime 760675 ms.

BK_STOP 1779554095863

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-177946788100257"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;