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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 9.8K Mar 5 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 5 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 09:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 09:22 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 4.3K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 09:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 5 09:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 186K 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-COL-005-LTLFireability-00
FORMULA_NAME BART-COL-005-LTLFireability-01
FORMULA_NAME BART-COL-005-LTLFireability-02
FORMULA_NAME BART-COL-005-LTLFireability-03
FORMULA_NAME BART-COL-005-LTLFireability-04
FORMULA_NAME BART-COL-005-LTLFireability-05
FORMULA_NAME BART-COL-005-LTLFireability-06
FORMULA_NAME BART-COL-005-LTLFireability-07
FORMULA_NAME BART-COL-005-LTLFireability-08
FORMULA_NAME BART-COL-005-LTLFireability-09
FORMULA_NAME BART-COL-005-LTLFireability-10
FORMULA_NAME BART-COL-005-LTLFireability-11
FORMULA_NAME BART-COL-005-LTLFireability-12
FORMULA_NAME BART-COL-005-LTLFireability-13
FORMULA_NAME BART-COL-005-LTLFireability-14
FORMULA_NAME BART-COL-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779534060195

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-23 11:01:02] [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 11:01:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 11:01:03] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-23 11:01:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-23 11:01:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1516 ms
[2026-05-23 11:01:04] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2026-05-23 11:01:04] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 11603 PT places and 7.03614756E9 transition bindings in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2026-05-23 11:01:05] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 11 ms.
[2026-05-23 11:01:05] [INFO ] Skeletonized 3 HLPN properties in 1 ms. Removed 13 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 5
[2026-05-23 11:01:05] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 580 ms.
[2026-05-23 11:01:05] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 11:01:05] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 5 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-005-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-005-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-005-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-16186373461166460718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2599866780001749198.kers'
[2026-05-23 11:01:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16186373461166460718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2599866780001749198.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 11:01:06] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2599866780001749198.kers
Total runtime 4 ms.
[2026-05-23 11:01:06] [INFO ] Implicit Places using invariants in 421 ms returned []
[2026-05-23 11:01:06] [INFO ] Invariant cache hit.
[2026-05-23 11:01:06] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 11:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 14577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12571 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27258ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 27282ms
Finished structural reductions in LTL mode , in 1 iterations and 28124 ms. Remains : 132/132 places, 202/202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:01:34] [INFO ] Invariant cache hit.
[2026-05-23 11:01:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-23 11:01:34] [INFO ] Invariant cache hit.
[2026-05-23 11:01:34] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2026-05-23 11:01:34] [INFO ] Flatten gal took : 84 ms
[2026-05-23 11:01:34] [INFO ] Flatten gal took : 49 ms
[2026-05-23 11:01:34] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 6315 steps (0 resets) in 98 ms. (63 steps per ms) remains 0/6 properties
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' '!((G((!(p0 U p1)||X(p0)))&&G(X(p1))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 16 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:01:35] [INFO ] Invariant cache hit.
[2026-05-23 11:01:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-23 11:01:35] [INFO ] Invariant cache hit.
[2026-05-23 11:01:35] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 132/132 places, 202/202 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((!(p0 U p1)||X(p0)))&&G(X(p1))))'
Stuttering acceptance computed with spot in 449 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-005-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA BART-COL-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-01 finished in 868 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)||X(X((p2||G(!p2))))))'
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:01:36] [INFO ] Invariant cache hit.
[2026-05-23 11:01:36] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 11:01:36] [INFO ] Invariant cache hit.
[2026-05-23 11:01:36] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 132/132 places, 202/202 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 p1)||X(X((p2||G(!p2))))))'
Stuttering acceptance computed with spot in 498 ms :[false, false, false, false, false, (AND (NOT p0) p2), (AND (NOT p1) p2), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-03
Product exploration explored 100000 steps with 10067 reset in 703 ms.
Product exploration explored 100000 steps with 10002 reset in 377 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 6 factoid took 235 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 214 steps (0 resets) in 14 ms. (14 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 309 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Knowledge-based reduction took 844 ms.
Stuttering acceptance computed with spot in 261 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 10 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:01:39] [INFO ] Invariant cache hit.
[2026-05-23 11:01:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-23 11:01:39] [INFO ] Invariant cache hit.
[2026-05-23 11:01:39] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 132/132 places, 202/202 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 98 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 94 steps (0 resets) in 6 ms. (13 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Knowledge-based reduction took 523 ms.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 5553 reset in 340 ms.
Stack based approach found an accepted trace after 12239 steps with 685 reset with depth 19 and stack size 19 in 42 ms.
FORMULA BART-COL-005-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-03 finished in 4682 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 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 49 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18087310139886776781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10187677159316008320.kers'
[2026-05-23 11:01:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18087310139886776781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10187677159316008320.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 97 cols 334 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-23 11:01:40] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10187677159316008320.kers
Total runtime 3 ms.
[2026-05-23 11:01:40] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 11:01:40] [INFO ] Invariant cache hit.
[2026-05-23 11:01:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2026-05-23 11:01:41] [INFO ] Redundant transitions in 10 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-23 11:01:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 98 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8636 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 131/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 229 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7910 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16574ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 16576ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16857 ms. Remains : 97/132 places, 167/202 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 58 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 522 ms.
Product exploration explored 100000 steps with 50000 reset in 590 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 27 ms.
FORMULA BART-COL-005-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-04 finished in 18103 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)&&((G(F(p1)) U p0) U X(X(G(p2))))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-7518385418209081367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4425487356226455451.kers'
[2026-05-23 11:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7518385418209081367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4425487356226455451.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 11:01:58] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4425487356226455451.kers
Total runtime 1 ms.
[2026-05-23 11:01:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 11:01:59] [INFO ] Invariant cache hit.
[2026-05-23 11:01:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 11:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11491 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22830ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 22837ms
Finished structural reductions in LTL mode , in 1 iterations and 23041 ms. Remains : 132/132 places, 202/202 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)&&((G(F(p1)) U p0) U X(X(G(p2))))))'
Stuttering acceptance computed with spot in 501 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-05
Product exploration explored 100000 steps with 3348 reset in 596 ms.
Product exploration explored 100000 steps with 3454 reset in 315 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 198 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 204 steps (0 resets) in 8 ms. (22 steps per ms) remains 0/6 properties
Knowledge based reduction with 3 factoid took 339 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p1), (NOT p0)]
[2026-05-23 11:02:24] [INFO ] Invariant cache hit.
[2026-05-23 11:02:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-23 11:02:24] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2026-05-23 11:02:24] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 31 ms.
[2026-05-23 11:02:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 11:02:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-05-23 11:02:25] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2026-05-23 11:02:25] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-23 11:02:25] [INFO ] Added : 166 causal constraints over 34 iterations in 652 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-23 11:02:26] [INFO ] Invariant cache hit.
[2026-05-23 11:02:26] [INFO ] [Real]Absence check using 1 positive place invariants in 70 ms returned sat
[2026-05-23 11:02:28] [INFO ] [Real]Absence check using state equation in 1651 ms returned sat
[2026-05-23 11:02:28] [INFO ] Solution in real domain found non-integer solution.
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 4790 ms.
FORMULA BART-COL-005-LTLFireability-05 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-05 finished in 29311 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(F(!p0)) U G(p1))&&X(X(X((p2&&F(!p2)))))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 11:02:28] [INFO ] Invariant cache hit.
[2026-05-23 11:02:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-23 11:02:28] [INFO ] Invariant cache hit.
[2026-05-23 11:02:28] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 132/132 places, 202/202 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(F(!p0)) U G(p1))&&X(X(X((p2&&F(!p2)))))))'
Stuttering acceptance computed with spot in 353 ms :[true, p0, (NOT p1), true, true, true, true, p2]
Running random walk in product with property : BART-COL-005-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-06 finished in 639 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||G(!p1)))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
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 5 with 4 rules applied. Total rules applied 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
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 6 with 4 rules applied. Total rules applied 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
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 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
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 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
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 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
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 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
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 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
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 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
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 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
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 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
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 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
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 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
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 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
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 321 place count 4 transition count 9
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 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Applied a total of 328 rules in 77 ms. Remains 3 /132 variables (removed 129) and now considering 3/202 (removed 199) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9339499756831927227.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7560216996328495249.kers'
[2026-05-23 11:02:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9339499756831927227.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7560216996328495249.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 3 rows 3 cols 6 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-23 11:02:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7560216996328495249.kers
Total runtime 0 ms.
[2026-05-23 11:02:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-23 11:02:29] [INFO ] Invariant cache hit.
[2026-05-23 11:02:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-23 11:02:29] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-23 11:02:29] [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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 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) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/132 places, 3/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 3/132 places, 3/202 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||G(p1)))))'
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-005-LTLFireability-07
Product exploration explored 100000 steps with 2768 reset in 131 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 17 in 0 ms.
FORMULA BART-COL-005-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-07 finished in 509 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(!p2))||p1)) U X(X(p3))))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 6 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2167485097755625430.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7446612823080222658.kers'
[2026-05-23 11:02:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2167485097755625430.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7446612823080222658.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 129 cols 398 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 11:02:29] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7446612823080222658.kers
Total runtime 2 ms.
[2026-05-23 11:02:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 11:02:29] [INFO ] Invariant cache hit.
[2026-05-23 11:02:29] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-05-23 11:02:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23286ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 23287ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23488 ms. Remains : 129/132 places, 199/202 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(!p2))||p1)) U X(X(p3))))'
Stuttering acceptance computed with spot in 575 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (NOT p0), true]
Running random walk in product with property : BART-COL-005-LTLFireability-08
Product exploration explored 100000 steps with 30989 reset in 433 ms.
Product exploration explored 100000 steps with 30856 reset in 446 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 6 factoid took 244 ms. Reduced automaton from 11 states, 17 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 250 steps (0 resets) in 5 ms. (41 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 338 ms. Reduced automaton from 9 states, 12 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 453 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (NOT p0), true]
[2026-05-23 11:02:55] [INFO ] Invariant cache hit.
[2026-05-23 11:02:55] [INFO ] [Real]Absence check using 1 positive place invariants in 37 ms returned sat
[2026-05-23 11:02:57] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2026-05-23 11:02:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 11:02:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2026-05-23 11:02:58] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2026-05-23 11:02:58] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 25 ms.
[2026-05-23 11:02:59] [INFO ] Added : 163 causal constraints over 33 iterations in 1157 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 4764 ms.
Stuttering acceptance computed with spot in 459 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (NOT p0), true]
Support contains 70 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-05-23 11:02:59] [INFO ] Invariant cache hit.
[2026-05-23 11:02:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-23 11:02:59] [INFO ] Invariant cache hit.
[2026-05-23 11:02:59] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 129/129 places, 199/199 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 2 factoid took 229 ms. Reduced automaton from 9 states, 12 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 196 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/5 properties
Knowledge based reduction with 2 factoid took 341 ms. Reduced automaton from 9 states, 12 edges and 4 AP (stutter sensitive) to 9 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 453 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (NOT p0), true]
[2026-05-23 11:03:00] [INFO ] Invariant cache hit.
[2026-05-23 11:03:01] [INFO ] [Real]Absence check using 1 positive place invariants in 37 ms returned sat
[2026-05-23 11:03:02] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2026-05-23 11:03:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 11:03:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2026-05-23 11:03:03] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2026-05-23 11:03:03] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 24 ms.
[2026-05-23 11:03:04] [INFO ] Added : 163 causal constraints over 33 iterations in 1110 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 4642 ms.
Stuttering acceptance computed with spot in 459 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (NOT p0), true]
Stuttering acceptance computed with spot in 447 ms :[(NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND (NOT p3) p2), (NOT p3), (NOT p0), true]
Product exploration explored 100000 steps with 29940 reset in 312 ms.
Product exploration explored 100000 steps with 29977 reset in 341 ms.
Spot run failed in 160 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/ltsmin6966712650512716975
[2026-05-23 11:03:06] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6966712650512716975
Running compilation step : cd /tmp/ltsmin6966712650512716975;'/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'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin6966712650512716975;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin6966712650512716975;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased883935463668341261.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 70 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-05-23 11:03:21] [INFO ] Invariant cache hit.
[2026-05-23 11:03:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 11:03:21] [INFO ] Invariant cache hit.
[2026-05-23 11:03:21] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 129/129 places, 199/199 transitions.
Built C files in :
/tmp/ltsmin11194222378911474803
[2026-05-23 11:03:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11194222378911474803
Running compilation step : cd /tmp/ltsmin11194222378911474803;'/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'
Compilation finished in 671 ms.
Running link step : cd /tmp/ltsmin11194222378911474803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11194222378911474803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased704797050141343057.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 11:03:36] [INFO ] Flatten gal took : 19 ms
[2026-05-23 11:03:36] [INFO ] Flatten gal took : 17 ms
[2026-05-23 11:03:36] [INFO ] Time to serialize gal into /tmp/LTL14976121645188251531.gal : 7 ms
[2026-05-23 11:03:36] [INFO ] Time to serialize properties into /tmp/LTL8842946121606320371.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/LTL14976121645188251531.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9481697681843871304.hoa' '-atoms' '/tmp/LTL8842946121606320371.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/LTL8842946121606320371.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9481697681843871304.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 11:03:51] [INFO ] Flatten gal took : 11 ms
[2026-05-23 11:03:51] [INFO ] Flatten gal took : 10 ms
[2026-05-23 11:03:51] [INFO ] Time to serialize gal into /tmp/LTL2066654056657637883.gal : 2 ms
[2026-05-23 11:03:51] [INFO ] Time to serialize properties into /tmp/LTL10838861518174350786.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2066654056657637883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10838861518174350786.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 : !((((F("(TrainState_42>=1)"))&&(("(((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((Train...3139
Formula 0 simplified : (G!"(TrainState_42>=1)" | (!"(((((((TrainState_61>=1)||(TrainState_191>=1))||((TrainState_63>=1)||(TrainState_189>=1)))||(((TrainSta...3124
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 11:04:06] [INFO ] Flatten gal took : 10 ms
[2026-05-23 11:04:06] [INFO ] Applying decomposition
[2026-05-23 11:04:06] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14960380594060891213.txt' '-o' '/tmp/graph14960380594060891213.bin' '-w' '/tmp/graph14960380594060891213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14960380594060891213.bin' '-l' '-1' '-v' '-w' '/tmp/graph14960380594060891213.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:04:06] [INFO ] Decomposing Gal with order
[2026-05-23 11:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:04:07] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-23 11:04:07] [INFO ] Flatten gal took : 71 ms
[2026-05-23 11:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2026-05-23 11:04:07] [INFO ] Time to serialize gal into /tmp/LTL13783820025934506459.gal : 6 ms
[2026-05-23 11:04:07] [INFO ] Time to serialize properties into /tmp/LTL10095973474212276338.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13783820025934506459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10095973474212276338.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 : !((((F("(i6.i1.u0.TrainState_42>=1)"))&&(("(((((((u2.TrainState_61>=1)||(i0.i1.u40.TrainState_191>=1))||((i7.i3.u3.TrainState_63>=1)||...4241
Formula 0 simplified : (G!"(i6.i1.u0.TrainState_42>=1)" | (!"(((((((u2.TrainState_61>=1)||(i0.i1.u40.TrainState_191>=1))||((i7.i3.u3.TrainState_63>=1)||(i2...4226
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property BART-COL-005-LTLFireability-08 finished in 112806 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&&F((p1&&F(p2))))))'
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-7785785455587301260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12517427539499029704.kers'
[2026-05-23 11:04:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7785785455587301260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12517427539499029704.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 11:04:22] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12517427539499029704.kers
Total runtime 1 ms.
[2026-05-23 11:04:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-23 11:04:22] [INFO ] Invariant cache hit.
[2026-05-23 11:04:22] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 11:04:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10239 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21696ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 21697ms
Finished structural reductions in LTL mode , in 1 iterations and 21898 ms. Remains : 132/132 places, 202/202 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((F((p0&&F(p1)))&&p2)))'
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), true]
Running random walk in product with property : BART-COL-005-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-09 finished in 22170 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(((p0||X(X(p0)))&&(p0||X(!p1)))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 26 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16426744666526107229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4723652172731973899.kers'
[2026-05-23 11:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16426744666526107229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4723652172731973899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 49 cols 238 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-23 11:04:44] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4723652172731973899.kers
Total runtime 1 ms.
[2026-05-23 11:04:44] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 11:04:44] [INFO ] Invariant cache hit.
[2026-05-23 11:04:44] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2026-05-23 11:04:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 50 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 83/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 133 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3378 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6442ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 6443ms
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6607 ms. Remains : 49/132 places, 119/202 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(((p0||X(X(p0)))&&(p0||X(p1)))))'
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true]
Running random walk in product with property : BART-COL-005-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-10 finished in 6786 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)||X(X(F((!p1||X(!p0))))))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 132 transition count 145
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 75 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 75 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 74 transition count 144
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 121 place count 69 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 126 place count 69 transition count 139
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 156 place count 54 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 54 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 53 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 53 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 52 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 52 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 51 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 51 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 168 place count 50 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 170 place count 50 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 172 place count 49 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 174 place count 49 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 176 place count 48 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 178 place count 48 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 180 place count 47 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 182 place count 47 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 184 place count 46 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 186 place count 46 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 188 place count 45 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 190 place count 45 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 192 place count 44 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 194 place count 44 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 196 place count 43 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 198 place count 43 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 200 place count 42 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 202 place count 42 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 204 place count 41 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 206 place count 41 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 208 place count 40 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 210 place count 40 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 212 place count 39 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 214 place count 39 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 216 place count 38 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 218 place count 38 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 220 place count 37 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 222 place count 37 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 224 place count 36 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 226 place count 36 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 228 place count 35 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 230 place count 35 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 232 place count 34 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 234 place count 34 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 236 place count 33 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 238 place count 33 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 240 place count 32 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 242 place count 32 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 244 place count 31 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 245 place count 31 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 247 place count 30 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 248 place count 30 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 250 place count 29 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 251 place count 29 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 253 place count 28 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 255 place count 28 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 257 place count 27 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 259 place count 27 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 261 place count 26 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 263 place count 26 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 265 place count 25 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 267 place count 25 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 269 place count 24 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 270 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 272 place count 23 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 273 place count 23 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 275 place count 22 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 277 place count 22 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 279 place count 21 transition count 34
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 281 place count 21 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 282 place count 21 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 283 place count 21 transition count 31
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 284 place count 20 transition count 30
Iterating global reduction 36 with 1 rules applied. Total rules applied 285 place count 20 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 286 place count 20 transition count 29
Applied a total of 286 rules in 109 ms. Remains 20 /132 variables (removed 112) and now considering 29/202 (removed 173) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13262749182427941277.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5500470246477169439.kers'
[2026-05-23 11:04:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13262749182427941277.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5500470246477169439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 29 rows 20 cols 58 entries
Finished phase 1 with 19 SingleSign rule and 0 generalized
[2026-05-23 11:04:51] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5500470246477169439.kers
Total runtime 2 ms.
[2026-05-23 11:04:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-23 11:04:51] [INFO ] Invariant cache hit.
[2026-05-23 11:04:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-23 11:04:51] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-23 11:04:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/49 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/49 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 21 constraints, problems are : Problem set: 0 solved, 19 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 29/49 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 40 constraints, problems are : Problem set: 0 solved, 19 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 885ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/132 places, 29/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1070 ms. Remains : 20/132 places, 29/202 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)||X(X(F((p1||X(p0))))))))'
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-005-LTLFireability-11
Product exploration explored 100000 steps with 6705 reset in 95 ms.
Product exploration explored 100000 steps with 6637 reset in 111 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 4 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/3 properties
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 343 ms.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 10 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 29/29 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2026-05-23 11:04:53] [INFO ] Invariant cache hit.
[2026-05-23 11:04:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-23 11:04:53] [INFO ] Invariant cache hit.
[2026-05-23 11:04:53] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-23 11:04:53] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 20/20 places, 29/29 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 6 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/3 properties
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 345 ms.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6481 reset in 102 ms.
Product exploration explored 100000 steps with 6486 reset in 119 ms.
Built C files in :
/tmp/ltsmin7219226071566625228
[2026-05-23 11:04:53] [INFO ] Computing symmetric may disable matrix : 29 transitions.
[2026-05-23 11:04:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:04:53] [INFO ] Computing symmetric may enable matrix : 29 transitions.
[2026-05-23 11:04:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:04:53] [INFO ] Computing Do-Not-Accords matrix : 29 transitions.
[2026-05-23 11:04:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:04:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7219226071566625228
Running compilation step : cd /tmp/ltsmin7219226071566625228;'/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'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin7219226071566625228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin7219226071566625228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5952720966637201694.hoa' '--buchi-type=spotba'
LTSmin run took 1244 ms.
FORMULA BART-COL-005-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-005-LTLFireability-11 finished in 4330 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' '!((p0 U G((!p1&&X(!p0)))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 132 transition count 145
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 75 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 70 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 70 transition count 140
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 154 place count 55 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 55 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 54 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 54 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 53 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 53 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 52 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 52 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 51 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 168 place count 51 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 170 place count 50 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 172 place count 50 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 174 place count 49 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 176 place count 49 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 178 place count 48 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 180 place count 48 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 182 place count 47 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 184 place count 47 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 186 place count 46 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 188 place count 46 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 190 place count 45 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 192 place count 45 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 194 place count 44 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 196 place count 44 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 198 place count 43 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 200 place count 43 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 202 place count 42 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 204 place count 42 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 206 place count 41 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 208 place count 41 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 210 place count 40 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 212 place count 40 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 214 place count 39 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 216 place count 39 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 218 place count 38 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 220 place count 38 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 222 place count 37 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 224 place count 37 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 226 place count 36 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 228 place count 36 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 230 place count 35 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 232 place count 35 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 234 place count 34 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 236 place count 34 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 238 place count 33 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 240 place count 33 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 242 place count 32 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 243 place count 32 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 245 place count 31 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 246 place count 31 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 248 place count 30 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 249 place count 30 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 251 place count 29 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 253 place count 29 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 255 place count 28 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 257 place count 28 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 259 place count 27 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 261 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 263 place count 26 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 265 place count 26 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 267 place count 25 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 268 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 270 place count 24 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 271 place count 24 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 273 place count 23 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 275 place count 23 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 277 place count 22 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 279 place count 22 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 280 place count 22 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 281 place count 22 transition count 32
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 282 place count 21 transition count 31
Iterating global reduction 36 with 1 rules applied. Total rules applied 283 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 284 place count 21 transition count 30
Applied a total of 284 rules in 29 ms. Remains 21 /132 variables (removed 111) and now considering 30/202 (removed 172) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5451183778649443637.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8645523889031588124.kers'
[2026-05-23 11:04:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5451183778649443637.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8645523889031588124.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 21 cols 60 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-23 11:04:55] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8645523889031588124.kers
Total runtime 0 ms.
[2026-05-23 11:04:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-23 11:04:55] [INFO ] Invariant cache hit.
[2026-05-23 11:04:55] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-23 11:04:55] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2026-05-23 11:04:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 30/51 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 22 constraints, problems are : Problem set: 0 solved, 20 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 30/51 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 790ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 790ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/132 places, 30/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 880 ms. Remains : 21/132 places, 30/202 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' '!((p0 U G((!p1&&X(!p0)))))'
Stuttering acceptance computed with spot in 120 ms :[(OR p0 p1), true, (OR p0 p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-12
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-12 finished in 1033 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)))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 121 transition count 187
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 111 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 111 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 46 place count 108 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 108 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 105 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 105 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 102 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 102 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 100 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 100 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 98 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 97 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 91 transition count 160
Applied a total of 83 rules in 26 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3978760028407576220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1191418526601684937.kers'
[2026-05-23 11:04:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3978760028407576220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1191418526601684937.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 91 cols 320 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-23 11:04:56] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1191418526601684937.kers
Total runtime 1 ms.
[2026-05-23 11:04:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 11:04:56] [INFO ] Invariant cache hit.
[2026-05-23 11:04:56] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2026-05-23 11:04:56] [INFO ] Redundant transitions in 9 ms returned []
Running 124 sub problems to find dead transitions.
[2026-05-23 11:04:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 92 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 216 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14432ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 14433ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/132 places, 160/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14625 ms. Remains : 91/132 places, 160/202 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)))'
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-13
Product exploration explored 100000 steps with 5929 reset in 278 ms.
Stack based approach found an accepted trace after 1466 steps with 84 reset with depth 31 and stack size 31 in 5 ms.
FORMULA BART-COL-005-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-13 finished in 15055 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)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 37 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10621000943656950891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9898671962329532699.kers'
[2026-05-23 11:05:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10621000943656950891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9898671962329532699.kers]
Normalized transition count is 157 out of 158 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 89 cols 314 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 11:05:11] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9898671962329532699.kers
Total runtime 2 ms.
[2026-05-23 11:05:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 11:05:11] [INFO ] Invariant cache hit.
[2026-05-23 11:05:11] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2026-05-23 11:05:11] [INFO ] Redundant transitions in 9 ms returned []
Running 122 sub problems to find dead transitions.
[2026-05-23 11:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 90 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 122/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6699 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14213ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 14213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14492 ms. Remains : 89/132 places, 158/202 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)))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-14 finished in 14590 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(!p2))||p1)) U X(X(p3))))'
Spot run failed in 86 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 11:05:26] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2026-05-23 11:05:26] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin17936007675572457525
[2026-05-23 11:05:26] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2026-05-23 11:05:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:05:26] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2026-05-23 11:05:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 11:05:26] [INFO ] Flatten gal took : 18 ms
[2026-05-23 11:05:26] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
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/graph13065810741010826187.txt' '-o' '/tmp/graph13065810741010826187.bin' '-w' '/tmp/graph13065810741010826187.weights'
[2026-05-23 11:05:26] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13065810741010826187.bin' '-l' '-1' '-v' '-w' '/tmp/graph13065810741010826187.weights' '-q' '0' '-e' '0.001'
[2026-05-23 11:05:26] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17936007675572457525
Running compilation step : cd /tmp/ltsmin17936007675572457525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-23 11:05:26] [INFO ] Decomposing Gal with order
[2026-05-23 11:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:05:26] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-23 11:05:26] [INFO ] Flatten gal took : 35 ms
[2026-05-23 11:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 7 ms.
[2026-05-23 11:05:26] [INFO ] Time to serialize gal into /tmp/LTLFireability1653088636005336892.gal : 8 ms
[2026-05-23 11:05:26] [INFO ] Time to serialize properties into /tmp/LTLFireability4275651007998581311.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1653088636005336892.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4275651007998581311.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...276
Read 1 LTL properties
Checking formula 0 : !((((F("(i0.i1.u0.TrainState_42>=1)"))&&(("(((((((i3.i1.u35.TrainState_61>=1)||(i4.i2.u50.TrainState_191>=1))||((i2.u8.TrainState_63>=...4371
Formula 0 simplified : (G!"(i0.i1.u0.TrainState_42>=1)" | (!"(((((((i3.i1.u35.TrainState_61>=1)||(i4.i2.u50.TrainState_191>=1))||((i2.u8.TrainState_63>=1)|...4356
Compilation finished in 659 ms.
Running link step : cd /tmp/ltsmin17936007675572457525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin17936007675572457525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>((LTLAPp0==true))&&(X(X(!(LTLAPp2==true)))||(LTLAPp1==true))) U X(X((LTLAPp3==true))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2026-05-23 11:26:53] [INFO ] Applying decomposition
[2026-05-23 11:26:53] [INFO ] Flatten gal took : 13 ms
[2026-05-23 11:26:53] [INFO ] Decomposing Gal with order
[2026-05-23 11:26:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 11:26:53] [INFO ] Removed a total of 140 redundant transitions.
[2026-05-23 11:26:53] [INFO ] Flatten gal took : 26 ms
[2026-05-23 11:26:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-23 11:26:53] [INFO ] Time to serialize gal into /tmp/LTLFireability10007215639308780632.gal : 4 ms
[2026-05-23 11:26:53] [INFO ] Time to serialize properties into /tmp/LTLFireability8427655416943098233.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10007215639308780632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8427655416943098233.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...277
Read 1 LTL properties
Checking formula 0 : !((((F("(trainidspeeddistance42.TrainState_42>=1)"))&&(("(((((((trainidspeeddistance61.TrainState_61>=1)||(trainidspeeddistance191.Tra...6362
Formula 0 simplified : (G!"(trainidspeeddistance42.TrainState_42>=1)" | (!"(((((((trainidspeeddistance61.TrainState_61>=1)||(trainidspeeddistance191.TrainS...6347
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
37 unique states visited
0 strongly connected components in search stack
36 transitions explored
8 items max in DFS search stack
8025 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,80.2888,1988972,1,0,3.16774e+06,337,2673,6.91412e+06,23,371,10255072
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-005-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1645771 ms.

BK_STOP 1779535708565

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

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