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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 8.0K Mar 6 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 6 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 16K Mar 6 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 174K Mar 6 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 6 10:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 10:48 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 250K 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-H08T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H08T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779513510977

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-H08T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 05:18:33] [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 05:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 05:18:33] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2026-05-23 05:18:33] [INFO ] Transformed 739 places.
[2026-05-23 05:18:34] [INFO ] Transformed 1088 transitions.
[2026-05-23 05:18:34] [INFO ] Found NUPN structural information;
[2026-05-23 05:18:34] [INFO ] Parsed PT model containing 739 places and 1088 transitions and 2936 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Champagne-PT-H08T0R-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H08T0R-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 1088/1088 transitions.
Discarding 178 places :
Symmetric choice reduction at 0 with 178 rule applications. Total rules 178 place count 561 transition count 910
Iterating global reduction 0 with 178 rules applied. Total rules applied 356 place count 561 transition count 910
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 459 place count 458 transition count 807
Iterating global reduction 0 with 103 rules applied. Total rules applied 562 place count 458 transition count 807
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 633 place count 387 transition count 641
Iterating global reduction 0 with 71 rules applied. Total rules applied 704 place count 387 transition count 641
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 733 place count 387 transition count 612
Applied a total of 733 rules in 229 ms. Remains 387 /739 variables (removed 352) and now considering 612/1088 (removed 476) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3330420184682208044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8425415120864568092.kers'
[2026-05-23 05:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3330420184682208044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8425415120864568092.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 612 rows 387 cols 1756 entries
Finished phase 1 with 350 SingleSign rule and 0 generalized
[2026-05-23 05:18:34] [INFO ] Computed 37 invariants in 4 ms
Computed 37 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8425415120864568092.kers
Total runtime 7 ms.
[2026-05-23 05:18:35] [INFO ] Implicit Places using invariants in 708 ms returned []
[2026-05-23 05:18:35] [INFO ] Invariant cache hit.
[2026-05-23 05:18:36] [INFO ] Implicit Places using invariants and state equation in 901 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
Running 611 sub problems to find dead transitions.
[2026-05-23 05:18:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (OVERLAPS) 1/387 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/999 variables, and 37 constraints, problems are : Problem set: 0 solved, 611 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/387 constraints, PredecessorRefiner: 611/611 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 611 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 1 (OVERLAPS) 1/387 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 611 unsolved
At refinement iteration 3 (OVERLAPS) 612/999 variables, 387/424 constraints. Problems are: Problem set: 0 solved, 611 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/999 variables, and 1035 constraints, problems are : Problem set: 0 solved, 611 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 387/387 constraints, PredecessorRefiner: 611/611 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 611 unsolved
Search for dead transitions found 0 dead transitions in 60598ms
Starting structural reductions in LTL mode, iteration 1 : 387/739 places, 612/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 387/739 places, 612/1088 transitions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Applied a total of 0 rules in 14 ms. Remains 387 /387 variables (removed 0) and now considering 612/612 (removed 0) transitions.
[2026-05-23 05:19:36] [INFO ] Invariant cache hit.
[2026-05-23 05:19:37] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-23 05:19:37] [INFO ] Invariant cache hit.
[2026-05-23 05:19:37] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 387/387 places, 612/612 transitions.
Support contains 31 out of 387 places after structural reductions.
[2026-05-23 05:19:38] [INFO ] Flatten gal took : 129 ms
[2026-05-23 05:19:38] [INFO ] Flatten gal took : 80 ms
[2026-05-23 05:19:38] [INFO ] Input system was already deterministic with 612 transitions.
Support contains 30 out of 387 places (down from 31) after GAL structural reductions.
RANDOM walk for 21404 steps (52 resets) in 1489 ms. (14 steps per ms) remains 0/26 properties
Computed a total of 46 stabilizing places and 46 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 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Graph (trivial) has 361 edges and 387 vertex of which 54 / 387 are part of one of the 12 SCC in 4 ms
Free SCC test removed 42 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 344 transition count 515
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 118 rules applied. Total rules applied 171 place count 292 transition count 449
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 204 place count 260 transition count 448
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 259 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 258 transition count 446
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 22 Pre rules applied. Total rules applied 208 place count 258 transition count 424
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 252 place count 236 transition count 424
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 265 place count 223 transition count 383
Iterating global reduction 5 with 13 rules applied. Total rules applied 278 place count 223 transition count 383
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 283 place count 223 transition count 378
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 283 place count 223 transition count 375
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 289 place count 220 transition count 375
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 6 with 222 rules applied. Total rules applied 511 place count 109 transition count 264
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 514 place count 106 transition count 248
Iterating global reduction 6 with 3 rules applied. Total rules applied 517 place count 106 transition count 248
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 520 place count 106 transition count 245
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 522 place count 104 transition count 243
Applied a total of 522 rules in 147 ms. Remains 104 /387 variables (removed 283) and now considering 243/612 (removed 369) transitions.
[2026-05-23 05:19:39] [INFO ] Flow matrix only has 103 transitions (discarded 140 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2439841787647399885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16728546125543071308.kers'
[2026-05-23 05:19:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2439841787647399885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16728546125543071308.kers]
Normalized transition count is 102 out of 103 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 102 rows 95 cols 274 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-23 05:19:39] [INFO ] Computed 37 invariants in 1 ms
Computed 37 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-16728546125543071308.kers
Total runtime 12 ms.
[2026-05-23 05:19:39] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-23 05:19:39] [INFO ] Flow matrix only has 103 transitions (discarded 140 similar events)
[2026-05-23 05:19:39] [INFO ] Invariant cache hit.
[2026-05-23 05:19:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 05:19:40] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2026-05-23 05:19:40] [INFO ] Redundant transitions in 21 ms returned []
Running 172 sub problems to find dead transitions.
[2026-05-23 05:19:40] [INFO ] Flow matrix only has 103 transitions (discarded 140 similar events)
[2026-05-23 05:19:40] [INFO ] Invariant cache hit.
[2026-05-23 05:19:40] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 3/104 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 102/206 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/206 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/207 variables, and 143 constraints, problems are : Problem set: 0 solved, 172 unsolved in 10021 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 2/2 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/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 3/104 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 102/206 variables, 104/141 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 172/315 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/207 variables, and 315 constraints, problems are : Problem set: 0 solved, 172 unsolved in 8167 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18263ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 18267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/387 places, 243/612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18977 ms. Remains : 104/387 places, 243/612 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 403 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-00 finished in 19489 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((F(p0)&&G(p1))) U X(p2)) U p1))'
Support contains 3 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 374 transition count 571
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 374 transition count 571
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 374 transition count 566
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 368 transition count 560
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 368 transition count 560
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 364 transition count 543
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 364 transition count 543
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 364 transition count 540
Applied a total of 54 rules in 67 ms. Remains 364 /387 variables (removed 23) and now considering 540/612 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4571358351599135183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16681583971784652390.kers'
[2026-05-23 05:19:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4571358351599135183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16681583971784652390.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 540 rows 364 cols 1514 entries
Finished phase 1 with 327 SingleSign rule and 0 generalized
[2026-05-23 05:19:59] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16681583971784652390.kers
Total runtime 4 ms.
[2026-05-23 05:19:59] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-23 05:19:59] [INFO ] Invariant cache hit.
[2026-05-23 05:19:59] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2026-05-23 05:19:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 540/904 variables, 364/401 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/904 variables, and 401 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (OVERLAPS) 540/904 variables, 364/401 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/904 variables, 539/940 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/904 variables, and 940 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 364/387 places, 540/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60861 ms. Remains : 364/387 places, 540/612 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((F(p0)&&G(p1))) U X(p2)) U p1))'
Stuttering acceptance computed with spot in 467 ms :[(NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-01
Stuttering criterion allowed to conclude after 474 steps with 1 reset in 14 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-01 finished in 61415 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)||(X(X(p1)) U ((X(X(p1))&&G(!p0))||X(X(G(p1)))))))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 373 transition count 570
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 373 transition count 570
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 373 transition count 565
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 365 transition count 557
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 365 transition count 557
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 360 transition count 539
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 360 transition count 539
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 360 transition count 536
Applied a total of 62 rules in 42 ms. Remains 360 /387 variables (removed 27) and now considering 536/612 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2617448210876433871.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15294907969716826046.kers'
[2026-05-23 05:21:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2617448210876433871.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15294907969716826046.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 536 rows 360 cols 1506 entries
Finished phase 1 with 323 SingleSign rule and 0 generalized
[2026-05-23 05:21:00] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15294907969716826046.kers
Total runtime 5 ms.
[2026-05-23 05:21:00] [INFO ] Implicit Places using invariants in 268 ms returned []
[2026-05-23 05:21:00] [INFO ] Invariant cache hit.
[2026-05-23 05:21:01] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 535 sub problems to find dead transitions.
[2026-05-23 05:21:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/896 variables, and 37 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 535 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 3 (OVERLAPS) 536/896 variables, 360/397 constraints. Problems are: Problem set: 0 solved, 535 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/896 variables, 535/932 constraints. Problems are: Problem set: 0 solved, 535 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 896/896 variables, and 932 constraints, problems are : Problem set: 0 solved, 535 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 535/535 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 535 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 360/387 places, 536/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61064 ms. Remains : 360/387 places, 536/612 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)||(X(X(p1)) U ((X(X(p1))&&G(!p0))||X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 507 ms :[true, (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), p0, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-02 finished in 61646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(G(!p2))))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 374 transition count 575
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 374 transition count 575
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 374 transition count 571
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 37 place count 367 transition count 564
Iterating global reduction 1 with 7 rules applied. Total rules applied 44 place count 367 transition count 564
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 362 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 362 transition count 546
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 362 transition count 543
Applied a total of 57 rules in 39 ms. Remains 362 /387 variables (removed 25) and now considering 543/612 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2596589199558277553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3495608299044870608.kers'
[2026-05-23 05:22:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2596589199558277553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3495608299044870608.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 543 rows 362 cols 1530 entries
Finished phase 1 with 325 SingleSign rule and 0 generalized
[2026-05-23 05:22:02] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3495608299044870608.kers
Total runtime 5 ms.
[2026-05-23 05:22:02] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-23 05:22:02] [INFO ] Invariant cache hit.
[2026-05-23 05:22:02] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2026-05-23 05:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/905 variables, and 37 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/362 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (OVERLAPS) 543/905 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/905 variables, 542/941 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 905/905 variables, and 941 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 362/387 places, 543/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61123 ms. Remains : 362/387 places, 543/612 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X(G(!p2))))'
Stuttering acceptance computed with spot in 393 ms :[p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-03
Product exploration explored 100000 steps with 33368 reset in 558 ms.
Product exploration explored 100000 steps with 33378 reset in 428 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/362 stabilizing places and 38/543 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 32 factoid took 145 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (102 resets) in 853 ms. (46 steps per ms) remains 1/18 properties
BEST_FIRST walk for 17979 steps (2 resets) in 89 ms. (199 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G (OR p0 p1 (NOT p2)))
Knowledge based reduction with 32 factoid took 145 ms. Proved property starting from automaton with 6 states, 20 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 672 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property Champagne-PT-H08T0R-LTLFireability-03 finished in 63262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X(X(p1))) U X(X(X(G((p2 U p3)))))))'
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 375 transition count 587
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 375 transition count 587
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 375 transition count 584
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 368 transition count 577
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 368 transition count 577
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 363 transition count 559
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 363 transition count 559
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 363 transition count 556
Applied a total of 54 rules in 45 ms. Remains 363 /387 variables (removed 24) and now considering 556/612 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5375908854213782072.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7601817083934292624.kers'
[2026-05-23 05:23:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5375908854213782072.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7601817083934292624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 556 rows 363 cols 1580 entries
Finished phase 1 with 326 SingleSign rule and 0 generalized
[2026-05-23 05:23:05] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7601817083934292624.kers
Total runtime 3 ms.
[2026-05-23 05:23:05] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-23 05:23:05] [INFO ] Invariant cache hit.
[2026-05-23 05:23:06] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 555 sub problems to find dead transitions.
[2026-05-23 05:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/919 variables, and 37 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/363 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 1 (OVERLAPS) 1/363 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 3 (OVERLAPS) 556/919 variables, 363/400 constraints. Problems are: Problem set: 0 solved, 555 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/919 variables, 555/955 constraints. Problems are: Problem set: 0 solved, 555 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/919 variables, and 955 constraints, problems are : Problem set: 0 solved, 555 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 555/555 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 555 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 363/387 places, 556/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61055 ms. Remains : 363/387 places, 556/612 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||X(X(p1))) U X(X(X(G((p2 U p3)))))))'
Stuttering acceptance computed with spot in 1271 ms :[(NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), true, (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-07
Product exploration explored 100000 steps with 25123 reset in 215 ms.
Stack based approach found an accepted trace after 70312 steps with 17598 reset with depth 6 and stack size 6 in 272 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-07 finished in 62914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Graph (trivial) has 359 edges and 387 vertex of which 54 / 387 are part of one of the 12 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 344 transition count 514
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 121 rules applied. Total rules applied 175 place count 291 transition count 446
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 208 place count 258 transition count 446
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 208 place count 258 transition count 425
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 250 place count 237 transition count 425
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 262 place count 225 transition count 388
Iterating global reduction 3 with 12 rules applied. Total rules applied 274 place count 225 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 278 place count 225 transition count 384
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 278 place count 225 transition count 381
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 284 place count 222 transition count 381
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 4 with 228 rules applied. Total rules applied 512 place count 108 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 515 place count 105 transition count 251
Iterating global reduction 4 with 3 rules applied. Total rules applied 518 place count 105 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 521 place count 105 transition count 248
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 523 place count 103 transition count 246
Applied a total of 523 rules in 117 ms. Remains 103 /387 variables (removed 284) and now considering 246/612 (removed 366) transitions.
[2026-05-23 05:24:08] [INFO ] Flow matrix only has 100 transitions (discarded 146 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12083245159493722582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1810208529869079115.kers'
[2026-05-23 05:24:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12083245159493722582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1810208529869079115.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 99 rows 93 cols 258 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-23 05:24:08] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1810208529869079115.kers
Total runtime 1 ms.
[2026-05-23 05:24:08] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-23 05:24:08] [INFO ] Flow matrix only has 100 transitions (discarded 146 similar events)
[2026-05-23 05:24:08] [INFO ] Invariant cache hit.
[2026-05-23 05:24:08] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2026-05-23 05:24:08] [INFO ] Redundant transitions in 22 ms returned []
Running 170 sub problems to find dead transitions.
[2026-05-23 05:24:08] [INFO ] Flow matrix only has 100 transitions (discarded 146 similar events)
[2026-05-23 05:24:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 99/202 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/203 variables, and 140 constraints, problems are : Problem set: 0 solved, 170 unsolved in 9948 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 99/202 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 170/310 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/203 variables, and 310 constraints, problems are : Problem set: 0 solved, 170 unsolved in 10274 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20248ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 20249ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/387 places, 246/612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20822 ms. Remains : 103/387 places, 246/612 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-08 finished in 20966 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 387 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Graph (trivial) has 360 edges and 387 vertex of which 54 / 387 are part of one of the 12 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 344 transition count 514
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 121 rules applied. Total rules applied 175 place count 291 transition count 446
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 208 place count 258 transition count 446
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 208 place count 258 transition count 425
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 250 place count 237 transition count 425
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 263 place count 224 transition count 384
Iterating global reduction 3 with 13 rules applied. Total rules applied 276 place count 224 transition count 384
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 281 place count 224 transition count 379
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 281 place count 224 transition count 376
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 287 place count 221 transition count 376
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 4 with 228 rules applied. Total rules applied 515 place count 107 transition count 262
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 518 place count 104 transition count 246
Iterating global reduction 4 with 3 rules applied. Total rules applied 521 place count 104 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 524 place count 104 transition count 243
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 526 place count 102 transition count 241
Applied a total of 526 rules in 83 ms. Remains 102 /387 variables (removed 285) and now considering 241/612 (removed 371) transitions.
[2026-05-23 05:24:29] [INFO ] Flow matrix only has 99 transitions (discarded 142 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11780652028697529026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3363843926467531226.kers'
[2026-05-23 05:24:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11780652028697529026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3363843926467531226.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 92 cols 258 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-23 05:24:29] [INFO ] Computed 37 invariants in 0 ms
Computed 37 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3363843926467531226.kers
Total runtime 2 ms.
[2026-05-23 05:24:29] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-23 05:24:29] [INFO ] Flow matrix only has 99 transitions (discarded 142 similar events)
[2026-05-23 05:24:29] [INFO ] Invariant cache hit.
[2026-05-23 05:24:29] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2026-05-23 05:24:29] [INFO ] Redundant transitions in 6 ms returned []
Running 166 sub problems to find dead transitions.
[2026-05-23 05:24:29] [INFO ] Flow matrix only has 99 transitions (discarded 142 similar events)
[2026-05-23 05:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 3/102 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 98/200 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/201 variables, and 139 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9975 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 3/102 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 98/200 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 166/305 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/201 variables, and 305 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10136 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20137ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 20138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/387 places, 241/612 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20700 ms. Remains : 102/387 places, 241/612 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 53 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-11 finished in 20791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(((p0 U p1)&&X(p0))) U p2) U X(!p3)))'
Support contains 4 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 374 transition count 571
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 374 transition count 571
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 374 transition count 566
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 368 transition count 560
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 368 transition count 560
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 365 transition count 548
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 365 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 365 transition count 547
Applied a total of 50 rules in 37 ms. Remains 365 /387 variables (removed 22) and now considering 547/612 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5168524720753736728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17942357748338222145.kers'
[2026-05-23 05:24:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5168524720753736728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17942357748338222145.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 547 rows 365 cols 1540 entries
Finished phase 1 with 328 SingleSign rule and 0 generalized
[2026-05-23 05:24:50] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17942357748338222145.kers
Total runtime 5 ms.
[2026-05-23 05:24:50] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-05-23 05:24:50] [INFO ] Invariant cache hit.
[2026-05-23 05:24:50] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 904 ms to find 0 implicit places.
Running 546 sub problems to find dead transitions.
[2026-05-23 05:24:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/912 variables, and 37 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/365 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 547/912 variables, 365/402 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 546/948 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/912 variables, and 948 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 546 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 365/387 places, 547/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61091 ms. Remains : 365/387 places, 547/612 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(((p0 U p1)&&X(p0))) U p2) U X(!p3)))'
Stuttering acceptance computed with spot in 610 ms :[p3, (OR (AND (NOT p1) p2 p3) (AND (NOT p0) p2 p3)), (AND (NOT p2) p3), p3, (AND p2 (NOT p1) p0 p3), (AND (NOT p0) p2 p3), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (NOT p2)]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 618 ms.
Product exploration explored 100000 steps with 50000 reset in 421 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 32 factoid took 15 ms. Proved property starting from automaton with 10 states, 31 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H08T0R-LTLFireability-12 finished in 62895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 2 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 372 transition count 569
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 372 transition count 569
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 372 transition count 564
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 364 transition count 556
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 364 transition count 556
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 359 transition count 538
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 359 transition count 538
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 359 transition count 535
Applied a total of 64 rules in 22 ms. Remains 359 /387 variables (removed 28) and now considering 535/612 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-327014270498760138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17126173735611106751.kers'
[2026-05-23 05:25:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-327014270498760138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17126173735611106751.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 535 rows 359 cols 1504 entries
Finished phase 1 with 322 SingleSign rule and 0 generalized
[2026-05-23 05:25:52] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17126173735611106751.kers
Total runtime 3 ms.
[2026-05-23 05:25:53] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-23 05:25:53] [INFO ] Invariant cache hit.
[2026-05-23 05:25:53] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
Running 534 sub problems to find dead transitions.
[2026-05-23 05:25:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/894 variables, 359/396 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 894/894 variables, and 396 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 1 (OVERLAPS) 1/359 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 3 (OVERLAPS) 535/894 variables, 359/396 constraints. Problems are: Problem set: 0 solved, 534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 534/930 constraints. Problems are: Problem set: 0 solved, 534 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 894/894 variables, and 930 constraints, problems are : Problem set: 0 solved, 534 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 534/534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 534 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 359/387 places, 535/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60899 ms. Remains : 359/387 places, 535/612 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-13
Product exploration explored 100000 steps with 8496 reset in 524 ms.
Stack based approach found an accepted trace after 398 steps with 37 reset with depth 7 and stack size 7 in 3 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-13 finished in 61701 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||F(p1)))||(p2 U p1)) U p3))))'
Support contains 5 out of 387 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 387/387 places, 612/612 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 376 transition count 579
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 376 transition count 579
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 376 transition count 575
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 370 transition count 569
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 370 transition count 569
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 367 transition count 562
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 367 transition count 562
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 367 transition count 560
Applied a total of 46 rules in 39 ms. Remains 367 /387 variables (removed 20) and now considering 560/612 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3951571787190700744.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6841994256133991076.kers'
[2026-05-23 05:26:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3951571787190700744.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6841994256133991076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 560 rows 367 cols 1588 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-23 05:26:54] [INFO ] Computed 37 invariants in 4 ms
Computed 37 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6841994256133991076.kers
Total runtime 5 ms.
[2026-05-23 05:26:54] [INFO ] Implicit Places using invariants in 305 ms returned []
[2026-05-23 05:26:54] [INFO ] Invariant cache hit.
[2026-05-23 05:26:55] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 921 ms to find 0 implicit places.
Running 559 sub problems to find dead transitions.
[2026-05-23 05:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (OVERLAPS) 1/367 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 367/927 variables, and 37 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/367 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 559 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 1 (OVERLAPS) 1/367 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 3 (OVERLAPS) 560/927 variables, 367/404 constraints. Problems are: Problem set: 0 solved, 559 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/927 variables, 559/963 constraints. Problems are: Problem set: 0 solved, 559 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 927/927 variables, and 963 constraints, problems are : Problem set: 0 solved, 559 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 559/559 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 559 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 367/387 places, 560/612 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61120 ms. Remains : 367/387 places, 560/612 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||F(p1)))||(p2 U p1)) U p3))))'
Stuttering acceptance computed with spot in 365 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H08T0R-LTLFireability-14
Stuttering criterion allowed to conclude after 667 steps with 1 reset in 5 ms.
FORMULA Champagne-PT-H08T0R-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H08T0R-LTLFireability-14 finished in 61568 ms.
All properties solved by simple procedures.
Total runtime 562627 ms.

BK_STOP 1779514076157

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-H08T0R"
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-H08T0R, 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-177946901100100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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