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.r098-tall-177955695700668.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 DLCround-PT-13a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.2K Mar 6 17:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 6 17:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 6 17:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 17:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 09:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 987K 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 DLCround-PT-13a-LTLFireability-00
FORMULA_NAME DLCround-PT-13a-LTLFireability-01
FORMULA_NAME DLCround-PT-13a-LTLFireability-02
FORMULA_NAME DLCround-PT-13a-LTLFireability-03
FORMULA_NAME DLCround-PT-13a-LTLFireability-04
FORMULA_NAME DLCround-PT-13a-LTLFireability-05
FORMULA_NAME DLCround-PT-13a-LTLFireability-06
FORMULA_NAME DLCround-PT-13a-LTLFireability-07
FORMULA_NAME DLCround-PT-13a-LTLFireability-08
FORMULA_NAME DLCround-PT-13a-LTLFireability-09
FORMULA_NAME DLCround-PT-13a-LTLFireability-10
FORMULA_NAME DLCround-PT-13a-LTLFireability-11
FORMULA_NAME DLCround-PT-13a-LTLFireability-12
FORMULA_NAME DLCround-PT-13a-LTLFireability-13
FORMULA_NAME DLCround-PT-13a-LTLFireability-14
FORMULA_NAME DLCround-PT-13a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779648727052

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 18:52:08] [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-24 18:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 18:52:08] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2026-05-24 18:52:08] [INFO ] Transformed 463 places.
[2026-05-24 18:52:08] [INFO ] Transformed 3847 transitions.
[2026-05-24 18:52:08] [INFO ] Found NUPN structural information;
[2026-05-24 18:52:08] [INFO ] Parsed PT model containing 463 places and 3847 transitions and 15089 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 352 transitions
Reduce redundant transitions removed 352 transitions.
FORMULA DLCround-PT-13a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 3495/3495 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 440 transition count 3082
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 440 transition count 3082
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 440 transition count 3080
Drop transitions (Redundant composition of simpler transitions.) removed 1013 transitions
Redundant transition composition rules discarded 1013 transitions
Iterating global reduction 1 with 1013 rules applied. Total rules applied 1061 place count 440 transition count 2067
Applied a total of 1061 rules in 205 ms. Remains 440 /463 variables (removed 23) and now considering 2067/3495 (removed 1428) transitions.
[2026-05-24 18:52:08] [INFO ] Flow matrix only has 241 transitions (discarded 1826 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1331979179057551118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16188370114867077264.kers'
[2026-05-24 18:52:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1331979179057551118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16188370114867077264.kers]
Normalized transition count is 240 out of 241 initially.
Culling duplicate invariants (modulo rational): removing 294 columns.
Culled 294 columns in 0 ms.
// Phase 1: matrix 240 rows 146 cols 497 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 18:52:09] [INFO ] Computed 312 invariants in 1 ms
Computed 312 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16188370114867077264.kers
Total runtime 2 ms.
[2026-05-24 18:52:10] [INFO ] Implicit Places using invariants in 1512 ms returned [146, 148, 149, 151, 152, 153, 154, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 175, 176, 178, 179, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 216, 217, 219, 220, 221, 222, 223, 224, 225, 226, 229, 230, 232, 233, 234, 235, 236, 237, 238, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 258, 259, 261, 263, 264, 265, 266, 267, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 289, 290, 291, 292, 293, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 317, 318, 319, 320, 321, 322, 323, 324, 326, 327, 329, 330, 331, 332, 333, 334, 335, 337, 338, 339, 340, 341, 342, 343, 344, 345, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 388, 389, 390, 392, 393, 394, 395, 396, 398, 399, 400, 402, 403, 404, 406, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 420, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 434, 435, 437, 439]
Discarding 261 places :
Ensure Unique test removed 1535 transitions
Reduce isomorphic transitions removed 1535 transitions.
Implicit Place search using SMT only with invariants took 1548 ms to find 261 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 179/463 places, 532/3495 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 215 transitions
Redundant transition composition rules discarded 215 transitions
Iterating global reduction 0 with 215 rules applied. Total rules applied 215 place count 179 transition count 317
Applied a total of 215 rules in 7 ms. Remains 179 /179 variables (removed 0) and now considering 317/532 (removed 215) transitions.
[2026-05-24 18:52:10] [INFO ] Flow matrix only has 241 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8091344367094468499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13093337729453236043.kers'
[2026-05-24 18:52:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8091344367094468499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13093337729453236043.kers]
Normalized transition count is 240 out of 241 initially.
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 0 ms.
// Phase 1: matrix 240 rows 146 cols 497 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 18:52:10] [INFO ] Computed 51 invariants in 0 ms
Computed 51 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13093337729453236043.kers
Total runtime 1 ms.
[2026-05-24 18:52:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 18:52:10] [INFO ] Flow matrix only has 241 transitions (discarded 76 similar events)
[2026-05-24 18:52:10] [INFO ] Invariant cache hit.
[2026-05-24 18:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:52:10] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 179/463 places, 317/3495 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1925 ms. Remains : 179/463 places, 317/3495 transitions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Applied a total of 0 rules in 1 ms. Remains 179 /179 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2026-05-24 18:52:10] [INFO ] Flow matrix only has 241 transitions (discarded 76 similar events)
[2026-05-24 18:52:10] [INFO ] Invariant cache hit.
[2026-05-24 18:52:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 18:52:10] [INFO ] Flow matrix only has 241 transitions (discarded 76 similar events)
[2026-05-24 18:52:10] [INFO ] Invariant cache hit.
[2026-05-24 18:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:52:10] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-24 18:52:10] [INFO ] Flow matrix only has 241 transitions (discarded 76 similar events)
[2026-05-24 18:52:10] [INFO ] Invariant cache hit.
[2026-05-24 18:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 33/179 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 240/419 variables, 179/230 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/420 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 231 constraints, problems are : Problem set: 0 solved, 316 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 179/179 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 33/179 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (OVERLAPS) 240/419 variables, 179/230 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 316/546 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (OVERLAPS) 1/420 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 10 (OVERLAPS) 0/420 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 547 constraints, problems are : Problem set: 0 solved, 316 unsolved in 20217 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, State Equation: 179/179 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40379ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 40397ms
Finished structural reductions in LTL mode , in 1 iterations and 40548 ms. Remains : 179/179 places, 317/317 transitions.
Support contains 66 out of 179 places after structural reductions.
[2026-05-24 18:52:53] [INFO ] Flatten gal took : 37 ms
[2026-05-24 18:52:53] [INFO ] Flatten gal took : 15 ms
[2026-05-24 18:52:53] [INFO ] Input system was already deterministic with 317 transitions.
RANDOM walk for 5718 steps (0 resets) in 222 ms. (25 steps per ms) remains 0/35 properties
Computed a total of 34 stabilizing places and 1 stable transitions
Graph (complete) has 367 edges and 179 vertex of which 146 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.9 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)||G(p1)))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Graph (trivial) has 303 edges and 179 vertex of which 137 / 179 are part of one of the 17 SCC in 1 ms
Free SCC test removed 120 places
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 86 edges and 59 vertex of which 28 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 35
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 12 transition count 19
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 12 transition count 19
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 2 with 2 rules applied. Total rules applied 36 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 38 place count 11 transition count 16
Applied a total of 38 rules in 12 ms. Remains 11 /179 variables (removed 168) and now considering 16/317 (removed 301) transitions.
[2026-05-24 18:52:53] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5210020378965319793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15363820021674519746.kers'
[2026-05-24 18:52:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5210020378965319793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15363820021674519746.kers]
Normalized transition count is 9 out of 10 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 20 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 18:52:53] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15363820021674519746.kers
Total runtime 0 ms.
[2026-05-24 18:52:53] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 18:52:53] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2026-05-24 18:52:53] [INFO ] Invariant cache hit.
[2026-05-24 18:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:52:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2026-05-24 18:52:53] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2026-05-24 18:52:53] [INFO ] Flow matrix only has 10 transitions (discarded 6 similar events)
[2026-05-24 18:52:53] [INFO ] Invariant cache hit.
[2026-05-24 18:52:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 15 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/20 variables, 11/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 1/21 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/179 places, 16/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 514 ms. Remains : 11/179 places, 16/317 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)||G(p1)))'
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-13a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-00 finished in 861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Graph (trivial) has 304 edges and 179 vertex of which 138 / 179 are part of one of the 18 SCC in 0 ms
Free SCC test removed 120 places
Ensure Unique test removed 280 transitions
Reduce isomorphic transitions removed 280 transitions.
Graph (complete) has 87 edges and 59 vertex of which 28 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 36
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 12 transition count 21
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 12 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 11 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 11 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 11 transition count 17
Applied a total of 40 rules in 9 ms. Remains 11 /179 variables (removed 168) and now considering 17/317 (removed 300) transitions.
[2026-05-24 18:52:54] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15859847613670466399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-423766199547049500.kers'
[2026-05-24 18:52:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15859847613670466399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-423766199547049500.kers]
Normalized transition count is 10 out of 11 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 21 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 18:52:54] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-423766199547049500.kers
Total runtime 0 ms.
[2026-05-24 18:52:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 18:52:54] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 18:52:54] [INFO ] Invariant cache hit.
[2026-05-24 18:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:52:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 18:52:54] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 18:52:54] [INFO ] Flow matrix only has 11 transitions (discarded 6 similar events)
[2026-05-24 18:52:54] [INFO ] Invariant cache hit.
[2026-05-24 18:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 16 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/22 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 33 constraints, problems are : Problem set: 0 solved, 16 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 362ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/179 places, 17/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 11/179 places, 17/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-01 finished in 490 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((F(G(!p0))&&F(!p1)))||(!p1&&F(G(!p0)))))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 148 transition count 317
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 136 transition count 293
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 136 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 136 transition count 291
Applied a total of 57 rules in 13 ms. Remains 136 /179 variables (removed 43) and now considering 291/317 (removed 26) transitions.
[2026-05-24 18:52:55] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3553346698605562740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5959170046935418823.kers'
[2026-05-24 18:52:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3553346698605562740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5959170046935418823.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:52:55] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5959170046935418823.kers
Total runtime 1 ms.
[2026-05-24 18:52:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-24 18:52:55] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:52:55] [INFO ] Invariant cache hit.
[2026-05-24 18:52:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:52:55] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:52:55] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:52:55] [INFO ] Invariant cache hit.
[2026-05-24 18:52:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/362 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 157 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15496 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/362 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 290/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/363 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 447 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14624 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 136/136 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30144ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 30145ms
Starting structural reductions in LTL mode, iteration 1 : 136/179 places, 291/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30291 ms. Remains : 136/179 places, 291/317 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((F(G(p0))&&F(p1)))||(F(G(p0))&&p1)))))'
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-02 finished in 30472 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(p0)))&&((p1||G(p2)) U (G(!p2)||(!p2&&F(!p3))))))'
Support contains 8 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 150 transition count 317
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 139 transition count 295
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 139 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 139 transition count 293
Applied a total of 53 rules in 5 ms. Remains 139 /179 variables (removed 40) and now considering 293/317 (removed 24) transitions.
[2026-05-24 18:53:25] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7032455946845974316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4450577421332403861.kers'
[2026-05-24 18:53:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7032455946845974316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4450577421332403861.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 227 rows 135 cols 471 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 18:53:25] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4450577421332403861.kers
Total runtime 1 ms.
[2026-05-24 18:53:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 18:53:25] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:53:25] [INFO ] Invariant cache hit.
[2026-05-24 18:53:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:53:25] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-24 18:53:25] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:53:25] [INFO ] Invariant cache hit.
[2026-05-24 18:53:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 4/139 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/366 variables, 139/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/367 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 162 constraints, problems are : Problem set: 0 solved, 292 unsolved in 15738 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 139/139 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 4/139 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/366 variables, 139/161 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 292/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/367 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 454 constraints, problems are : Problem set: 0 solved, 292 unsolved in 14348 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 139/139 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30124ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Starting structural reductions in LTL mode, iteration 1 : 139/179 places, 293/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30233 ms. Remains : 139/179 places, 293/317 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(p0)))&&((p1||G(p2)) U (G(!p2)||(!p2&&F(!p3))))))'
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p0) p2), (NOT p0), (NOT p2), p2, (AND p3 p2), (AND p2 p3), (NOT p0), true, p3, (AND (NOT p2) p3)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-03
Stuttering criterion allowed to conclude after 41 steps with 13 reset in 1 ms.
FORMULA DLCround-PT-13a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-03 finished in 30638 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(p1)&&p0)))&&(p2 U !p3)))'
Support contains 10 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 151 transition count 317
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 140 transition count 295
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 140 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 140 transition count 293
Applied a total of 52 rules in 4 ms. Remains 140 /179 variables (removed 39) and now considering 293/317 (removed 24) transitions.
[2026-05-24 18:53:56] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6758661132712142389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13564886196625854375.kers'
[2026-05-24 18:53:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6758661132712142389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13564886196625854375.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 227 rows 135 cols 471 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 18:53:56] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13564886196625854375.kers
Total runtime 1 ms.
[2026-05-24 18:53:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 18:53:56] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:53:56] [INFO ] Invariant cache hit.
[2026-05-24 18:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:53:56] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-24 18:53:56] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:53:56] [INFO ] Invariant cache hit.
[2026-05-24 18:53:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 5/140 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/367 variables, 140/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/368 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 164 constraints, problems are : Problem set: 0 solved, 292 unsolved in 16076 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 5/140 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/367 variables, 140/163 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 292/455 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/368 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/368 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 456 constraints, problems are : Problem set: 0 solved, 292 unsolved in 14939 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 140/140 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31049ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 31049ms
Starting structural reductions in LTL mode, iteration 1 : 140/179 places, 293/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31191 ms. Remains : 140/179 places, 293/317 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(p1)&&p0)))&&(p2 U !p3)))'
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0) p3), true, (OR (NOT p0) (NOT p1)), p3, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-04 finished in 31421 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((X(X(X(X(F(p0))))) U (p1||X(p2)))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 148 transition count 317
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 42 place count 137 transition count 295
Iterating global reduction 1 with 11 rules applied. Total rules applied 53 place count 137 transition count 295
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 137 transition count 293
Applied a total of 55 rules in 10 ms. Remains 137 /179 variables (removed 42) and now considering 293/317 (removed 24) transitions.
[2026-05-24 18:54:27] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4114166656474153264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9663364145486281856.kers'
[2026-05-24 18:54:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4114166656474153264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9663364145486281856.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 227 rows 135 cols 471 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 18:54:27] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9663364145486281856.kers
Total runtime 1 ms.
[2026-05-24 18:54:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 18:54:27] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:54:27] [INFO ] Invariant cache hit.
[2026-05-24 18:54:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:54:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 292 sub problems to find dead transitions.
[2026-05-24 18:54:27] [INFO ] Flow matrix only has 228 transitions (discarded 65 similar events)
[2026-05-24 18:54:27] [INFO ] Invariant cache hit.
[2026-05-24 18:54:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/364 variables, 137/157 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 292 unsolved in 15892 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (OVERLAPS) 2/137 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 227/364 variables, 137/157 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 292/449 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 450 constraints, problems are : Problem set: 0 solved, 292 unsolved in 14432 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30336ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 30338ms
Starting structural reductions in LTL mode, iteration 1 : 137/179 places, 293/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30465 ms. Remains : 137/179 places, 293/317 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(X(X(X(F(p0))))) U (p1||X(p2)))))'
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-05 finished in 30704 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 X(p1))))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 149 transition count 317
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 137 transition count 293
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 137 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 137 transition count 292
Applied a total of 55 rules in 3 ms. Remains 137 /179 variables (removed 42) and now considering 292/317 (removed 25) transitions.
[2026-05-24 18:54:58] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-644239414386862900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10908834790967402608.kers'
[2026-05-24 18:54:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-644239414386862900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10908834790967402608.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 227 rows 134 cols 471 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:54:58] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10908834790967402608.kers
Total runtime 1 ms.
[2026-05-24 18:54:58] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 18:54:58] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
[2026-05-24 18:54:58] [INFO ] Invariant cache hit.
[2026-05-24 18:54:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:54:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2026-05-24 18:54:58] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
[2026-05-24 18:54:58] [INFO ] Invariant cache hit.
[2026-05-24 18:54:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 227/364 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 159 constraints, problems are : Problem set: 0 solved, 291 unsolved in 16004 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 227/364 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 291/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 450 constraints, problems are : Problem set: 0 solved, 291 unsolved in 14356 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30375ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 30376ms
Starting structural reductions in LTL mode, iteration 1 : 137/179 places, 292/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30491 ms. Remains : 137/179 places, 292/317 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 X(p1))))'
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-06 finished in 30730 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 1 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Graph (trivial) has 306 edges and 179 vertex of which 138 / 179 are part of one of the 18 SCC in 2 ms
Free SCC test removed 120 places
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 86 edges and 59 vertex of which 26 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 8 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 7 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 6 transition count 16
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 6 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 6 transition count 10
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 5 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 4 transition count 8
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 4 transition count 8
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 4 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 54 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 55 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 56 place count 2 transition count 3
Applied a total of 56 rules in 12 ms. Remains 2 /179 variables (removed 177) and now considering 3/317 (removed 314) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4075219952371515680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17605029723436691933.kers'
[2026-05-24 18:55:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4075219952371515680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17605029723436691933.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-24 18:55:29] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17605029723436691933.kers
Total runtime 0 ms.
[2026-05-24 18:55:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 18:55:29] [INFO ] Invariant cache hit.
[2026-05-24 18:55:29] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2026-05-24 18:55:29] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-24 18:55:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 38ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/179 places, 3/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 2/179 places, 3/317 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 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-07 finished in 181 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(X(!p0)) U !(G(X(G(p1))) U p2)))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 149 transition count 317
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 137 transition count 293
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 137 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 137 transition count 292
Applied a total of 55 rules in 10 ms. Remains 137 /179 variables (removed 42) and now considering 292/317 (removed 25) transitions.
[2026-05-24 18:55:29] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17730853316113128739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7800373702623277994.kers'
[2026-05-24 18:55:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17730853316113128739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7800373702623277994.kers]
Normalized transition count is 227 out of 228 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 227 rows 134 cols 471 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:55:29] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7800373702623277994.kers
Total runtime 1 ms.
[2026-05-24 18:55:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 18:55:29] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
[2026-05-24 18:55:29] [INFO ] Invariant cache hit.
[2026-05-24 18:55:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:55:29] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2026-05-24 18:55:29] [INFO ] Flow matrix only has 228 transitions (discarded 64 similar events)
[2026-05-24 18:55:29] [INFO ] Invariant cache hit.
[2026-05-24 18:55:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 227/364 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 1/365 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 159 constraints, problems are : Problem set: 0 solved, 291 unsolved in 15711 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 227/364 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 291/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 450 constraints, problems are : Problem set: 0 solved, 291 unsolved in 14755 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30479ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 30480ms
Starting structural reductions in LTL mode, iteration 1 : 137/179 places, 292/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30594 ms. Remains : 137/179 places, 292/317 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(X(!p0)) U !(G(X(G(p1))) U p2)))'
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-08 finished in 30917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1)))||(p2&&(G(p2) U p3)))))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Graph (trivial) has 303 edges and 179 vertex of which 135 / 179 are part of one of the 17 SCC in 3 ms
Free SCC test removed 118 places
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Graph (complete) has 86 edges and 61 vertex of which 30 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 30 transition count 33
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 27 transition count 32
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 22 place count 14 transition count 19
Iterating global reduction 2 with 13 rules applied. Total rules applied 35 place count 14 transition count 19
Applied a total of 35 rules in 6 ms. Remains 14 /179 variables (removed 165) and now considering 19/317 (removed 298) transitions.
[2026-05-24 18:56:00] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3982362233919108558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10938150947041009516.kers'
[2026-05-24 18:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3982362233919108558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10938150947041009516.kers]
Normalized transition count is 12 out of 13 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 12 rows 11 cols 27 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 18:56:00] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10938150947041009516.kers
Total runtime 0 ms.
[2026-05-24 18:56:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 18:56:00] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
[2026-05-24 18:56:00] [INFO ] Invariant cache hit.
[2026-05-24 18:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:56:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-24 18:56:00] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2026-05-24 18:56:00] [INFO ] Flow matrix only has 13 transitions (discarded 6 similar events)
[2026-05-24 18:56:00] [INFO ] Invariant cache hit.
[2026-05-24 18:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 12/26 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 18 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 12/26 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/27 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/27 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 40 constraints, problems are : Problem set: 0 solved, 18 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 429ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/179 places, 19/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 481 ms. Remains : 14/179 places, 19/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1)))||(p2&&(G(p2) U p3)))))'
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-12
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-13a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-12 finished in 767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1) U (G(p0)&&p2)))))'
Support contains 2 out of 179 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Graph (trivial) has 296 edges and 179 vertex of which 131 / 179 are part of one of the 18 SCC in 0 ms
Free SCC test removed 113 places
Ensure Unique test removed 264 transitions
Reduce isomorphic transitions removed 264 transitions.
Graph (complete) has 103 edges and 66 vertex of which 36 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 34 transition count 51
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 21 place count 19 transition count 36
Iterating global reduction 2 with 15 rules applied. Total rules applied 36 place count 19 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 19 transition count 33
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 19 transition count 33
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 17 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 17 transition count 31
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 17 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 17 transition count 28
Applied a total of 48 rules in 7 ms. Remains 17 /179 variables (removed 162) and now considering 28/317 (removed 289) transitions.
[2026-05-24 18:56:00] [INFO ] Flow matrix only has 18 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3403954448287760850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6048806649785469416.kers'
[2026-05-24 18:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3403954448287760850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6048806649785469416.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 17 rows 13 cols 35 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 18:56:00] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6048806649785469416.kers
Total runtime 0 ms.
[2026-05-24 18:56:00] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 18:56:00] [INFO ] Flow matrix only has 18 transitions (discarded 10 similar events)
[2026-05-24 18:56:00] [INFO ] Invariant cache hit.
[2026-05-24 18:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:56:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2026-05-24 18:56:00] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-24 18:56:00] [INFO ] Flow matrix only has 18 transitions (discarded 10 similar events)
[2026-05-24 18:56:00] [INFO ] Invariant cache hit.
[2026-05-24 18:56:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 17/34 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 24 constraints, problems are : Problem set: 0 solved, 27 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 17/34 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 27/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/35 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/35 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 51 constraints, problems are : Problem set: 0 solved, 27 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 652ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/179 places, 28/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 17/179 places, 28/317 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1) U (G(p0)&&p2)))))'
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-13 finished in 777 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((G(p1)||p0))))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Graph (trivial) has 306 edges and 179 vertex of which 139 / 179 are part of one of the 19 SCC in 1 ms
Free SCC test removed 120 places
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 282 transitions.
Graph (complete) has 85 edges and 59 vertex of which 29 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 29 transition count 34
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 1 with 3 rules applied. Total rules applied 6 place count 28 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 27 transition count 32
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 21 place count 13 transition count 18
Iterating global reduction 3 with 14 rules applied. Total rules applied 35 place count 13 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 13 transition count 17
Applied a total of 36 rules in 6 ms. Remains 13 /179 variables (removed 166) and now considering 17/317 (removed 300) transitions.
[2026-05-24 18:56:01] [INFO ] Flow matrix only has 10 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13631534479389060967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13055154179568239369.kers'
[2026-05-24 18:56:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13631534479389060967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13055154179568239369.kers]
Normalized transition count is 9 out of 10 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 9 rows 9 cols 20 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 18:56:01] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13055154179568239369.kers
Total runtime 0 ms.
[2026-05-24 18:56:01] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 18:56:01] [INFO ] Flow matrix only has 10 transitions (discarded 7 similar events)
[2026-05-24 18:56:01] [INFO ] Invariant cache hit.
[2026-05-24 18:56:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:56:01] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-24 18:56:01] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 18:56:01] [INFO ] Flow matrix only has 10 transitions (discarded 7 similar events)
[2026-05-24 18:56:01] [INFO ] Invariant cache hit.
[2026-05-24 18:56:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 21 constraints, problems are : Problem set: 0 solved, 16 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/10 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 16/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 1/23 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/23 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 350ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/179 places, 17/317 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 13/179 places, 17/317 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((G(p1)||p0))))'
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-14
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLFireability-14 finished in 518 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))||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 317/317 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 149 transition count 317
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 42 place count 137 transition count 293
Iterating global reduction 1 with 12 rules applied. Total rules applied 54 place count 137 transition count 293
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 137 transition count 291
Applied a total of 56 rules in 4 ms. Remains 137 /179 variables (removed 42) and now considering 291/317 (removed 26) transitions.
[2026-05-24 18:56:02] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13495747425134329527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11729468804348822288.kers'
[2026-05-24 18:56:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13495747425134329527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11729468804348822288.kers]
Normalized transition count is 226 out of 227 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 226 rows 134 cols 469 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 18:56:02] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11729468804348822288.kers
Total runtime 1 ms.
[2026-05-24 18:56:02] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 18:56:02] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:56:02] [INFO ] Invariant cache hit.
[2026-05-24 18:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-24 18:56:02] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-24 18:56:02] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2026-05-24 18:56:02] [INFO ] Invariant cache hit.
[2026-05-24 18:56:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/363 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/364 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 159 constraints, problems are : Problem set: 0 solved, 290 unsolved in 15425 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 3/137 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/363 variables, 137/158 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 290/448 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/364 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 449 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14244 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 137/137 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29682ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 29682ms
Starting structural reductions in LTL mode, iteration 1 : 137/179 places, 291/317 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29791 ms. Remains : 137/179 places, 291/317 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))||(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Stuttering acceptance computed with spot in 303 ms :[true, (AND p1 (NOT p0)), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND p1 (NOT p0)), p1, (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 259 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 311 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 11 ms. Proved property starting from automaton with 9 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA DLCround-PT-13a-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-13a-LTLFireability-15 finished in 30609 ms.
All properties solved by simple procedures.
Total runtime 264515 ms.

BK_STOP 1779648992791

--------------------
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="DLCround-PT-13a"
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 DLCround-PT-13a, 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 r098-tall-177955695700668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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