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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 46M
-rw-r--r-- 1 mcc users 1.3M Mar 5 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.5M Mar 5 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Mar 5 09:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.6M Mar 5 09:26 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 562K Mar 15 07:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Mar 15 07:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 680K Mar 15 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Mar 15 07:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3M Mar 5 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 8.1M Mar 5 09:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Mar 5 09:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5M Mar 5 09:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 120K Mar 15 07:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 242K 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 4.8M 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-020-LTLFireability-00
FORMULA_NAME BART-PT-020-LTLFireability-01
FORMULA_NAME BART-PT-020-LTLFireability-02
FORMULA_NAME BART-PT-020-LTLFireability-03
FORMULA_NAME BART-PT-020-LTLFireability-04
FORMULA_NAME BART-PT-020-LTLFireability-05
FORMULA_NAME BART-PT-020-LTLFireability-06
FORMULA_NAME BART-PT-020-LTLFireability-07
FORMULA_NAME BART-PT-020-LTLFireability-08
FORMULA_NAME BART-PT-020-LTLFireability-09
FORMULA_NAME BART-PT-020-LTLFireability-10
FORMULA_NAME BART-PT-020-LTLFireability-11
FORMULA_NAME BART-PT-020-LTLFireability-12
FORMULA_NAME BART-PT-020-LTLFireability-13
FORMULA_NAME BART-PT-020-LTLFireability-14
FORMULA_NAME BART-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779552261206

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 16:04:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 16:04:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:04:24] [INFO ] Load time of PNML (sax parser for PT used): 1040 ms
[2026-05-23 16:04:24] [INFO ] Transformed 2850 places.
[2026-05-23 16:04:24] [INFO ] Transformed 4040 transitions.
[2026-05-23 16:04:24] [INFO ] Found NUPN structural information;
[2026-05-23 16:04:24] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 1420 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 99 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-020-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-020-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2640 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 43 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10880339087406160625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9993522299120082106.kers'
[2026-05-23 16:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10880339087406160625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9993522299120082106.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4040 rows 2640 cols 8080 entries
Finished phase 1 with 2620 SingleSign rule and 0 generalized
[2026-05-23 16:04:25] [INFO ] Computed 20 invariants in 20 ms
Computed 20 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-9993522299120082106.kers
Total runtime 25 ms.
[2026-05-23 16:04:27] [INFO ] Implicit Places using invariants in 1827 ms returned []
[2026-05-23 16:04:27] [INFO ] Invariant cache hit.
[2026-05-23 16:04:30] [INFO ] Implicit Places using invariants and state equation in 3110 ms returned []
Implicit Place search using SMT with State Equation took 4991 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 16:04:30] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30205 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30131 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62297ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 62368ms
Finished structural reductions in LTL mode , in 1 iterations and 67489 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 32 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2026-05-23 16:05:33] [INFO ] Invariant cache hit.
[2026-05-23 16:05:34] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2026-05-23 16:05:34] [INFO ] Invariant cache hit.
[2026-05-23 16:05:37] [INFO ] Implicit Places using invariants and state equation in 3393 ms returned []
Implicit Place search using SMT with State Equation took 4414 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4450 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 2640 out of 2640 places after structural reductions.
[2026-05-23 16:05:38] [INFO ] Flatten gal took : 375 ms
[2026-05-23 16:05:38] [INFO ] Flatten gal took : 243 ms
[2026-05-23 16:05:39] [INFO ] Input system was already deterministic with 4040 transitions.
Reduction of identical properties reduced properties to check from 22 to 18
RANDOM walk for 29786 steps (6 resets) in 1118 ms. (26 steps per ms) remains 0/18 properties
FORMULA BART-PT-020-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-PT-020-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1360 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 540
Iterating post reduction 1 with 600 rules applied. Total rules applied 660 place count 2580 transition count 3440
Reduce places removed 540 places and 0 transitions.
Iterating post reduction 2 with 540 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1220 place count 2020 transition count 3420
Iterating global reduction 3 with 20 rules applied. Total rules applied 1240 place count 2020 transition count 3420
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1400 place count 1940 transition count 3340
Applied a total of 1400 rules in 865 ms. Remains 1940 /2640 variables (removed 700) and now considering 3340/4040 (removed 700) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16075262703280756220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12315072982744955670.kers'
[2026-05-23 16:05:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16075262703280756220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12315072982744955670.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3340 rows 1940 cols 6680 entries
Finished phase 1 with 1920 SingleSign rule and 0 generalized
[2026-05-23 16:05:41] [INFO ] Computed 20 invariants in 27 ms
Computed 20 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-12315072982744955670.kers
Total runtime 32 ms.
[2026-05-23 16:05:42] [INFO ] Implicit Places using invariants in 443 ms returned []
[2026-05-23 16:05:42] [INFO ] Invariant cache hit.
[2026-05-23 16:05:44] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 2565 ms to find 0 implicit places.
[2026-05-23 16:05:44] [INFO ] Redundant transitions in 403 ms returned []
Running 2620 sub problems to find dead transitions.
[2026-05-23 16:05:44] [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 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 2620/2620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2620 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1920/5280 variables, and 0 constraints, problems are : Problem set: 0 solved, 2620 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1940 constraints, PredecessorRefiner: 0/2620 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61195ms problems are : Problem set: 0 solved, 2620 unsolved
Search for dead transitions found 0 dead transitions in 61208ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1940/2640 places, 3340/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65067 ms. Remains : 1940/2640 places, 3340/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 240 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 6587 ms.
Product exploration explored 100000 steps with 50000 reset in 6717 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 18 ms. Proved property starting from automaton with 1 states, 1 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 582 ms.
FORMULA BART-PT-020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-01 finished in 79376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p0) U !p1)))'
Support contains 2420 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 19 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-851967190060305551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12841579301324467934.kers'
[2026-05-23 16:07:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-851967190060305551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12841579301324467934.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4040 rows 2640 cols 8080 entries
Finished phase 1 with 2620 SingleSign rule and 0 generalized
[2026-05-23 16:07:00] [INFO ] Computed 20 invariants in 18 ms
Computed 20 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-12841579301324467934.kers
Total runtime 21 ms.
[2026-05-23 16:07:01] [INFO ] Implicit Places using invariants in 1124 ms returned []
[2026-05-23 16:07:01] [INFO ] Invariant cache hit.
[2026-05-23 16:07:04] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned []
Implicit Place search using SMT with State Equation took 4506 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2026-05-23 16:07:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30113 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 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 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30112 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61946ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61954ms
Finished structural reductions in LTL mode , in 1 iterations and 66511 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(p0) U !p1)))'
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p0) p1), (NOT p0), (NOT p0), p1, (NOT p0), true]
Running random walk in product with property : BART-PT-020-LTLFireability-03
Entered a terminal (fully accepting) state of product in 4754 steps with 1584 reset in 453 ms.
FORMULA BART-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-03 finished in 67382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1760 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 880 edges and 2640 vertex of which 120 / 2640 are part of one of the 20 SCC in 10 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 2540 transition count 3920
Reduce places removed 20 places and 0 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Iterating post reduction 1 with 200 rules applied. Total rules applied 221 place count 2520 transition count 3740
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 401 place count 2340 transition count 3740
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 401 place count 2340 transition count 3700
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 481 place count 2300 transition count 3700
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 581 place count 2200 transition count 3600
Iterating global reduction 3 with 100 rules applied. Total rules applied 681 place count 2200 transition count 3600
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 741 place count 2140 transition count 3540
Iterating global reduction 3 with 60 rules applied. Total rules applied 801 place count 2140 transition count 3540
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 861 place count 2080 transition count 3480
Iterating global reduction 3 with 60 rules applied. Total rules applied 921 place count 2080 transition count 3480
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 981 place count 2020 transition count 3420
Iterating global reduction 3 with 60 rules applied. Total rules applied 1041 place count 2020 transition count 3420
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1081 place count 1980 transition count 3380
Iterating global reduction 3 with 40 rules applied. Total rules applied 1121 place count 1980 transition count 3380
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1161 place count 1940 transition count 3340
Iterating global reduction 3 with 40 rules applied. Total rules applied 1201 place count 1940 transition count 3340
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1221 place count 1920 transition count 3320
Iterating global reduction 3 with 20 rules applied. Total rules applied 1241 place count 1920 transition count 3320
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 2 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 1521 place count 1780 transition count 3180
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1541 place count 1780 transition count 3160
Applied a total of 1541 rules in 766 ms. Remains 1780 /2640 variables (removed 860) and now considering 3160/4040 (removed 880) transitions.
[2026-05-23 16:08:08] [INFO ] Flow matrix only has 3141 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5284736253522090364.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8442949917983824660.kers'
[2026-05-23 16:08:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5284736253522090364.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8442949917983824660.kers]
Normalized transition count is 3140 out of 3141 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 3140 rows 1780 cols 6280 entries
Finished phase 1 with 1760 SingleSign rule and 0 generalized
[2026-05-23 16:08:08] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-8442949917983824660.kers
Total runtime 23 ms.
[2026-05-23 16:08:08] [INFO ] Implicit Places using invariants in 685 ms returned []
[2026-05-23 16:08:08] [INFO ] Flow matrix only has 3141 transitions (discarded 19 similar events)
[2026-05-23 16:08:08] [INFO ] Invariant cache hit.
[2026-05-23 16:08:10] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2543 ms to find 0 implicit places.
[2026-05-23 16:08:11] [INFO ] Redundant transitions in 336 ms returned []
Running 2440 sub problems to find dead transitions.
[2026-05-23 16:08:11] [INFO ] Flow matrix only has 3141 transitions (discarded 19 similar events)
[2026-05-23 16:08:11] [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 1760/4921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2440 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1780 constraints, PredecessorRefiner: 2440/2440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2440 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/4921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2440 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1780 constraints, PredecessorRefiner: 0/2440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61327ms problems are : Problem set: 0 solved, 2440 unsolved
Search for dead transitions found 0 dead transitions in 61333ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1780/2640 places, 3160/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64996 ms. Remains : 1780/2640 places, 3160/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-04 finished in 65111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 2600 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 2640 transition count 4020
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 2620 transition count 4020
Applied a total of 40 rules in 56 ms. Remains 2620 /2640 variables (removed 20) and now considering 4020/4040 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5010491929232460000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5419509580873696804.kers'
[2026-05-23 16:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5010491929232460000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5419509580873696804.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 4020 rows 2620 cols 8040 entries
Finished phase 1 with 2600 SingleSign rule and 0 generalized
[2026-05-23 16:09:12] [INFO ] Computed 20 invariants in 25 ms
Computed 20 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-5419509580873696804.kers
Total runtime 30 ms.
[2026-05-23 16:09:13] [INFO ] Implicit Places using invariants in 795 ms returned []
[2026-05-23 16:09:13] [INFO ] Invariant cache hit.
[2026-05-23 16:09:16] [INFO ] Implicit Places using invariants and state equation in 2761 ms returned []
Implicit Place search using SMT with State Equation took 3558 ms to find 0 implicit places.
[2026-05-23 16:09:16] [INFO ] Redundant transitions in 247 ms returned []
Running 3300 sub problems to find dead transitions.
[2026-05-23 16:09:16] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2600 variables, 2600/2600 constraints. Problems are: Problem set: 0 solved, 3300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2600/6640 variables, and 2600 constraints, problems are : Problem set: 0 solved, 3300 unsolved in 30115 ms.
Refiners :[Domain max(s): 2600/2620 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2620 constraints, PredecessorRefiner: 3300/3300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2600 variables, 2600/2600 constraints. Problems are: Problem set: 0 solved, 3300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2600/6640 variables, and 2600 constraints, problems are : Problem set: 0 solved, 3300 unsolved in 30108 ms.
Refiners :[Domain max(s): 2600/2620 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2620 constraints, PredecessorRefiner: 0/3300 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61451ms problems are : Problem set: 0 solved, 3300 unsolved
Search for dead transitions found 0 dead transitions in 61459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2620/2640 places, 4020/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65340 ms. Remains : 2620/2640 places, 4020/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BART-PT-020-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 3501 ms.
Product exploration explored 100000 steps with 0 reset in 3966 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
RANDOM walk for 135 steps (0 resets) in 16 ms. (7 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
[2026-05-23 16:10:29] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Knowledge-based reduction took 19138 ms.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Support contains 2600 out of 2620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2620/2620 places, 4020/4020 transitions.
Applied a total of 0 rules in 35 ms. Remains 2620 /2620 variables (removed 0) and now considering 4020/4020 (removed 0) transitions.
[2026-05-23 16:10:45] [INFO ] Invariant cache hit.
[2026-05-23 16:10:46] [INFO ] Implicit Places using invariants in 953 ms returned []
[2026-05-23 16:10:46] [INFO ] Invariant cache hit.
[2026-05-23 16:10:48] [INFO ] Implicit Places using invariants and state equation in 2890 ms returned []
Implicit Place search using SMT with State Equation took 3845 ms to find 0 implicit places.
[2026-05-23 16:10:49] [INFO ] Redundant transitions in 288 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4177 ms. Remains : 2620/2620 places, 4020/4020 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
RANDOM walk for 150 steps (0 resets) in 17 ms. (8 steps per ms) remains 0/3 properties
Knowledge based reduction with 3 factoid took 240 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
[2026-05-23 16:10:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Knowledge-based reduction took 19425 ms.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 1383 ms.
Product exploration explored 100000 steps with 0 reset in 1280 ms.
Built C files in :
/tmp/ltsmin16491297348481108659
[2026-05-23 16:11:11] [INFO ] Too many transitions (4020) to apply POR reductions. Disabling POR matrices.
[2026-05-23 16:11:11] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16491297348481108659
Running compilation step : cd /tmp/ltsmin16491297348481108659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16491297348481108659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16491297348481108659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2600 out of 2620 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2620/2620 places, 4020/4020 transitions.
Applied a total of 0 rules in 25 ms. Remains 2620 /2620 variables (removed 0) and now considering 4020/4020 (removed 0) transitions.
[2026-05-23 16:11:14] [INFO ] Invariant cache hit.
[2026-05-23 16:11:15] [INFO ] Implicit Places using invariants in 951 ms returned []
[2026-05-23 16:11:15] [INFO ] Invariant cache hit.
[2026-05-23 16:11:19] [INFO ] Implicit Places using invariants and state equation in 3176 ms returned []
Implicit Place search using SMT with State Equation took 4136 ms to find 0 implicit places.
[2026-05-23 16:11:19] [INFO ] Redundant transitions in 286 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4458 ms. Remains : 2620/2620 places, 4020/4020 transitions.
Built C files in :
/tmp/ltsmin9915144099701530285
[2026-05-23 16:11:19] [INFO ] Too many transitions (4020) to apply POR reductions. Disabling POR matrices.
[2026-05-23 16:11:19] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9915144099701530285
Running compilation step : cd /tmp/ltsmin9915144099701530285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9915144099701530285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9915144099701530285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:11:22] [INFO ] Flatten gal took : 106 ms
[2026-05-23 16:11:23] [INFO ] Flatten gal took : 93 ms
[2026-05-23 16:11:23] [INFO ] Time to serialize gal into /tmp/LTL10137766171084196239.gal : 38 ms
[2026-05-23 16:11:23] [INFO ] Time to serialize properties into /tmp/LTL9348717456157554241.prop : 14 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10137766171084196239.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9356039340150697854.hoa' '-atoms' '/tmp/LTL9348717456157554241.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9348717456157554241.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9356039340150697854.hoa
Detected timeout of ITS tools.
[2026-05-23 16:11:38] [INFO ] Flatten gal took : 144 ms
[2026-05-23 16:11:38] [INFO ] Flatten gal took : 142 ms
[2026-05-23 16:11:38] [INFO ] Time to serialize gal into /tmp/LTL7918550823354384192.gal : 40 ms
[2026-05-23 16:11:38] [INFO ] Time to serialize properties into /tmp/LTL5053200820473560782.ltl : 26 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7918550823354384192.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5053200820473560782.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(((F("((((((((((((TrainState_6_1_7==0)&&(TrainState_9_1_27==0))&&((TrainState_2_1_9==0)&&(TrainState_2_1_17==0)))&&(((TrainState_1...87242
Formula 0 simplified : F(G!"((((((((((((TrainState_6_1_7==0)&&(TrainState_9_1_27==0))&&((TrainState_2_1_9==0)&&(TrainState_2_1_17==0)))&&(((TrainState_13_4...87228
Detected timeout of ITS tools.
[2026-05-23 16:11:53] [INFO ] Flatten gal took : 119 ms
[2026-05-23 16:11:53] [INFO ] Applying decomposition
[2026-05-23 16:11:53] [INFO ] Flatten gal took : 127 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/graph8915731778421536793.txt' '-o' '/tmp/graph8915731778421536793.bin' '-w' '/tmp/graph8915731778421536793.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8915731778421536793.bin' '-l' '-1' '-v' '-w' '/tmp/graph8915731778421536793.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:11:54] [INFO ] Decomposing Gal with order
[2026-05-23 16:11:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:11:55] [INFO ] Removed a total of 291 redundant transitions.
[2026-05-23 16:11:55] [INFO ] Flatten gal took : 400 ms
[2026-05-23 16:11:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2026-05-23 16:11:57] [INFO ] Time to serialize gal into /tmp/LTL12800254944122357613.gal : 54 ms
[2026-05-23 16:11:57] [INFO ] Time to serialize properties into /tmp/LTL29705022115711959.ltl : 13 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12800254944122357613.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL29705022115711959.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G(((F("((((((((((((i4.i0.u57.TrainState_6_1_7==0)&&(i6.i1.u237.TrainState_9_1_27==0))&&((i19.i8.u35.TrainState_2_1_9==0)&&(i19.i8.u...124247
Formula 0 simplified : F(G!"((((((((((((i4.i0.u57.TrainState_6_1_7==0)&&(i6.i1.u237.TrainState_9_1_27==0))&&((i19.i8.u35.TrainState_2_1_9==0)&&(i19.i8.u35....124233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
237 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.03309,48764,1,0,44478,7838,27643,61000,2941,16199,103016
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-020-LTLFireability-05 finished in 167682 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X((p1&&X(p2)))))))'
Support contains 1400 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 2580 transition count 3980
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 2580 transition count 3980
Applied a total of 120 rules in 260 ms. Remains 2580 /2640 variables (removed 60) and now considering 3980/4040 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7004963839384328592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13994035286177848830.kers'
[2026-05-23 16:12:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7004963839384328592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13994035286177848830.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3980 rows 2580 cols 7960 entries
Finished phase 1 with 2560 SingleSign rule and 0 generalized
[2026-05-23 16:12:00] [INFO ] Computed 20 invariants in 28 ms
Computed 20 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-13994035286177848830.kers
Total runtime 34 ms.
[2026-05-23 16:12:01] [INFO ] Implicit Places using invariants in 817 ms returned []
[2026-05-23 16:12:01] [INFO ] Invariant cache hit.
[2026-05-23 16:12:04] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 3608 ms to find 0 implicit places.
Running 3260 sub problems to find dead transitions.
[2026-05-23 16:12:04] [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 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 3260/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 0/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62087ms problems are : Problem set: 0 solved, 3260 unsolved
Search for dead transitions found 0 dead transitions in 62097ms
Starting structural reductions in LTL mode, iteration 1 : 2580/2640 places, 3980/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65982 ms. Remains : 2580/2640 places, 3980/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X((X(p1)&&p2))))))'
Stuttering acceptance computed with spot in 531 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-06
Product exploration explored 100000 steps with 21944 reset in 4950 ms.
Product exploration explored 100000 steps with 22057 reset in 4954 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 11 states, 24 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 2225 ms. (17 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4739 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2178 ms. (18 steps per ms) remains 2/2 properties
[2026-05-23 16:13:21] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1180/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4724 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 2/0 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/1400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1180/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9758ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1400 out of 2580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2580 transition count 3920
Reduce places removed 60 places and 0 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Iterating post reduction 1 with 540 rules applied. Total rules applied 600 place count 2520 transition count 3440
Reduce places removed 480 places and 0 transitions.
Iterating post reduction 2 with 480 rules applied. Total rules applied 1080 place count 2040 transition count 3440
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 4 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1240 place count 1960 transition count 3360
Drop transitions (Redundant composition of simpler transitions.) removed 700 transitions
Redundant transition composition rules discarded 700 transitions
Iterating global reduction 3 with 700 rules applied. Total rules applied 1940 place count 1960 transition count 2660
Applied a total of 1940 rules in 276 ms. Remains 1960 /2580 variables (removed 620) and now considering 2660/3980 (removed 1320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 1960/2580 places, 2660/3980 transitions.
RANDOM walk for 40000 steps (8 resets) in 529 ms. (75 steps per ms) remains 2/2 properties
BEST_FIRST walk for 3440 steps (0 resets) in 614 ms. (5 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 11 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2026-05-23 16:13:34] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Knowledge-based reduction took 32337 ms.
Stuttering acceptance computed with spot in 619 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 1400 out of 2580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Applied a total of 0 rules in 106 ms. Remains 2580 /2580 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
[2026-05-23 16:13:49] [INFO ] Invariant cache hit.
[2026-05-23 16:13:50] [INFO ] Implicit Places using invariants in 750 ms returned []
[2026-05-23 16:13:50] [INFO ] Invariant cache hit.
[2026-05-23 16:13:53] [INFO ] Implicit Places using invariants and state equation in 2570 ms returned []
Implicit Place search using SMT with State Equation took 3323 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3429 ms. Remains : 2580/2580 places, 3980/3980 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 11 states, 24 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 1554 ms. (25 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4669 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2042 ms. (19 steps per ms) remains 2/2 properties
[2026-05-23 16:13:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1180/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 2/0 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/1400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1180/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10048ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1400 out of 2580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2580 transition count 3920
Reduce places removed 60 places and 0 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Iterating post reduction 1 with 540 rules applied. Total rules applied 600 place count 2520 transition count 3440
Reduce places removed 480 places and 0 transitions.
Iterating post reduction 2 with 480 rules applied. Total rules applied 1080 place count 2040 transition count 3440
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1240 place count 1960 transition count 3360
Drop transitions (Redundant composition of simpler transitions.) removed 700 transitions
Redundant transition composition rules discarded 700 transitions
Iterating global reduction 3 with 700 rules applied. Total rules applied 1940 place count 1960 transition count 2660
Applied a total of 1940 rules in 298 ms. Remains 1960 /2580 variables (removed 620) and now considering 2660/3980 (removed 1320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 300 ms. Remains : 1960/2580 places, 2660/3980 transitions.
RANDOM walk for 40000 steps (8 resets) in 598 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 3440 steps (0 resets) in 548 ms. (6 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 356 ms. Reduced automaton from 11 states, 24 edges and 3 AP (stutter sensitive) to 11 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 601 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2026-05-23 16:14:11] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Knowledge-based reduction took 33202 ms.
Stuttering acceptance computed with spot in 605 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 605 ms :[(OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22047 reset in 4688 ms.
Product exploration explored 100000 steps with 21925 reset in 4272 ms.
Spot run failed in 159 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11620320012364837046
[2026-05-23 16:14:36] [INFO ] Built C files in 86ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11620320012364837046
Running compilation step : cd /tmp/ltsmin11620320012364837046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11620320012364837046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11620320012364837046;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1400 out of 2580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Applied a total of 0 rules in 62 ms. Remains 2580 /2580 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
[2026-05-23 16:14:39] [INFO ] Invariant cache hit.
[2026-05-23 16:14:40] [INFO ] Implicit Places using invariants in 609 ms returned []
[2026-05-23 16:14:40] [INFO ] Invariant cache hit.
[2026-05-23 16:14:43] [INFO ] Implicit Places using invariants and state equation in 2633 ms returned []
Implicit Place search using SMT with State Equation took 3246 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3310 ms. Remains : 2580/2580 places, 3980/3980 transitions.
Built C files in :
/tmp/ltsmin9198758621041006167
[2026-05-23 16:14:43] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9198758621041006167
Running compilation step : cd /tmp/ltsmin9198758621041006167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9198758621041006167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9198758621041006167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:14:46] [INFO ] Flatten gal took : 58 ms
[2026-05-23 16:14:46] [INFO ] Flatten gal took : 132 ms
[2026-05-23 16:14:46] [INFO ] Time to serialize gal into /tmp/LTL2496754329465355973.gal : 13 ms
[2026-05-23 16:14:46] [INFO ] Time to serialize properties into /tmp/LTL14722705133031030519.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2496754329465355973.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9953050416633793884.hoa' '-atoms' '/tmp/LTL14722705133031030519.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14722705133031030519.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9953050416633793884.hoa
Detected timeout of ITS tools.
[2026-05-23 16:15:01] [INFO ] Flatten gal took : 58 ms
[2026-05-23 16:15:01] [INFO ] Flatten gal took : 64 ms
[2026-05-23 16:15:01] [INFO ] Time to serialize gal into /tmp/LTL2913500794605473160.gal : 13 ms
[2026-05-23 16:15:01] [INFO ] Time to serialize properties into /tmp/LTL17176191392283086185.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2913500794605473160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17176191392283086185.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((TrainState_13_1_1==1)||(TrainState_14_1_1==1))||((TrainState_15_1_1==1)||(TrainState_16_1_1==1)))||(((TrainState_17_1_...90612
Formula 0 simplified : F(G!"(((((((TrainState_13_1_1==1)||(TrainState_14_1_1==1))||((TrainState_15_1_1==1)||(TrainState_16_1_1==1)))||(((TrainState_17_1_1=...90601
Detected timeout of ITS tools.
[2026-05-23 16:15:17] [INFO ] Flatten gal took : 74 ms
[2026-05-23 16:15:17] [INFO ] Applying decomposition
[2026-05-23 16:15:17] [INFO ] Flatten gal took : 71 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/graph8712615240839596629.txt' '-o' '/tmp/graph8712615240839596629.bin' '-w' '/tmp/graph8712615240839596629.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8712615240839596629.bin' '-l' '-1' '-v' '-w' '/tmp/graph8712615240839596629.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:15:17] [INFO ] Decomposing Gal with order
[2026-05-23 16:15:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:15:17] [INFO ] Removed a total of 260 redundant transitions.
[2026-05-23 16:15:17] [INFO ] Flatten gal took : 172 ms
[2026-05-23 16:15:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2026-05-23 16:15:18] [INFO ] Time to serialize gal into /tmp/LTL13667997511767701042.gal : 32 ms
[2026-05-23 16:15:18] [INFO ] Time to serialize properties into /tmp/LTL18060187336688783613.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13667997511767701042.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18060187336688783613.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((F("(((((((i7.i0.u5.TrainState_13_1_1==1)||(i4.i0.u16.TrainState_14_1_1==1))||((i3.i0.u6.TrainState_15_1_1==1)||(i5.i0.u17.TrainS...128415
Formula 0 simplified : F(G!"(((((((i7.i0.u5.TrainState_13_1_1==1)||(i4.i0.u16.TrainState_14_1_1==1))||((i3.i0.u6.TrainState_15_1_1==1)||(i5.i0.u17.TrainSta...128404
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
659 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.10985,164984,1,0,251383,6748,21424,744783,1657,13429,397994
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-020-LTLFireability-06 finished in 206773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F((X(p2)||p1))))))'
Support contains 1380 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 2580 transition count 3980
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 2580 transition count 3980
Applied a total of 120 rules in 130 ms. Remains 2580 /2640 variables (removed 60) and now considering 3980/4040 (removed 60) transitions.
[2026-05-23 16:15:27] [INFO ] Invariant cache hit.
[2026-05-23 16:15:27] [INFO ] Implicit Places using invariants in 676 ms returned []
[2026-05-23 16:15:27] [INFO ] Invariant cache hit.
[2026-05-23 16:15:30] [INFO ] Implicit Places using invariants and state equation in 2877 ms returned []
Implicit Place search using SMT with State Equation took 3557 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 2580/2640 places, 3980/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3689 ms. Remains : 2580/2640 places, 3980/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F((X(p2)||p1))))))'
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 2053 ms.
Product exploration explored 100000 steps with 0 reset in 2116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 634 ms. (62 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2720 ms. (14 steps per ms) remains 1/1 properties
[2026-05-23 16:15:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1200/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3895 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1200/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8929ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1380 out of 2580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2580 transition count 3920
Reduce places removed 60 places and 0 transitions.
Performed 480 Post agglomeration using F-continuation condition.Transition count delta: 480
Iterating post reduction 1 with 540 rules applied. Total rules applied 600 place count 2520 transition count 3440
Reduce places removed 480 places and 0 transitions.
Iterating post reduction 2 with 480 rules applied. Total rules applied 1080 place count 2040 transition count 3440
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1240 place count 1960 transition count 3360
Drop transitions (Redundant composition of simpler transitions.) removed 700 transitions
Redundant transition composition rules discarded 700 transitions
Iterating global reduction 3 with 700 rules applied. Total rules applied 1940 place count 1960 transition count 2660
Applied a total of 1940 rules in 348 ms. Remains 1960 /2580 variables (removed 620) and now considering 2660/3980 (removed 1320) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 1960/2580 places, 2660/3980 transitions.
RANDOM walk for 40000 steps (8 resets) in 727 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 3440 steps (0 resets) in 237 ms. (14 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2026-05-23 16:15:48] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-23 16:16:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Knowledge-based reduction took 28240 ms.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Support contains 1380 out of 2580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Applied a total of 0 rules in 107 ms. Remains 2580 /2580 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
[2026-05-23 16:16:03] [INFO ] Invariant cache hit.
[2026-05-23 16:16:04] [INFO ] Implicit Places using invariants in 758 ms returned []
[2026-05-23 16:16:04] [INFO ] Invariant cache hit.
[2026-05-23 16:16:07] [INFO ] Implicit Places using invariants and state equation in 2411 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3285 ms. Remains : 2580/2580 places, 3980/3980 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 805 ms. (49 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3225 ms. (12 steps per ms) remains 1/1 properties
[2026-05-23 16:16:08] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1200/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3404 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1200/2580 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2580 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3980/6560 variables, 2580/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/6560 variables, 0/2600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6560/6560 variables, and 2600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4644 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2580/2580 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8070ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 15 ms.
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
[2026-05-23 16:16:19] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Knowledge-based reduction took 27309 ms.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 2369 ms.
Product exploration explored 100000 steps with 0 reset in 1825 ms.
Spot run failed in 53 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12445991756777367337
[2026-05-23 16:16:39] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12445991756777367337
Running compilation step : cd /tmp/ltsmin12445991756777367337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12445991756777367337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12445991756777367337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1380 out of 2580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Applied a total of 0 rules in 88 ms. Remains 2580 /2580 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
[2026-05-23 16:16:42] [INFO ] Invariant cache hit.
[2026-05-23 16:16:42] [INFO ] Implicit Places using invariants in 673 ms returned []
[2026-05-23 16:16:42] [INFO ] Invariant cache hit.
[2026-05-23 16:16:45] [INFO ] Implicit Places using invariants and state equation in 2424 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3207 ms. Remains : 2580/2580 places, 3980/3980 transitions.
Built C files in :
/tmp/ltsmin15230609539378332216
[2026-05-23 16:16:45] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15230609539378332216
Running compilation step : cd /tmp/ltsmin15230609539378332216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15230609539378332216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15230609539378332216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 16:16:48] [INFO ] Flatten gal took : 47 ms
[2026-05-23 16:16:48] [INFO ] Flatten gal took : 60 ms
[2026-05-23 16:16:48] [INFO ] Time to serialize gal into /tmp/LTL200480460730400819.gal : 14 ms
[2026-05-23 16:16:48] [INFO ] Time to serialize properties into /tmp/LTL17679694553454718523.prop : 3 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL200480460730400819.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17463023301345680697.hoa' '-atoms' '/tmp/LTL17679694553454718523.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17679694553454718523.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17463023301345680697.hoa
Detected timeout of ITS tools.
[2026-05-23 16:17:04] [INFO ] Flatten gal took : 91 ms
[2026-05-23 16:17:04] [INFO ] Flatten gal took : 94 ms
[2026-05-23 16:17:04] [INFO ] Time to serialize gal into /tmp/LTL16825571378333236294.gal : 22 ms
[2026-05-23 16:17:04] [INFO ] Time to serialize properties into /tmp/LTL9513207470530402053.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16825571378333236294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9513207470530402053.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainStat...90117
Formula 0 simplified : XX(GF!"((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13...90097
Detected timeout of ITS tools.
[2026-05-23 16:17:19] [INFO ] Flatten gal took : 60 ms
[2026-05-23 16:17:19] [INFO ] Applying decomposition
[2026-05-23 16:17:19] [INFO ] Flatten gal took : 54 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/graph12835050229356359361.txt' '-o' '/tmp/graph12835050229356359361.bin' '-w' '/tmp/graph12835050229356359361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12835050229356359361.bin' '-l' '-1' '-v' '-w' '/tmp/graph12835050229356359361.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:17:19] [INFO ] Decomposing Gal with order
[2026-05-23 16:17:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:17:20] [INFO ] Removed a total of 275 redundant transitions.
[2026-05-23 16:17:20] [INFO ] Flatten gal took : 138 ms
[2026-05-23 16:17:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 22 ms.
[2026-05-23 16:17:21] [INFO ] Time to serialize gal into /tmp/LTL13201195409794117844.gal : 28 ms
[2026-05-23 16:17:21] [INFO ] Time to serialize properties into /tmp/LTL2772173561477832976.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13201195409794117844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2772173561477832976.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((F(G("((((((((((((i5.i0.u51.TrainState_6_1_7==1)||(i11.i0.u816.TrainState_9_1_27==1))||((i18.i2.u47.TrainState_2_1_9==1)||(i18....127858
Formula 0 simplified : XX(GF!"((((((((((((i5.i0.u51.TrainState_6_1_7==1)||(i11.i0.u816.TrainState_9_1_27==1))||((i18.i2.u47.TrainState_2_1_9==1)||(i18.i2.u...127838
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
560 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.08583,144072,1,0,209791,9405,17398,691095,2222,25549,392382
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-020-LTLFireability-07 finished in 121088 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(p0)&&G((p1||X(p2))))||X(G(p0)))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1818 place count 1461 transition count 2861
Iterating global reduction 0 with 540 rules applied. Total rules applied 2358 place count 1461 transition count 2861
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2437 place count 1382 transition count 2782
Iterating global reduction 0 with 79 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2575 place count 1323 transition count 2723
Iterating global reduction 0 with 59 rules applied. Total rules applied 2634 place count 1323 transition count 2723
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2693 place count 1264 transition count 2664
Iterating global reduction 0 with 59 rules applied. Total rules applied 2752 place count 1264 transition count 2664
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2811 place count 1205 transition count 2605
Iterating global reduction 0 with 59 rules applied. Total rules applied 2870 place count 1205 transition count 2605
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2929 place count 1146 transition count 2546
Iterating global reduction 0 with 59 rules applied. Total rules applied 2988 place count 1146 transition count 2546
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3047 place count 1087 transition count 2487
Iterating global reduction 0 with 59 rules applied. Total rules applied 3106 place count 1087 transition count 2487
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3145 place count 1048 transition count 2448
Iterating global reduction 0 with 39 rules applied. Total rules applied 3184 place count 1048 transition count 2448
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3223 place count 1009 transition count 2409
Iterating global reduction 0 with 39 rules applied. Total rules applied 3262 place count 1009 transition count 2409
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3282 place count 989 transition count 2389
Iterating global reduction 0 with 20 rules applied. Total rules applied 3302 place count 989 transition count 2389
Applied a total of 3302 rules in 1062 ms. Remains 989 /2640 variables (removed 1651) and now considering 2389/4040 (removed 1651) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11640749978746974243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4568374846824710596.kers'
[2026-05-23 16:17:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11640749978746974243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4568374846824710596.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2389 rows 989 cols 4778 entries
Finished phase 1 with 969 SingleSign rule and 0 generalized
[2026-05-23 16:17:29] [INFO ] Computed 20 invariants in 15 ms
Computed 20 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-4568374846824710596.kers
Total runtime 20 ms.
[2026-05-23 16:17:29] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-23 16:17:29] [INFO ] Invariant cache hit.
[2026-05-23 16:17:30] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
Running 1669 sub problems to find dead transitions.
[2026-05-23 16:17:30] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 969/3378 variables, and 0 constraints, problems are : Problem set: 0 solved, 1669 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 1669/1669 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1669 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 969/3378 variables, and 0 constraints, problems are : Problem set: 0 solved, 1669 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/1669 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60625ms problems are : Problem set: 0 solved, 1669 unsolved
Search for dead transitions found 0 dead transitions in 60628ms
Starting structural reductions in LTL mode, iteration 1 : 989/2640 places, 2389/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63089 ms. Remains : 989/2640 places, 2389/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(X(p0)&&G((p1||X(p2)))))))'
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2893 steps with 0 reset in 19 ms.
FORMULA BART-PT-020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-08 finished in 63514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 711 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9611924732650363450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9080466402343012177.kers'
[2026-05-23 16:18:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9611924732650363450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9080466402343012177.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2380 rows 980 cols 4760 entries
Finished phase 1 with 960 SingleSign rule and 0 generalized
[2026-05-23 16:18:32] [INFO ] Computed 20 invariants in 9 ms
Computed 20 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-9080466402343012177.kers
Total runtime 13 ms.
[2026-05-23 16:18:32] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-23 16:18:32] [INFO ] Invariant cache hit.
[2026-05-23 16:18:33] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 16:18:33] [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 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61073ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 61093ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63298 ms. Remains : 980/2640 places, 2380/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-11
Entered a terminal (fully accepting) state of product in 127 steps with 0 reset in 10 ms.
FORMULA BART-PT-020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-11 finished in 63605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (p1||G(p0)))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4000 edges and 2640 vertex of which 2490 / 2640 are part of one of the 19 SCC in 19 ms
Free SCC test removed 2471 places
Ensure Unique test removed 3795 transitions
Reduce isomorphic transitions removed 3795 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 151 transition count 152
Reduce places removed 76 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 78 rules applied. Total rules applied 172 place count 75 transition count 150
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 175 place count 74 transition count 148
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 178 place count 73 transition count 146
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 180 place count 72 transition count 145
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 180 place count 72 transition count 140
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 190 place count 67 transition count 140
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 197 place count 60 transition count 133
Iterating global reduction 5 with 7 rules applied. Total rules applied 204 place count 60 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 206 place count 60 transition count 131
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 210 place count 56 transition count 127
Iterating global reduction 6 with 4 rules applied. Total rules applied 214 place count 56 transition count 127
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 217 place count 53 transition count 124
Iterating global reduction 6 with 3 rules applied. Total rules applied 220 place count 53 transition count 124
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 223 place count 50 transition count 121
Iterating global reduction 6 with 3 rules applied. Total rules applied 226 place count 50 transition count 121
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 228 place count 48 transition count 119
Iterating global reduction 6 with 2 rules applied. Total rules applied 230 place count 48 transition count 119
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 232 place count 46 transition count 117
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 46 transition count 117
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 235 place count 45 transition count 116
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 45 transition count 116
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 250 place count 38 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 254 place count 38 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 258 place count 36 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 262 place count 36 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 266 place count 34 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 270 place count 34 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 274 place count 32 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 278 place count 32 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 282 place count 30 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 286 place count 30 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 290 place count 28 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 294 place count 28 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 298 place count 26 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 302 place count 26 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 306 place count 24 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 310 place count 24 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 314 place count 22 transition count 61
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 318 place count 22 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 322 place count 20 transition count 55
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 326 place count 20 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 330 place count 18 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 334 place count 18 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 338 place count 16 transition count 43
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 342 place count 16 transition count 39
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 346 place count 14 transition count 37
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 350 place count 14 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 354 place count 12 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 358 place count 12 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 362 place count 10 transition count 25
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 366 place count 10 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 370 place count 8 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 374 place count 8 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 378 place count 6 transition count 13
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 22 with 5 rules applied. Total rules applied 383 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 385 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 386 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 386 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 24 with 2 rules applied. Total rules applied 388 place count 4 transition count 5
Applied a total of 388 rules in 168 ms. Remains 4 /2640 variables (removed 2636) and now considering 5/4040 (removed 4035) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10731258348983575575.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16149278051185823239.kers'
[2026-05-23 16:19:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10731258348983575575.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16149278051185823239.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:19:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16149278051185823239.kers
Total runtime 4 ms.
[2026-05-23 16:19:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 16:19:35] [INFO ] Invariant cache hit.
[2026-05-23 16:19:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-23 16:19:35] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 16:19:35] [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 40 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 44 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 90ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2640 places, 5/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 4/2640 places, 5/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||p1))))'
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-020-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-12 finished in 415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(p1)))||(X(p2)&&F(p3)))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1818 place count 1461 transition count 2861
Iterating global reduction 0 with 540 rules applied. Total rules applied 2358 place count 1461 transition count 2861
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2437 place count 1382 transition count 2782
Iterating global reduction 0 with 79 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2575 place count 1323 transition count 2723
Iterating global reduction 0 with 59 rules applied. Total rules applied 2634 place count 1323 transition count 2723
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2693 place count 1264 transition count 2664
Iterating global reduction 0 with 59 rules applied. Total rules applied 2752 place count 1264 transition count 2664
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2811 place count 1205 transition count 2605
Iterating global reduction 0 with 59 rules applied. Total rules applied 2870 place count 1205 transition count 2605
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2929 place count 1146 transition count 2546
Iterating global reduction 0 with 59 rules applied. Total rules applied 2988 place count 1146 transition count 2546
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3047 place count 1087 transition count 2487
Iterating global reduction 0 with 59 rules applied. Total rules applied 3106 place count 1087 transition count 2487
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3145 place count 1048 transition count 2448
Iterating global reduction 0 with 39 rules applied. Total rules applied 3184 place count 1048 transition count 2448
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3223 place count 1009 transition count 2409
Iterating global reduction 0 with 39 rules applied. Total rules applied 3262 place count 1009 transition count 2409
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3282 place count 989 transition count 2389
Iterating global reduction 0 with 20 rules applied. Total rules applied 3302 place count 989 transition count 2389
Applied a total of 3302 rules in 1092 ms. Remains 989 /2640 variables (removed 1651) and now considering 2389/4040 (removed 1651) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1708017695111722967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14548563464475346317.kers'
[2026-05-23 16:19:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1708017695111722967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14548563464475346317.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2389 rows 989 cols 4778 entries
Finished phase 1 with 969 SingleSign rule and 0 generalized
[2026-05-23 16:19:36] [INFO ] Computed 20 invariants in 11 ms
Computed 20 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-14548563464475346317.kers
Total runtime 14 ms.
[2026-05-23 16:19:36] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-05-23 16:19:36] [INFO ] Invariant cache hit.
[2026-05-23 16:19:38] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1283 ms to find 0 implicit places.
Running 1669 sub problems to find dead transitions.
[2026-05-23 16:19:38] [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 969/3378 variables, and 0 constraints, problems are : Problem set: 0 solved, 1669 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 1669/1669 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1669 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 969/3378 variables, and 0 constraints, problems are : Problem set: 0 solved, 1669 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/1669 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61012ms problems are : Problem set: 0 solved, 1669 unsolved
Search for dead transitions found 0 dead transitions in 61033ms
Starting structural reductions in LTL mode, iteration 1 : 989/2640 places, 2389/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63427 ms. Remains : 989/2640 places, 2389/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||F(p1)))||(X(p2)&&F(p3)))))'
Stuttering acceptance computed with spot in 326 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : BART-PT-020-LTLFireability-13
Product exploration explored 100000 steps with 975 reset in 1036 ms.
Product exploration explored 100000 steps with 899 reset in 1026 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 19 factoid took 193 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 924 ms. (43 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
[2026-05-23 16:20:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 153/156 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/522 variables, 156/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/522 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/3378 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 3/20 constraints, State Equation: 156/989 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 153/156 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/522 variables, 156/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/522 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/522 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/3378 variables, and 162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/20 constraints, State Equation: 156/989 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 1703 steps, including 55 resets, run visited all 3 properties in 10 ms. (steps per millisecond=170 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 13 ms.
Knowledge based reduction with 19 factoid took 270 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), false, false, false, false]
[2026-05-23 16:20:44] [INFO ] Invariant cache hit.
[2026-05-23 16:20:45] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned unsat
Proved EG (AND (NOT p0) (NOT p1) (NOT p3)) asserting that LTL formula F !(AND (NOT p0) (NOT p1) (NOT p3)) is false.
Negative knowledge disproves property using: (F (NOT (AND (NOT p0) (NOT p1) (NOT p3))))
Knowledge-based reduction took 4505 ms.
FORMULA BART-PT-020-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-13 finished in 70402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X((p1&&X(p2))) U G(p3)))))'
Support contains 4 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2436 place count 1382 transition count 2782
Iterating global reduction 0 with 80 rules applied. Total rules applied 2516 place count 1382 transition count 2782
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2575 place count 1323 transition count 2723
Iterating global reduction 0 with 59 rules applied. Total rules applied 2634 place count 1323 transition count 2723
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2693 place count 1264 transition count 2664
Iterating global reduction 0 with 59 rules applied. Total rules applied 2752 place count 1264 transition count 2664
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2811 place count 1205 transition count 2605
Iterating global reduction 0 with 59 rules applied. Total rules applied 2870 place count 1205 transition count 2605
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2929 place count 1146 transition count 2546
Iterating global reduction 0 with 59 rules applied. Total rules applied 2988 place count 1146 transition count 2546
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3047 place count 1087 transition count 2487
Iterating global reduction 0 with 59 rules applied. Total rules applied 3106 place count 1087 transition count 2487
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3145 place count 1048 transition count 2448
Iterating global reduction 0 with 39 rules applied. Total rules applied 3184 place count 1048 transition count 2448
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3223 place count 1009 transition count 2409
Iterating global reduction 0 with 39 rules applied. Total rules applied 3262 place count 1009 transition count 2409
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3281 place count 990 transition count 2390
Iterating global reduction 0 with 19 rules applied. Total rules applied 3300 place count 990 transition count 2390
Applied a total of 3300 rules in 685 ms. Remains 990 /2640 variables (removed 1650) and now considering 2390/4040 (removed 1650) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-359059446823590601.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17298333955946462086.kers'
[2026-05-23 16:20:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-359059446823590601.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17298333955946462086.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2390 rows 990 cols 4780 entries
Finished phase 1 with 970 SingleSign rule and 0 generalized
[2026-05-23 16:20:46] [INFO ] Computed 20 invariants in 16 ms
Computed 20 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-17298333955946462086.kers
Total runtime 19 ms.
[2026-05-23 16:20:46] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-23 16:20:46] [INFO ] Invariant cache hit.
[2026-05-23 16:20:47] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1248 ms to find 0 implicit places.
Running 1670 sub problems to find dead transitions.
[2026-05-23 16:20: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 970/3380 variables, and 0 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/990 constraints, PredecessorRefiner: 1670/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1670 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 970/3380 variables, and 0 constraints, problems are : Problem set: 0 solved, 1670 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/990 constraints, PredecessorRefiner: 0/1670 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60534ms problems are : Problem set: 0 solved, 1670 unsolved
Search for dead transitions found 0 dead transitions in 60538ms
Starting structural reductions in LTL mode, iteration 1 : 990/2640 places, 2390/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62478 ms. Remains : 990/2640 places, 2390/4040 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((X((p1&&X(p2))) U G(p3)))))'
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (NOT p3), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p2), (AND (NOT p3) p1), (AND (NOT p3) p1 (NOT p2))]
Running random walk in product with property : BART-PT-020-LTLFireability-14
Product exploration explored 100000 steps with 20020 reset in 3499 ms.
Product exploration explored 100000 steps with 19959 reset in 3474 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 732 ms. (54 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2026-05-23 16:21:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 108/3380 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 2/20 constraints, State Equation: 0/990 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Negative knowledge disproves property using: (G (OR p1 p3))
Knowledge based reduction with 7 factoid took 208 ms. Proved property starting from automaton with 8 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 1203 ms.
FORMULA BART-PT-020-LTLFireability-14 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-14 finished in 71229 ms.
All properties solved by simple procedures.
Total runtime 1054076 ms.

BK_STOP 1779553317374

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-020"
export BK_EXAMINATION="LTLFireability"
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-020, examination is LTLFireability"
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-177946788100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-020.tgz
mv BART-PT-020 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;