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.r050-smll-177946901100108.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 Champagne-PT-H08T1U, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901100108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.4K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 304K 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 Champagne-PT-H08T1U-LTLFireability-00
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-01
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-02
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-03
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-04
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-05
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-06
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-07
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-08
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-09
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-10
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-11
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-12
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-13
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-14
FORMULA_NAME Champagne-PT-H08T1U-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779517847867

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H08T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 06:30:50] [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 06:30:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 06:30:51] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2026-05-23 06:30:51] [INFO ] Transformed 961 places.
[2026-05-23 06:30:51] [INFO ] Transformed 1347 transitions.
[2026-05-23 06:30:51] [INFO ] Found NUPN structural information;
[2026-05-23 06:30:51] [INFO ] Parsed PT model containing 961 places and 1347 transitions and 3454 arcs in 570 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Support contains 45 out of 961 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 961/961 places, 1347/1347 transitions.
Discarding 212 places :
Symmetric choice reduction at 0 with 212 rule applications. Total rules 212 place count 749 transition count 1135
Iterating global reduction 0 with 212 rules applied. Total rules applied 424 place count 749 transition count 1135
Discarding 127 places :
Symmetric choice reduction at 0 with 127 rule applications. Total rules 551 place count 622 transition count 1008
Iterating global reduction 0 with 127 rules applied. Total rules applied 678 place count 622 transition count 1008
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 749 place count 551 transition count 937
Iterating global reduction 0 with 71 rules applied. Total rules applied 820 place count 551 transition count 937
Applied a total of 820 rules in 392 ms. Remains 551 /961 variables (removed 410) and now considering 937/1347 (removed 410) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4330589207878547710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14638810739564491844.kers'
[2026-05-23 06:30:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4330589207878547710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14638810739564491844.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 937 rows 551 cols 2634 entries
Finished phase 1 with 514 SingleSign rule and 0 generalized
[2026-05-23 06:30:52] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-14638810739564491844.kers
Total runtime 10 ms.
[2026-05-23 06:30:53] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2026-05-23 06:30:53] [INFO ] Invariant cache hit.
[2026-05-23 06:30:54] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 2204 ms to find 0 implicit places.
Running 936 sub problems to find dead transitions.
[2026-05-23 06:30:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 936 unsolved
SMT process timed out in 30748ms, After SMT, problems are : Problem set: 0 solved, 936 unsolved
Search for dead transitions found 0 dead transitions in 30787ms
Starting structural reductions in LTL mode, iteration 1 : 551/961 places, 937/1347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33481 ms. Remains : 551/961 places, 937/1347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Applied a total of 0 rules in 23 ms. Remains 551 /551 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2026-05-23 06:31:25] [INFO ] Invariant cache hit.
[2026-05-23 06:31:25] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-23 06:31:25] [INFO ] Invariant cache hit.
[2026-05-23 06:31:26] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 551/551 places, 937/937 transitions.
Support contains 45 out of 551 places after structural reductions.
[2026-05-23 06:31:26] [INFO ] Flatten gal took : 123 ms
[2026-05-23 06:31:26] [INFO ] Flatten gal took : 76 ms
[2026-05-23 06:31:26] [INFO ] Input system was already deterministic with 937 transitions.
RANDOM walk for 40000 steps (58 resets) in 2131 ms. (18 steps per ms) remains 3/41 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
[2026-05-23 06:31:27] [INFO ] Invariant cache hit.
Problem AtomicPropp29 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 495/551 variables, 34/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 937/1488 variables, 551/588 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1488 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1488/1488 variables, and 588 constraints, problems are : Problem set: 1 solved, 2 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 514/551 variables, 35/37 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/38 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 937/1488 variables, 551/589 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1488 variables, 1/590 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1488 variables, 0/590 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1488 variables, 0/590 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1488/1488 variables, and 590 constraints, problems are : Problem set: 2 solved, 1 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 551/551 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1331ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 185 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 9 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
Computed a total of 42 stabilizing places and 42 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((F(p0)&&F(G(p1)))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Graph (trivial) has 570 edges and 551 vertex of which 285 / 551 are part of one of the 37 SCC in 4 ms
Free SCC test removed 248 places
Ensure Unique test removed 270 transitions
Reduce isomorphic transitions removed 270 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 302 transition count 617
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 119 rules applied. Total rules applied 169 place count 253 transition count 547
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 204 place count 218 transition count 547
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 235 place count 187 transition count 408
Iterating global reduction 3 with 31 rules applied. Total rules applied 266 place count 187 transition count 408
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 286 place count 187 transition count 388
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 288 place count 185 transition count 377
Iterating global reduction 4 with 2 rules applied. Total rules applied 290 place count 185 transition count 377
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 292 place count 185 transition count 375
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 438 place count 112 transition count 302
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 443 place count 107 transition count 278
Iterating global reduction 5 with 5 rules applied. Total rules applied 448 place count 107 transition count 278
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 453 place count 107 transition count 273
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 455 place count 105 transition count 271
Applied a total of 455 rules in 130 ms. Remains 105 /551 variables (removed 446) and now considering 271/937 (removed 666) transitions.
[2026-05-23 06:31:29] [INFO ] Flow matrix only has 99 transitions (discarded 172 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10536321355819534611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11529899206891949023.kers'
[2026-05-23 06:31:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10536321355819534611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11529899206891949023.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 98 rows 97 cols 252 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 06:31:29] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11529899206891949023.kers
Total runtime 2 ms.
[2026-05-23 06:31:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-23 06:31:29] [INFO ] Flow matrix only has 99 transitions (discarded 172 similar events)
[2026-05-23 06:31:29] [INFO ] Invariant cache hit.
[2026-05-23 06:31:29] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2026-05-23 06:31:29] [INFO ] Redundant transitions in 15 ms returned []
Running 168 sub problems to find dead transitions.
[2026-05-23 06:31:29] [INFO ] Flow matrix only has 99 transitions (discarded 172 similar events)
[2026-05-23 06:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 98/203 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/203 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/204 variables, and 142 constraints, problems are : Problem set: 0 solved, 168 unsolved in 8533 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 98/203 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 168/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/204 variables, and 310 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7249 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15819ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 15820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/551 places, 271/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16315 ms. Remains : 105/551 places, 271/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-00 finished in 16788 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 U p1)) U (p0 U p2)) U X(p3)))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 529 transition count 915
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 529 transition count 915
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 516 transition count 902
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 516 transition count 902
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 75 place count 511 transition count 897
Iterating global reduction 0 with 5 rules applied. Total rules applied 80 place count 511 transition count 897
Applied a total of 80 rules in 70 ms. Remains 511 /551 variables (removed 40) and now considering 897/937 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-970185454862474314.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9904839678400328823.kers'
[2026-05-23 06:31:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-970185454862474314.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9904839678400328823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 511 cols 2554 entries
Finished phase 1 with 474 SingleSign rule and 0 generalized
[2026-05-23 06:31:46] [INFO ] Computed 37 invariants in 4 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9904839678400328823.kers
Total runtime 6 ms.
[2026-05-23 06:31:46] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-23 06:31:46] [INFO ] Invariant cache hit.
[2026-05-23 06:31:47] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2026-05-23 06:31:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
SMT process timed out in 30245ms, After SMT, problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 30250ms
Starting structural reductions in LTL mode, iteration 1 : 511/551 places, 897/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31101 ms. Remains : 511/551 places, 897/937 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)) U (p0 U p2)) U X(p3)))'
Stuttering acceptance computed with spot in 551 ms :[(NOT p3), (NOT p3), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), true, (OR (AND p1 p2) (AND p0 p2)), p2, (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-01
Product exploration explored 100000 steps with 277 reset in 582 ms.
Product exploration explored 100000 steps with 270 reset in 575 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge based reduction with 34 factoid took 250 ms. Reduced automaton from 12 states, 39 edges and 4 AP (stutter sensitive) to 12 states, 36 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (58 resets) in 509 ms. (78 steps per ms) remains 8/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 8/8 properties
[2026-05-23 06:32:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 438/511 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 897/1408 variables, 511/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/1408 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1408/1408 variables, and 548 constraints, problems are : Problem set: 0 solved, 8 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 69/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 438/511 variables, 33/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/511 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 897/1408 variables, 511/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1408 variables, 8/557 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1408 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1408 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1408/1408 variables, and 557 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2549 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3372ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 12638 steps, including 62 resets, run visited all 8 properties in 203 ms. (steps per millisecond=62 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 206 ms.
Negative knowledge disproves property using: (G (OR p0 p1 (NOT p2)))
Knowledge based reduction with 34 factoid took 150 ms. Proved property starting from automaton with 12 states, 36 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 4418 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-01 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Champagne-PT-H08T1U-LTLFireability-01 finished in 37316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(X(X(X(X(G(p1)))))))))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 528 transition count 914
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 528 transition count 914
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 60 place count 514 transition count 900
Iterating global reduction 0 with 14 rules applied. Total rules applied 74 place count 514 transition count 900
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 509 transition count 895
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 509 transition count 895
Applied a total of 84 rules in 96 ms. Remains 509 /551 variables (removed 42) and now considering 895/937 (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-17146048296801505620.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7514856955887293991.kers'
[2026-05-23 06:32:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17146048296801505620.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7514856955887293991.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 895 rows 509 cols 2550 entries
Finished phase 1 with 472 SingleSign rule and 0 generalized
[2026-05-23 06:32:23] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7514856955887293991.kers
Total runtime 9 ms.
[2026-05-23 06:32:24] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-05-23 06:32:24] [INFO ] Invariant cache hit.
[2026-05-23 06:32:24] [INFO ] Implicit Places using invariants and state equation in 567 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Running 894 sub problems to find dead transitions.
[2026-05-23 06:32:24] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 894 unsolved
SMT process timed out in 30207ms, After SMT, problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 30212ms
Starting structural reductions in LTL mode, iteration 1 : 509/551 places, 895/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31306 ms. Remains : 509/551 places, 895/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(X(X(X(X(G(p1)))))))))))'
Stuttering acceptance computed with spot in 498 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-02
Stuttering criterion allowed to conclude after 1114 steps with 1 reset in 10 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-02 finished in 31885 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(p1)||G(p2))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Graph (trivial) has 565 edges and 551 vertex of which 277 / 551 are part of one of the 35 SCC in 3 ms
Free SCC test removed 242 places
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 266 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 308 transition count 621
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 119 rules applied. Total rules applied 169 place count 259 transition count 551
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 204 place count 224 transition count 551
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 204 place count 224 transition count 549
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 222 transition count 549
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 237 place count 193 transition count 425
Iterating global reduction 3 with 29 rules applied. Total rules applied 266 place count 193 transition count 425
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 284 place count 193 transition count 407
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 286 place count 191 transition count 396
Iterating global reduction 4 with 2 rules applied. Total rules applied 288 place count 191 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 290 place count 191 transition count 394
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 444 place count 114 transition count 317
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 448 place count 110 transition count 300
Iterating global reduction 5 with 4 rules applied. Total rules applied 452 place count 110 transition count 300
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 456 place count 110 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 460 place count 108 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 475 place count 108 transition count 294
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 477 place count 106 transition count 279
Iterating global reduction 6 with 2 rules applied. Total rules applied 479 place count 106 transition count 279
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 481 place count 106 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 483 place count 104 transition count 275
Applied a total of 483 rules in 162 ms. Remains 104 /551 variables (removed 447) and now considering 275/937 (removed 662) transitions.
[2026-05-23 06:32:55] [INFO ] Flow matrix only has 109 transitions (discarded 166 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16916594356867046467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9943924877500763974.kers'
[2026-05-23 06:32:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16916594356867046467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9943924877500763974.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 108 rows 94 cols 288 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-23 06:32:55] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9943924877500763974.kers
Total runtime 1 ms.
[2026-05-23 06:32:55] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-23 06:32:55] [INFO ] Flow matrix only has 109 transitions (discarded 166 similar events)
[2026-05-23 06:32:55] [INFO ] Invariant cache hit.
[2026-05-23 06:32:56] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2026-05-23 06:32:56] [INFO ] Redundant transitions in 5 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-23 06:32:56] [INFO ] Flow matrix only has 109 transitions (discarded 166 similar events)
[2026-05-23 06:32:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 108/212 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 0/212 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/213 variables, and 141 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10842 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 4/104 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 108/212 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 177/318 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/212 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/213 variables, and 318 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10749 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21609ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 21611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/551 places, 275/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22275 ms. Remains : 104/551 places, 275/937 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(p1)||G(p2))))'
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-03 finished in 22568 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(!p0)||(p1&&G(p2)))) U p3))'
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 529 transition count 915
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 529 transition count 915
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 57 place count 516 transition count 902
Iterating global reduction 0 with 13 rules applied. Total rules applied 70 place count 516 transition count 902
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 512 transition count 898
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 512 transition count 898
Applied a total of 78 rules in 62 ms. Remains 512 /551 variables (removed 39) and now considering 898/937 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3115641736312059360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17990138953900518302.kers'
[2026-05-23 06:33:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3115641736312059360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17990138953900518302.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 898 rows 512 cols 2556 entries
Finished phase 1 with 475 SingleSign rule and 0 generalized
[2026-05-23 06:33:18] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17990138953900518302.kers
Total runtime 8 ms.
[2026-05-23 06:33:18] [INFO ] Implicit Places using invariants in 418 ms returned []
[2026-05-23 06:33:18] [INFO ] Invariant cache hit.
[2026-05-23 06:33:19] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 897 sub problems to find dead transitions.
[2026-05-23 06:33:19] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 897 unsolved
SMT process timed out in 30217ms, After SMT, problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 30220ms
Starting structural reductions in LTL mode, iteration 1 : 512/551 places, 898/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31358 ms. Remains : 512/551 places, 898/937 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(!p0)||(p1&&G(p2)))) U p3))'
Stuttering acceptance computed with spot in 298 ms :[(NOT p3), p0, (NOT p0), (AND (NOT p2) p0), true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-04
Stuttering criterion allowed to conclude after 812 steps with 1 reset in 6 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-04 finished in 31722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U G(p1))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 526 transition count 912
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 526 transition count 912
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 64 place count 512 transition count 898
Iterating global reduction 0 with 14 rules applied. Total rules applied 78 place count 512 transition count 898
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 507 transition count 893
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 507 transition count 893
Applied a total of 88 rules in 53 ms. Remains 507 /551 variables (removed 44) and now considering 893/937 (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-13848849113763589954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2300416078111566761.kers'
[2026-05-23 06:33:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13848849113763589954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2300416078111566761.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 893 rows 507 cols 2546 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 06:33:49] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2300416078111566761.kers
Total runtime 9 ms.
[2026-05-23 06:33:50] [INFO ] Implicit Places using invariants in 403 ms returned []
[2026-05-23 06:33:50] [INFO ] Invariant cache hit.
[2026-05-23 06:33:51] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2026-05-23 06:33:51] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Starting structural reductions in LTL mode, iteration 1 : 507/551 places, 893/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31537 ms. Remains : 507/551 places, 893/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U G(p1))))'
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-05
Product exploration explored 100000 steps with 20012 reset in 337 ms.
Stack based approach found an accepted trace after 34663 steps with 6953 reset with depth 6 and stack size 6 in 148 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-05 finished in 32493 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(p1))) U (p1&&(p0||X(!p0)))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 527 transition count 913
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 527 transition count 913
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 514 transition count 900
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 514 transition count 900
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 510 transition count 896
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 510 transition count 896
Applied a total of 82 rules in 53 ms. Remains 510 /551 variables (removed 41) and now considering 896/937 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17775554547877533055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10706480825047204418.kers'
[2026-05-23 06:34:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17775554547877533055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10706480825047204418.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 896 rows 510 cols 2552 entries
Finished phase 1 with 473 SingleSign rule and 0 generalized
[2026-05-23 06:34:22] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10706480825047204418.kers
Total runtime 8 ms.
[2026-05-23 06:34:22] [INFO ] Implicit Places using invariants in 391 ms returned []
[2026-05-23 06:34:22] [INFO ] Invariant cache hit.
[2026-05-23 06:34:23] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1060 ms to find 0 implicit places.
Running 895 sub problems to find dead transitions.
[2026-05-23 06:34:23] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 895 unsolved
SMT process timed out in 30211ms, After SMT, problems are : Problem set: 0 solved, 895 unsolved
Search for dead transitions found 0 dead transitions in 30216ms
Starting structural reductions in LTL mode, iteration 1 : 510/551 places, 896/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31334 ms. Remains : 510/551 places, 896/937 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((X(p0)||p1)) U (p0&&(X(!p1)||p1))))'
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-06 finished in 31534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((p2||X(G(p2)))&&(X(p0) U ((p1&&X(p0))||X(G(p0))))))))'
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 528 transition count 914
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 528 transition count 914
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 515 transition count 901
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 515 transition count 901
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 511 transition count 897
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 511 transition count 897
Applied a total of 80 rules in 36 ms. Remains 511 /551 variables (removed 40) and now considering 897/937 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16481979975611198911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16156231573559144535.kers'
[2026-05-23 06:34:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16481979975611198911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16156231573559144535.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 511 cols 2554 entries
Finished phase 1 with 474 SingleSign rule and 0 generalized
[2026-05-23 06:34:53] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16156231573559144535.kers
Total runtime 5 ms.
[2026-05-23 06:34:54] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-23 06:34:54] [INFO ] Invariant cache hit.
[2026-05-23 06:34:54] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2026-05-23 06:34:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
SMT process timed out in 30204ms, After SMT, problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 30207ms
Starting structural reductions in LTL mode, iteration 1 : 511/551 places, 897/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31282 ms. Remains : 511/551 places, 897/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U (X(G(p0))||(p1&&X(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||((X(p0) U ((p1&&X(p0))||X(G(p0))))&&(X(G(p2))||p2)))))'
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-08
Product exploration explored 100000 steps with 33430 reset in 327 ms.
Product exploration explored 100000 steps with 33249 reset in 350 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/511 stabilizing places and 39/897 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 18 factoid took 99 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (58 resets) in 674 ms. (59 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2026-05-23 06:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 434/511 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 897/1408 variables, 511/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1408 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1408/1408 variables, and 548 constraints, problems are : Problem set: 0 solved, 2 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 434/511 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 897/1408 variables, 511/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1408 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1408 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1408/1408 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1876ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 153 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=51 )
Parikh walk visited 2 properties in 3 ms.
Knowledge based reduction with 18 factoid took 312 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Knowledge-based reduction took 3064 ms.
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 897/897 transitions.
Applied a total of 0 rules in 15 ms. Remains 511 /511 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2026-05-23 06:35:29] [INFO ] Invariant cache hit.
[2026-05-23 06:35:29] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-23 06:35:29] [INFO ] Invariant cache hit.
[2026-05-23 06:35:30] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1265 ms. Remains : 511/511 places, 897/897 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/511 stabilizing places and 39/897 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 15 factoid took 123 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (61 resets) in 497 ms. (80 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
[2026-05-23 06:35:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 434/511 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 897/1408 variables, 511/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1408 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1408/1408 variables, and 548 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 434/511 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 897/1408 variables, 511/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1408 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1408 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1408 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1408/1408 variables, and 550 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 511/511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2094ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 161 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 7 ms.
Knowledge based reduction with 15 factoid took 315 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Knowledge-based reduction took 3211 ms.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 24964 reset in 254 ms.
Product exploration explored 100000 steps with 24965 reset in 277 ms.
Spot run failed in 173 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/ltsmin1946772823936022206
[2026-05-23 06:35:35] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1946772823936022206
Running compilation step : cd /tmp/ltsmin1946772823936022206;'/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 2908 ms.
Running link step : cd /tmp/ltsmin1946772823936022206;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin1946772823936022206;'/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/stateBased10426390312481400936.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 897/897 transitions.
Applied a total of 0 rules in 14 ms. Remains 511 /511 variables (removed 0) and now considering 897/897 (removed 0) transitions.
[2026-05-23 06:35:50] [INFO ] Invariant cache hit.
[2026-05-23 06:35:51] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-23 06:35:51] [INFO ] Invariant cache hit.
[2026-05-23 06:35:51] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1267 ms. Remains : 511/511 places, 897/897 transitions.
Built C files in :
/tmp/ltsmin4342374959474501428
[2026-05-23 06:35:51] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4342374959474501428
Running compilation step : cd /tmp/ltsmin4342374959474501428;'/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 2326 ms.
Running link step : cd /tmp/ltsmin4342374959474501428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin4342374959474501428;'/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/stateBased8595577835893353038.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 06:36:07] [INFO ] Flatten gal took : 73 ms
[2026-05-23 06:36:07] [INFO ] Flatten gal took : 74 ms
[2026-05-23 06:36:07] [INFO ] Time to serialize gal into /tmp/LTL15656249946271656705.gal : 16 ms
[2026-05-23 06:36:07] [INFO ] Time to serialize properties into /tmp/LTL14551801736843604311.prop : 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/LTL15656249946271656705.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1884317426133489674.hoa' '-atoms' '/tmp/LTL14551801736843604311.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...319
Loading property file /tmp/LTL14551801736843604311.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1884317426133489674.hoa
Detected timeout of ITS tools.
[2026-05-23 06:36:22] [INFO ] Flatten gal took : 57 ms
[2026-05-23 06:36:22] [INFO ] Flatten gal took : 48 ms
[2026-05-23 06:36:22] [INFO ] Time to serialize gal into /tmp/LTL7394679802873311791.gal : 10 ms
[2026-05-23 06:36:22] [INFO ] Time to serialize properties into /tmp/LTL4244578984189491975.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/LTL7394679802873311791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4244578984189491975.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((X("(p20!=1)"))U((X(G("(p20!=1)")))||(("(p624!=1)")&&(X("(p20!=1)")))))U((G((X("(p20!=1)"))U((X(G("(p20!=1)")))||(("(p624!=1)")&&(...316
Formula 0 simplified : (!"((p830==1)&&(p871==1))" & XF!"((p830==1)&&(p871==1))") U (X!"(p20!=1)" R (XF!"(p20!=1)" & (!"(p624!=1)" | X!"(p20!=1)")))
Detected timeout of ITS tools.
[2026-05-23 06:36:37] [INFO ] Flatten gal took : 29 ms
[2026-05-23 06:36:37] [INFO ] Applying decomposition
[2026-05-23 06:36:37] [INFO ] Flatten gal took : 28 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/graph15636974710917281562.txt' '-o' '/tmp/graph15636974710917281562.bin' '-w' '/tmp/graph15636974710917281562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15636974710917281562.bin' '-l' '-1' '-v' '-w' '/tmp/graph15636974710917281562.weights' '-q' '0' '-e' '0.001'
[2026-05-23 06:36:37] [INFO ] Decomposing Gal with order
[2026-05-23 06:36:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 06:36:37] [INFO ] Removed a total of 772 redundant transitions.
[2026-05-23 06:36:38] [INFO ] Flatten gal took : 156 ms
[2026-05-23 06:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 32 ms.
[2026-05-23 06:36:38] [INFO ] Time to serialize gal into /tmp/LTL4132903401678052895.gal : 17 ms
[2026-05-23 06:36:38] [INFO ] Time to serialize properties into /tmp/LTL16218838492688394268.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4132903401678052895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16218838492688394268.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((X("(i0.u5.p20!=1)"))U((X(G("(i0.u5.p20!=1)")))||(("(i26.i0.u127.p624!=1)")&&(X("(i0.u5.p20!=1)")))))U((G((X("(i0.u5.p20!=1)"))U((...454
Formula 0 simplified : (!"((i29.i3.u158.p830==1)&&(i31.i0.u167.p871==1))" & XF!"((i29.i3.u158.p830==1)&&(i31.i0.u167.p871==1))") U (X!"(i0.u5.p20!=1)" R (X...225
Reverse transition relation is NOT exact ! Due to transitions t39, t68, t118, t180, t245, t323, i0.t585, i1.i1.t571, i2.i1.t556, i3.i1.t539, i4.i1.t524, i5...605
Computing Next relation with stutter on 7.6256e+12 deadlock states
6 unique states visited
5 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
358 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.69038,123756,1,0,244593,635,7668,320679,308,1678,651759
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Champagne-PT-H08T1U-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Champagne-PT-H08T1U-LTLFireability-08 finished in 108672 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(G(p0)) U G(p1))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 527 transition count 913
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 527 transition count 913
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 514 transition count 900
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 514 transition count 900
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 509 transition count 895
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 509 transition count 895
Applied a total of 84 rules in 32 ms. Remains 509 /551 variables (removed 42) and now considering 895/937 (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-1718636086337746882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5313718544131852771.kers'
[2026-05-23 06:36:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1718636086337746882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5313718544131852771.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 895 rows 509 cols 2550 entries
Finished phase 1 with 472 SingleSign rule and 0 generalized
[2026-05-23 06:36:42] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5313718544131852771.kers
Total runtime 5 ms.
[2026-05-23 06:36:42] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-23 06:36:42] [INFO ] Invariant cache hit.
[2026-05-23 06:36:43] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
Running 894 sub problems to find dead transitions.
[2026-05-23 06:36:43] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 894 unsolved
SMT process timed out in 30162ms, After SMT, problems are : Problem set: 0 solved, 894 unsolved
Search for dead transitions found 0 dead transitions in 30164ms
Starting structural reductions in LTL mode, iteration 1 : 509/551 places, 895/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31098 ms. Remains : 509/551 places, 895/937 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(G(p0)) U G(p1))))'
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-09
Stuttering criterion allowed to conclude after 638 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-09 finished in 31327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 526 transition count 912
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 526 transition count 912
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 64 place count 512 transition count 898
Iterating global reduction 0 with 14 rules applied. Total rules applied 78 place count 512 transition count 898
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 83 place count 507 transition count 893
Iterating global reduction 0 with 5 rules applied. Total rules applied 88 place count 507 transition count 893
Applied a total of 88 rules in 50 ms. Remains 507 /551 variables (removed 44) and now considering 893/937 (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-14981243630820858025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18119748613193961165.kers'
[2026-05-23 06:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14981243630820858025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18119748613193961165.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 893 rows 507 cols 2546 entries
Finished phase 1 with 470 SingleSign rule and 0 generalized
[2026-05-23 06:37:13] [INFO ] Computed 37 invariants in 7 ms
Computed 37 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-18119748613193961165.kers
Total runtime 10 ms.
[2026-05-23 06:37:14] [INFO ] Implicit Places using invariants in 408 ms returned []
[2026-05-23 06:37:14] [INFO ] Invariant cache hit.
[2026-05-23 06:37:15] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
Running 892 sub problems to find dead transitions.
[2026-05-23 06:37:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 892 unsolved
SMT process timed out in 30227ms, After SMT, problems are : Problem set: 0 solved, 892 unsolved
Search for dead transitions found 0 dead transitions in 30230ms
Starting structural reductions in LTL mode, iteration 1 : 507/551 places, 893/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31580 ms. Remains : 507/551 places, 893/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-10 finished in 31794 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 1 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Graph (trivial) has 569 edges and 551 vertex of which 281 / 551 are part of one of the 36 SCC in 2 ms
Free SCC test removed 245 places
Ensure Unique test removed 267 transitions
Reduce isomorphic transitions removed 267 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 305 transition count 620
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 121 rules applied. Total rules applied 171 place count 256 transition count 548
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 37 rules applied. Total rules applied 208 place count 220 transition count 547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 209 place count 219 transition count 547
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 209 place count 219 transition count 546
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 211 place count 218 transition count 546
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 241 place count 188 transition count 409
Iterating global reduction 4 with 30 rules applied. Total rules applied 271 place count 188 transition count 409
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 290 place count 188 transition count 390
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 292 place count 186 transition count 379
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 186 transition count 379
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 296 place count 186 transition count 377
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 446 place count 111 transition count 302
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 451 place count 106 transition count 278
Iterating global reduction 6 with 5 rules applied. Total rules applied 456 place count 106 transition count 278
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 461 place count 106 transition count 273
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 463 place count 105 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 464 place count 105 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 466 place count 105 transition count 271
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 467 place count 104 transition count 269
Iterating global reduction 8 with 1 rules applied. Total rules applied 468 place count 104 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 469 place count 104 transition count 268
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 471 place count 102 transition count 266
Applied a total of 471 rules in 138 ms. Remains 102 /551 variables (removed 449) and now considering 266/937 (removed 671) transitions.
[2026-05-23 06:37:45] [INFO ] Flow matrix only has 95 transitions (discarded 171 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7118288907949098919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15841512167053331487.kers'
[2026-05-23 06:37:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7118288907949098919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15841512167053331487.kers]
Normalized transition count is 94 out of 95 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 94 rows 92 cols 240 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-23 06:37:45] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15841512167053331487.kers
Total runtime 1 ms.
[2026-05-23 06:37:45] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-23 06:37:45] [INFO ] Flow matrix only has 95 transitions (discarded 171 similar events)
[2026-05-23 06:37:45] [INFO ] Invariant cache hit.
[2026-05-23 06:37:46] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2026-05-23 06:37:46] [INFO ] Redundant transitions in 6 ms returned []
Running 167 sub problems to find dead transitions.
[2026-05-23 06:37:46] [INFO ] Flow matrix only has 95 transitions (discarded 171 similar events)
[2026-05-23 06:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 94/196 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/197 variables, and 139 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9739 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 94/196 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 167/306 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/197 variables, and 306 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9801 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19561ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 19562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/551 places, 266/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20136 ms. Remains : 102/551 places, 266/937 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 44 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-11 finished in 20213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X((F(p2) U X(p0))))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 528 transition count 914
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 528 transition count 914
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 515 transition count 901
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 515 transition count 901
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 511 transition count 897
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 511 transition count 897
Applied a total of 80 rules in 49 ms. Remains 511 /551 variables (removed 40) and now considering 897/937 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2640292618028225822.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15554512121000159988.kers'
[2026-05-23 06:38:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2640292618028225822.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15554512121000159988.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 897 rows 511 cols 2554 entries
Finished phase 1 with 474 SingleSign rule and 0 generalized
[2026-05-23 06:38:05] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15554512121000159988.kers
Total runtime 5 ms.
[2026-05-23 06:38:06] [INFO ] Implicit Places using invariants in 332 ms returned []
[2026-05-23 06:38:06] [INFO ] Invariant cache hit.
[2026-05-23 06:38:06] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1155 ms to find 0 implicit places.
Running 896 sub problems to find dead transitions.
[2026-05-23 06:38:06] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 896 unsolved
SMT process timed out in 30201ms, After SMT, problems are : Problem set: 0 solved, 896 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Starting structural reductions in LTL mode, iteration 1 : 511/551 places, 897/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31413 ms. Remains : 511/551 places, 897/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X((F(p2) U X(p0))))))'
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-12 finished in 31879 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(G(p0)) U p1)&&X(F(p2))))'
Support contains 5 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 528 transition count 914
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 528 transition count 914
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 59 place count 515 transition count 901
Iterating global reduction 0 with 13 rules applied. Total rules applied 72 place count 515 transition count 901
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 511 transition count 897
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 511 transition count 897
Applied a total of 80 rules in 49 ms. Remains 511 /551 variables (removed 40) and now considering 897/937 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3633405013513821836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5105398148188545911.kers'
[2026-05-23 06:38:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3633405013513821836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5105398148188545911.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 897 rows 511 cols 2554 entries
Finished phase 1 with 474 SingleSign rule and 0 generalized
[2026-05-23 06:38:37] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5105398148188545911.kers
Total runtime 8 ms.
[2026-05-23 06:38:38] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-23 06:38:38] [INFO ] Invariant cache hit.
[2026-05-23 06:38:38] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 511/551 places, 897/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1340 ms. Remains : 511/551 places, 897/937 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(G(p0)) U p1)&&X(F(p2))))'
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) p0), p0]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-13
Stuttering criterion allowed to conclude after 2064 steps with 8 reset in 14 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-13 finished in 1614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Graph (trivial) has 570 edges and 551 vertex of which 284 / 551 are part of one of the 36 SCC in 1 ms
Free SCC test removed 248 places
Ensure Unique test removed 272 transitions
Reduce isomorphic transitions removed 272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 302 transition count 617
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 1 with 117 rules applied. Total rules applied 165 place count 255 transition count 547
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 200 place count 220 transition count 547
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 200 place count 220 transition count 545
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 218 transition count 545
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 234 place count 188 transition count 407
Iterating global reduction 3 with 30 rules applied. Total rules applied 264 place count 188 transition count 407
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 284 place count 188 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 285 place count 187 transition count 380
Iterating global reduction 4 with 1 rules applied. Total rules applied 286 place count 187 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 287 place count 187 transition count 379
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 435 place count 113 transition count 305
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 440 place count 108 transition count 281
Iterating global reduction 5 with 5 rules applied. Total rules applied 445 place count 108 transition count 281
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 450 place count 108 transition count 276
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 452 place count 107 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 456 place count 107 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 458 place count 105 transition count 273
Applied a total of 458 rules in 88 ms. Remains 105 /551 variables (removed 446) and now considering 273/937 (removed 664) transitions.
[2026-05-23 06:38:39] [INFO ] Flow matrix only has 99 transitions (discarded 174 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8268455773300968881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10555480883612900160.kers'
[2026-05-23 06:38:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8268455773300968881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10555480883612900160.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 98 rows 95 cols 248 entries
Finished phase 1 with 68 SingleSign rule and 0 generalized
[2026-05-23 06:38:39] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10555480883612900160.kers
Total runtime 4 ms.
[2026-05-23 06:38:39] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 06:38:39] [INFO ] Flow matrix only has 99 transitions (discarded 174 similar events)
[2026-05-23 06:38:39] [INFO ] Invariant cache hit.
[2026-05-23 06:38:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2026-05-23 06:38:39] [INFO ] Redundant transitions in 6 ms returned []
Running 172 sub problems to find dead transitions.
[2026-05-23 06:38:39] [INFO ] Flow matrix only has 99 transitions (discarded 174 similar events)
[2026-05-23 06:38:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 98/203 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/203 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/204 variables, and 142 constraints, problems are : Problem set: 0 solved, 172 unsolved in 10498 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/105 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 98/203 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 172/314 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/204 variables, and 314 constraints, problems are : Problem set: 0 solved, 172 unsolved in 10551 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21074ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 21074ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/551 places, 273/937 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21609 ms. Remains : 105/551 places, 273/937 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-14 finished in 21853 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(G((G(p0) U p1))) U p2) U G(!p2))))'
Support contains 3 out of 551 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 551/551 places, 937/937 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 529 transition count 915
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 529 transition count 915
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 56 place count 517 transition count 903
Iterating global reduction 0 with 12 rules applied. Total rules applied 68 place count 517 transition count 903
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 512 transition count 898
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 512 transition count 898
Applied a total of 78 rules in 48 ms. Remains 512 /551 variables (removed 39) and now considering 898/937 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2224809344821955260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9169642670054380177.kers'
[2026-05-23 06:39:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2224809344821955260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9169642670054380177.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 898 rows 512 cols 2556 entries
Finished phase 1 with 475 SingleSign rule and 0 generalized
[2026-05-23 06:39:01] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-9169642670054380177.kers
Total runtime 9 ms.
[2026-05-23 06:39:01] [INFO ] Implicit Places using invariants in 372 ms returned []
[2026-05-23 06:39:01] [INFO ] Invariant cache hit.
[2026-05-23 06:39:02] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1230 ms to find 0 implicit places.
Running 897 sub problems to find dead transitions.
[2026-05-23 06:39:02] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 897 unsolved
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Starting structural reductions in LTL mode, iteration 1 : 512/551 places, 898/937 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31490 ms. Remains : 512/551 places, 898/937 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(G((G(p0) U p1))) U p2) U G(!p2))))'
Stuttering acceptance computed with spot in 266 ms :[p2, p2, (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T1U-LTLFireability-15
Stuttering criterion allowed to conclude after 751 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H08T1U-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T1U-LTLFireability-15 finished in 31841 ms.
All properties solved by simple procedures.
Total runtime 522354 ms.

BK_STOP 1779518372933

--------------------
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="Champagne-PT-H08T1U"
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 Champagne-PT-H08T1U, 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 r050-smll-177946901100108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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