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.r130-smll-177955809000276.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 FireWire-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 05:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Mar 7 05:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 05:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 05:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 153K 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 FireWire-PT-17-LTLFireability-00
FORMULA_NAME FireWire-PT-17-LTLFireability-01
FORMULA_NAME FireWire-PT-17-LTLFireability-02
FORMULA_NAME FireWire-PT-17-LTLFireability-03
FORMULA_NAME FireWire-PT-17-LTLFireability-04
FORMULA_NAME FireWire-PT-17-LTLFireability-05
FORMULA_NAME FireWire-PT-17-LTLFireability-06
FORMULA_NAME FireWire-PT-17-LTLFireability-07
FORMULA_NAME FireWire-PT-17-LTLFireability-08
FORMULA_NAME FireWire-PT-17-LTLFireability-09
FORMULA_NAME FireWire-PT-17-LTLFireability-10
FORMULA_NAME FireWire-PT-17-LTLFireability-11
FORMULA_NAME FireWire-PT-17-LTLFireability-12
FORMULA_NAME FireWire-PT-17-LTLFireability-13
FORMULA_NAME FireWire-PT-17-LTLFireability-14
FORMULA_NAME FireWire-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779838068189

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 23:27:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 23:27:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 23:27:51] [INFO ] Load time of PNML (sax parser for PT used): 263 ms
[2026-05-26 23:27:51] [INFO ] Transformed 428 places.
[2026-05-26 23:27:51] [INFO ] Transformed 656 transitions.
[2026-05-26 23:27:51] [INFO ] Found NUPN structural information;
[2026-05-26 23:27:51] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FireWire-PT-17-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 422 transition count 656
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 91 place count 337 transition count 571
Iterating global reduction 1 with 85 rules applied. Total rules applied 176 place count 337 transition count 571
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 199 place count 314 transition count 540
Iterating global reduction 1 with 23 rules applied. Total rules applied 222 place count 314 transition count 540
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 225 place count 314 transition count 537
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 227 place count 312 transition count 535
Iterating global reduction 2 with 2 rules applied. Total rules applied 229 place count 312 transition count 535
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 311 transition count 534
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 311 transition count 534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 310 transition count 533
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 310 transition count 533
Applied a total of 233 rules in 225 ms. Remains 310 /428 variables (removed 118) and now considering 533/656 (removed 123) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5595868078867870802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8504870412034049602.kers'
[2026-05-26 23:27:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5595868078867870802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8504870412034049602.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 533 rows 310 cols 1623 entries
Finished phase 1 with 303 SingleSign rule and 0 generalized
[2026-05-26 23:27:52] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8504870412034049602.kers
Total runtime 7 ms.
[2026-05-26 23:27:52] [INFO ] Implicit Places using invariants in 771 ms returned []
[2026-05-26 23:27:52] [INFO ] Invariant cache hit.
[2026-05-26 23:27:53] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
Running 532 sub problems to find dead transitions.
[2026-05-26 23:27:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/843 variables, and 17 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 532 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (OVERLAPS) 1/310 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/310 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 5 (OVERLAPS) 533/843 variables, 310/328 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 532/860 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/843 variables, and 860 constraints, problems are : Problem set: 0 solved, 532 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60617ms problems are : Problem set: 0 solved, 532 unsolved
Search for dead transitions found 0 dead transitions in 60657ms
Starting structural reductions in LTL mode, iteration 1 : 310/428 places, 533/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62796 ms. Remains : 310/428 places, 533/656 transitions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Applied a total of 0 rules in 8 ms. Remains 310 /310 variables (removed 0) and now considering 533/533 (removed 0) transitions.
[2026-05-26 23:28:54] [INFO ] Invariant cache hit.
[2026-05-26 23:28:54] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-26 23:28:54] [INFO ] Invariant cache hit.
[2026-05-26 23:28:55] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 310/310 places, 533/533 transitions.
Support contains 31 out of 310 places after structural reductions.
[2026-05-26 23:28:55] [INFO ] Flatten gal took : 141 ms
[2026-05-26 23:28:55] [INFO ] Flatten gal took : 75 ms
[2026-05-26 23:28:56] [INFO ] Input system was already deterministic with 533 transitions.
RANDOM walk for 40000 steps (9 resets) in 2727 ms. (14 steps per ms) remains 16/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
[2026-05-26 23:28:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 222/244 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/269 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 491/760 variables, 269/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 19/779 variables, 9/288 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 21/800 variables, 10/298 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (OVERLAPS) 14/814 variables, 7/305 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 814/843 variables, and 305 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/310 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 222/244 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 25/269 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 491/760 variables, 269/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 16/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 19/779 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/779 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 21/800 variables, 10/314 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 800/843 variables, and 314 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 288/310 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10034ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 533/533 transitions.
Graph (trivial) has 222 edges and 310 vertex of which 11 / 310 are part of one of the 2 SCC in 15 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 301 transition count 465
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 113 place count 246 transition count 463
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 245 transition count 461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 243 transition count 461
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 118 place count 243 transition count 433
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 174 place count 215 transition count 433
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 177 place count 212 transition count 430
Iterating global reduction 4 with 3 rules applied. Total rules applied 180 place count 212 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 212 transition count 429
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 181 place count 212 transition count 427
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 185 place count 210 transition count 427
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 239 place count 183 transition count 400
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -132
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 297 place count 154 transition count 532
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 302 place count 154 transition count 527
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 321 place count 154 transition count 508
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 345 place count 135 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 393 place count 135 transition count 455
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 397 place count 135 transition count 455
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 398 place count 135 transition count 455
Applied a total of 398 rules in 323 ms. Remains 135 /310 variables (removed 175) and now considering 455/533 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 135/310 places, 455/533 transitions.
RANDOM walk for 40000 steps (8 resets) in 1292 ms. (30 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4000 steps (17 resets) in 88 ms. (44 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4000 steps (15 resets) in 68 ms. (57 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4001 steps (12 resets) in 75 ms. (52 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (11 resets) in 64 ms. (61 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (12 resets) in 70 ms. (56 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4001 steps (14 resets) in 61 ms. (64 steps per ms) remains 9/13 properties
BEST_FIRST walk for 4001 steps (15 resets) in 48 ms. (81 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000 steps (21 resets) in 45 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (10 resets) in 56 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4001 steps (19 resets) in 47 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000 steps (16 resets) in 58 ms. (67 steps per ms) remains 8/8 properties
[2026-05-26 23:29:08] [INFO ] Flow matrix only has 438 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15258183596566534463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1996410912713672408.kers'
[2026-05-26 23:29:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15258183596566534463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1996410912713672408.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 438 rows 135 cols 1584 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-26 23:29:08] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1996410912713672408.kers
Total runtime 2 ms.
[2026-05-26 23:29:08] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 113/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/131 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 438/569 variables, 131/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 4/573 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/573 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 200 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 113/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 7/131 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 438/569 variables, 131/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/569 variables, 57/196 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/573 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/573 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 208 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3200ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 1832 ms.
Support contains 9 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 455/455 transitions.
Graph (trivial) has 29 edges and 135 vertex of which 2 / 135 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 place count 134 transition count 451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 132 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 129 transition count 448
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 125 transition count 473
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 125 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 45 place count 125 transition count 447
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 125 transition count 546
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 53 place count 124 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 4 with 50 rules applied. Total rules applied 103 place count 124 transition count 490
Applied a total of 103 rules in 76 ms. Remains 124 /135 variables (removed 11) and now considering 490/455 (removed -35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 124/135 places, 490/455 transitions.
RANDOM walk for 40000 steps (2329 resets) in 232 ms. (171 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (551 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (544 resets) in 120 ms. (330 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (582 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
[2026-05-26 23:29:13] [INFO ] Flow matrix only has 442 transitions (discarded 48 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7372987367928635272.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17481323083860743272.kers'
[2026-05-26 23:29:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7372987367928635272.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17481323083860743272.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 442 rows 124 cols 1618 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-26 23:29:13] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17481323083860743272.kers
Total runtime 4 ms.
[2026-05-26 23:29:13] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 442/562 variables, 120/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 68/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/566 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/566 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 199 constraints, problems are : Problem set: 0 solved, 4 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 102/109 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/120 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 442/562 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 68/196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/566 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 204 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1813ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 542 ms.
Support contains 7 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 490/490 transitions.
Graph (trivial) has 12 edges and 124 vertex of which 2 / 124 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 469
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 33 place count 122 transition count 439
Applied a total of 33 rules in 49 ms. Remains 122 /124 variables (removed 2) and now considering 439/490 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 122/124 places, 439/490 transitions.
RANDOM walk for 40000 steps (2376 resets) in 267 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (579 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (52 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (592 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (587 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 570994 steps, run timeout after 3001 ms. (steps per millisecond=190 ) properties seen :2 out of 4
Probabilistic random walk after 570994 steps, saw 158531 distinct states, run finished after 3009 ms. (steps per millisecond=189 ) properties seen :2
[2026-05-26 23:29:19] [INFO ] Flow matrix only has 389 transitions (discarded 50 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11912206545177245694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2514331408411906403.kers'
[2026-05-26 23:29:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11912206545177245694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2514331408411906403.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 389 rows 122 cols 1414 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 23:29:19] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2514331408411906403.kers
Total runtime 2 ms.
[2026-05-26 23:29:19] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/118 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/507 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 68/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/511 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/511 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 197 constraints, problems are : Problem set: 0 solved, 2 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 103/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/118 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/507 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 68/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/511 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/511 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 122/122 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 942ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 4 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 439/439 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 122 transition count 437
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 437
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 120 transition count 436
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 35 place count 119 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 119 transition count 402
Applied a total of 40 rules in 29 ms. Remains 119 /122 variables (removed 3) and now considering 402/439 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 119/122 places, 402/439 transitions.
RANDOM walk for 40000 steps (2359 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (599 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (597 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1021287 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :1 out of 2
Probabilistic random walk after 1021287 steps, saw 284727 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :1
[2026-05-26 23:29:23] [INFO ] Flow matrix only has 356 transitions (discarded 46 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10174076991224905228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-772855483160655489.kers'
[2026-05-26 23:29:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10174076991224905228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-772855483160655489.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 356 rows 119 cols 1288 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-26 23:29:23] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-772855483160655489.kers
Total runtime 3 ms.
[2026-05-26 23:29:23] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/115 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 356/471 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 68/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/475 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/475 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/115 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 356/471 variables, 115/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 68/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/475 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/475 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 554 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 402/402 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 119 transition count 401
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 118 transition count 401
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 118 transition count 399
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 116 transition count 399
Applied a total of 6 rules in 32 ms. Remains 116 /119 variables (removed 3) and now considering 399/402 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 116/119 places, 399/402 transitions.
RANDOM walk for 40000 steps (2370 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 27480 steps (401 resets) in 71 ms. (381 steps per ms) remains 0/1 properties
Computed a total of 50 stabilizing places and 54 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Graph (trivial) has 245 edges and 310 vertex of which 18 / 310 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 294 transition count 458
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 236 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 235 transition count 456
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 120 place count 235 transition count 427
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 178 place count 206 transition count 427
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 184 place count 200 transition count 402
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 200 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 200 transition count 401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 191 place count 200 transition count 399
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 195 place count 198 transition count 399
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 251 place count 170 transition count 371
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 252 place count 169 transition count 351
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 169 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 254 place count 169 transition count 350
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -105
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 322 place count 135 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 364 place count 135 transition count 413
Applied a total of 364 rules in 114 ms. Remains 135 /310 variables (removed 175) and now considering 413/533 (removed 120) transitions.
[2026-05-26 23:29:25] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13049910838110075979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11046324673450409491.kers'
[2026-05-26 23:29:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13049910838110075979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11046324673450409491.kers]
Normalized transition count is 393 out of 394 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 135 cols 1419 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-26 23:29:25] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11046324673450409491.kers
Total runtime 3 ms.
[2026-05-26 23:29:25] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-26 23:29:25] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2026-05-26 23:29:25] [INFO ] Invariant cache hit.
[2026-05-26 23:29:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 23:29:26] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2026-05-26 23:29:26] [INFO ] Redundant transitions in 61 ms returned []
Running 403 sub problems to find dead transitions.
[2026-05-26 23:29:26] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2026-05-26 23:29:26] [INFO ] Invariant cache hit.
[2026-05-26 23:29:26] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (OVERLAPS) 393/528 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 61/212 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/529 variables, and 212 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (OVERLAPS) 393/528 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 61/213 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 403/616 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/529 variables, and 616 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 135/135 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60381ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60384ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/310 places, 413/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61500 ms. Remains : 135/310 places, 413/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 332 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-03 finished in 61978 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||(p0 U G(p1))))))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Graph (trivial) has 243 edges and 310 vertex of which 18 / 310 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 294 transition count 458
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 236 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 235 transition count 456
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 120 place count 235 transition count 428
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 176 place count 207 transition count 428
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 183 place count 200 transition count 402
Iterating global reduction 3 with 7 rules applied. Total rules applied 190 place count 200 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 200 transition count 401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 191 place count 200 transition count 398
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 197 place count 197 transition count 398
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 249 place count 171 transition count 372
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 170 transition count 352
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 170 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 170 transition count 351
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 318 place count 137 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 5 with 42 rules applied. Total rules applied 360 place count 137 transition count 413
Applied a total of 360 rules in 103 ms. Remains 137 /310 variables (removed 173) and now considering 413/533 (removed 120) transitions.
[2026-05-26 23:30:27] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12810716509448717679.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2724435174588159993.kers'
[2026-05-26 23:30:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12810716509448717679.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2724435174588159993.kers]
Normalized transition count is 393 out of 394 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 393 rows 137 cols 1419 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-26 23:30:27] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-2724435174588159993.kers
Total runtime 9 ms.
[2026-05-26 23:30:27] [INFO ] Implicit Places using invariants in 262 ms returned []
[2026-05-26 23:30:27] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2026-05-26 23:30:27] [INFO ] Invariant cache hit.
[2026-05-26 23:30:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-26 23:30:28] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
[2026-05-26 23:30:28] [INFO ] Redundant transitions in 40 ms returned []
Running 403 sub problems to find dead transitions.
[2026-05-26 23:30:28] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2026-05-26 23:30:28] [INFO ] Invariant cache hit.
[2026-05-26 23:30:28] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (OVERLAPS) 393/530 variables, 137/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 61/210 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/531 variables, and 210 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 393/530 variables, 137/149 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/210 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 403/613 constraints. Problems are: Problem set: 0 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/531 variables, and 613 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 60319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/310 places, 413/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61328 ms. Remains : 137/310 places, 413/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U G(p1))||p0))))'
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-04 finished in 61501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 303 transition count 526
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 303 transition count 526
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 300 transition count 523
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 300 transition count 523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 299 transition count 522
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 298 transition count 521
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 298 transition count 521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 297 transition count 520
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 297 transition count 520
Applied a total of 26 rules in 30 ms. Remains 297 /310 variables (removed 13) and now considering 520/533 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10636050589826807106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4290606067342829046.kers'
[2026-05-26 23:31:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10636050589826807106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4290606067342829046.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 520 rows 297 cols 1596 entries
Finished phase 1 with 290 SingleSign rule and 0 generalized
[2026-05-26 23:31:28] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4290606067342829046.kers
Total runtime 5 ms.
[2026-05-26 23:31:29] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-26 23:31:29] [INFO ] Invariant cache hit.
[2026-05-26 23:31:29] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2026-05-26 23:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/817 variables, and 17 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/297 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 520/817 variables, 297/314 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/817 variables, 519/833 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/817 variables, and 835 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60190ms
Starting structural reductions in LTL mode, iteration 1 : 297/310 places, 520/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61412 ms. Remains : 297/310 places, 520/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 4 ms.
FORMULA FireWire-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-05 finished in 61623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(X(F(p1)) U G(p2))) U X(X(X(G(p3))))))'
Support contains 7 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 304 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 304 transition count 527
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 302 transition count 506
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 302 transition count 506
Applied a total of 16 rules in 16 ms. Remains 302 /310 variables (removed 8) and now considering 506/533 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2467706386722577111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17796804833209072495.kers'
[2026-05-26 23:32:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2467706386722577111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17796804833209072495.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 506 rows 302 cols 1529 entries
Finished phase 1 with 295 SingleSign rule and 0 generalized
[2026-05-26 23:32:30] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17796804833209072495.kers
Total runtime 5 ms.
[2026-05-26 23:32:30] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-26 23:32:30] [INFO ] Invariant cache hit.
[2026-05-26 23:32:31] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2026-05-26 23:32:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/302 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/808 variables, and 17 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/302 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/301 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (OVERLAPS) 1/302 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/302 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 4 (OVERLAPS) 506/808 variables, 302/319 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/808 variables, 505/824 constraints. Problems are: Problem set: 0 solved, 505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 808/808 variables, and 825 constraints, problems are : Problem set: 0 solved, 505 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 302/302 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 505 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 302/310 places, 506/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61241 ms. Remains : 302/310 places, 506/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&(X(F(p1)) U G(p2))) U X(X(X(G(p3))))))'
Stuttering acceptance computed with spot in 707 ms :[(NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3), true, (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-06 finished in 62054 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((X(p0)||G(p1))))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 302 transition count 525
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 302 transition count 525
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 299 transition count 522
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 298 transition count 521
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 298 transition count 521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 297 transition count 520
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 297 transition count 520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 296 transition count 519
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 296 transition count 519
Applied a total of 28 rules in 30 ms. Remains 296 /310 variables (removed 14) and now considering 519/533 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9767794636794099154.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5338886536380002819.kers'
[2026-05-26 23:33:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9767794636794099154.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5338886536380002819.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 519 rows 296 cols 1594 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-05-26 23:33:32] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5338886536380002819.kers
Total runtime 5 ms.
[2026-05-26 23:33:32] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-26 23:33:32] [INFO ] Invariant cache hit.
[2026-05-26 23:33:33] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2026-05-26 23:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/815 variables, and 15 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (OVERLAPS) 519/815 variables, 296/315 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 518/833 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 833 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 296/310 places, 519/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61259 ms. Remains : 296/310 places, 519/533 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((X(p0)||G(p1))))))'
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 449 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (11 resets) in 457 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 578509 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :2 out of 4
Probabilistic random walk after 578509 steps, saw 115524 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :2
[2026-05-26 23:34:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 483/745 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/763 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/783 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/795 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/809 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/815 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/815 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/815 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 483/745 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 18/763 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/783 variables, 10/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/795 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/809 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/809 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/815 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/815 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/815 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 305 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2378ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1650 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 519/519 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 281 transition count 448
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 54 rules applied. Total rules applied 105 place count 231 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 229 transition count 444
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 229 transition count 411
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 196 transition count 411
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 195 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 195 transition count 391
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 229 place count 168 transition count 364
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 291 place count 137 transition count 491
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 297 place count 137 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 353 place count 137 transition count 429
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 373 place count 137 transition count 409
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 399 place count 117 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 454 place count 117 transition count 348
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 456 place count 117 transition count 348
Applied a total of 456 rules in 63 ms. Remains 117 /296 variables (removed 179) and now considering 348/519 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 117/296 places, 348/519 transitions.
RANDOM walk for 40000 steps (2254 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (19 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 14709 steps, run visited all 2 properties in 128 ms. (steps per millisecond=114 )
Probabilistic random walk after 14709 steps, saw 5696 distinct states, run finished after 134 ms. (steps per millisecond=109 ) properties seen :2
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 8286 ms.
Stuttering acceptance computed with spot in 337 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 519/519 transitions.
Applied a total of 0 rules in 4 ms. Remains 296 /296 variables (removed 0) and now considering 519/519 (removed 0) transitions.
[2026-05-26 23:34:43] [INFO ] Invariant cache hit.
[2026-05-26 23:34:43] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-26 23:34:43] [INFO ] Invariant cache hit.
[2026-05-26 23:34:44] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1048 ms. Remains : 296/296 places, 519/519 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (10 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (16 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (9 resets) in 262 ms. (152 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 500999 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :2 out of 4
Probabilistic random walk after 500999 steps, saw 101463 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :2
[2026-05-26 23:34:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 483/745 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 18/763 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/763 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 20/783 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/795 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 14/809 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/809 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/815 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/815 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/815 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 815/815 variables, and 303 constraints, problems are : Problem set: 0 solved, 2 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 483/745 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 18/763 variables, 8/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/763 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 20/783 variables, 10/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 12/795 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/795 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 14/809 variables, 6/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/809 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/815 variables, 4/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/815 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/815 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 815/815 variables, and 305 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2165ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1771 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 519/519 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 281 transition count 448
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 54 rules applied. Total rules applied 105 place count 231 transition count 444
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 229 transition count 444
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 229 transition count 411
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 196 transition count 411
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 195 transition count 391
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 195 transition count 391
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 229 place count 168 transition count 364
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -127
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 291 place count 137 transition count 491
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 297 place count 137 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 4 with 56 rules applied. Total rules applied 353 place count 137 transition count 429
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 373 place count 137 transition count 409
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 399 place count 117 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 454 place count 117 transition count 348
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 456 place count 117 transition count 348
Applied a total of 456 rules in 45 ms. Remains 117 /296 variables (removed 179) and now considering 348/519 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 117/296 places, 348/519 transitions.
RANDOM walk for 40000 steps (2218 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (15 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (18 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 14709 steps, run visited all 2 properties in 114 ms. (steps per millisecond=129 )
Probabilistic random walk after 14709 steps, saw 5696 distinct states, run finished after 115 ms. (steps per millisecond=127 ) properties seen :2
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 8121 ms.
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 226 ms.
Product exploration explored 100000 steps with 1 reset in 253 ms.
Spot run failed in 156 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16175261809581368278
[2026-05-26 23:34:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16175261809581368278
Running compilation step : cd /tmp/ltsmin16175261809581368278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1672 ms.
Running link step : cd /tmp/ltsmin16175261809581368278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 125 ms.
Running LTSmin : cd /tmp/ltsmin16175261809581368278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased17991170628347357627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 519/519 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 519/519 (removed 0) transitions.
[2026-05-26 23:35:08] [INFO ] Invariant cache hit.
[2026-05-26 23:35:09] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-26 23:35:09] [INFO ] Invariant cache hit.
[2026-05-26 23:35:09] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 769 ms. Remains : 296/296 places, 519/519 transitions.
Built C files in :
/tmp/ltsmin590277283231657158
[2026-05-26 23:35:09] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin590277283231657158
Running compilation step : cd /tmp/ltsmin590277283231657158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1413 ms.
Running link step : cd /tmp/ltsmin590277283231657158;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin590277283231657158;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14675993222777257494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 23:35:24] [INFO ] Flatten gal took : 53 ms
[2026-05-26 23:35:24] [INFO ] Flatten gal took : 53 ms
[2026-05-26 23:35:24] [INFO ] Time to serialize gal into /tmp/LTL12683460003395161953.gal : 11 ms
[2026-05-26 23:35:24] [INFO ] Time to serialize properties into /tmp/LTL17143436470345884609.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12683460003395161953.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9670563925259323489.hoa' '-atoms' '/tmp/LTL17143436470345884609.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17143436470345884609.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9670563925259323489.hoa
Detected timeout of ITS tools.
[2026-05-26 23:35:40] [INFO ] Flatten gal took : 30 ms
[2026-05-26 23:35:40] [INFO ] Flatten gal took : 30 ms
[2026-05-26 23:35:40] [INFO ] Time to serialize gal into /tmp/LTL16682795954285397089.gal : 6 ms
[2026-05-26 23:35:40] [INFO ] Time to serialize properties into /tmp/LTL13761177459042158233.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16682795954285397089.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13761177459042158233.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X("((p70==1)&&(p350==1))"))||(G("((p62==0)||(p153==0))")))))))
Formula 0 simplified : XXX(X!"((p70==1)&&(p350==1))" & F!"((p62==0)||(p153==0))")
Detected timeout of ITS tools.
[2026-05-26 23:35:55] [INFO ] Flatten gal took : 29 ms
[2026-05-26 23:35:55] [INFO ] Applying decomposition
[2026-05-26 23:35:55] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11223173045760135795.txt' '-o' '/tmp/graph11223173045760135795.bin' '-w' '/tmp/graph11223173045760135795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11223173045760135795.bin' '-l' '-1' '-v' '-w' '/tmp/graph11223173045760135795.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:35:55] [INFO ] Decomposing Gal with order
[2026-05-26 23:35:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:35:55] [INFO ] Removed a total of 564 redundant transitions.
[2026-05-26 23:35:55] [INFO ] Flatten gal took : 280 ms
[2026-05-26 23:35:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 28 ms.
[2026-05-26 23:35:56] [INFO ] Time to serialize gal into /tmp/LTL3296685997135266900.gal : 14 ms
[2026-05-26 23:35:56] [INFO ] Time to serialize properties into /tmp/LTL5875462299590786198.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3296685997135266900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5875462299590786198.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X((X("((i1.u16.p70==1)&&(i1.u91.p350==1))"))||(G("((i7.u2.p62==0)||(i5.u39.p153==0))")))))))
Formula 0 simplified : XXX(X!"((i1.u16.p70==1)&&(i1.u91.p350==1))" & F!"((i7.u2.p62==0)||(i5.u39.p153==0))")
Detected timeout of ITS tools.
Treatment of property FireWire-PT-17-LTLFireability-07 finished in 158644 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 310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Graph (trivial) has 245 edges and 310 vertex of which 18 / 310 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 294 transition count 458
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 236 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 235 transition count 456
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 120 place count 235 transition count 427
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 178 place count 206 transition count 427
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 184 place count 200 transition count 402
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 200 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 191 place count 200 transition count 401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 191 place count 200 transition count 398
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 197 place count 197 transition count 398
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 251 place count 170 transition count 371
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -136
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 317 place count 137 transition count 507
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 359 place count 137 transition count 465
Applied a total of 359 rules in 45 ms. Remains 137 /310 variables (removed 173) and now considering 465/533 (removed 68) transitions.
[2026-05-26 23:36:11] [INFO ] Flow matrix only has 441 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-987898999940151070.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18032317505816643585.kers'
[2026-05-26 23:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-987898999940151070.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18032317505816643585.kers]
Normalized transition count is 440 out of 441 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 440 rows 137 cols 1605 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-26 23:36:11] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18032317505816643585.kers
Total runtime 3 ms.
[2026-05-26 23:36:11] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-26 23:36:11] [INFO ] Flow matrix only has 441 transitions (discarded 24 similar events)
[2026-05-26 23:36:11] [INFO ] Invariant cache hit.
[2026-05-26 23:36:11] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-26 23:36:11] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2026-05-26 23:36:11] [INFO ] Redundant transitions in 25 ms returned []
Running 455 sub problems to find dead transitions.
[2026-05-26 23:36:11] [INFO ] Flow matrix only has 441 transitions (discarded 24 similar events)
[2026-05-26 23:36:11] [INFO ] Invariant cache hit.
[2026-05-26 23:36:11] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (OVERLAPS) 440/577 variables, 137/149 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 62/211 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (OVERLAPS) 0/577 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 455 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 211 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 455 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 6 (OVERLAPS) 440/577 variables, 137/149 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 62/211 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 455/666 constraints. Problems are: Problem set: 0 solved, 455 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 666 constraints, problems are : Problem set: 0 solved, 455 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 455/455 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60255ms problems are : Problem set: 0 solved, 455 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/310 places, 465/533 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60933 ms. Remains : 137/310 places, 465/533 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 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-08 finished in 61041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U (!F(X(p0))&&X(F(p1))))||G(p2)))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 302 transition count 525
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 302 transition count 525
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 300 transition count 523
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 300 transition count 523
Applied a total of 20 rules in 10 ms. Remains 300 /310 variables (removed 10) and now considering 523/533 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2751637729220323255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7879565512609864576.kers'
[2026-05-26 23:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2751637729220323255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7879565512609864576.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 523 rows 300 cols 1602 entries
Finished phase 1 with 293 SingleSign rule and 0 generalized
[2026-05-26 23:37:12] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7879565512609864576.kers
Total runtime 3 ms.
[2026-05-26 23:37:12] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-26 23:37:12] [INFO ] Invariant cache hit.
[2026-05-26 23:37:12] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2026-05-26 23:37:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 523/823 variables, 300/315 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 823/823 variables, and 315 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 523/823 variables, 300/315 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 522/837 constraints. Problems are: Problem set: 0 solved, 522 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 840 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 300/310 places, 523/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 300/310 places, 523/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U (!F(X(p0))&&X(F(p1))))||G(p2)))'
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-09
Product exploration explored 100000 steps with 1 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Computed a total of 46 stabilizing places and 50 stable transitions
Computed a total of 46 stabilizing places and 50 stable transitions
Detected a total of 46/300 stabilizing places and 50/523 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 26 factoid took 114 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (9 resets) in 248 ms. (160 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 493486 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :0 out of 4
Probabilistic random walk after 493486 steps, saw 100585 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
[2026-05-26 23:38:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 483/745 variables, 262/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 19/764 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 22/786 variables, 11/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/786 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 14/800 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 16/816 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/816 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 7/823 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/823 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/823 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 308 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1922 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 483/745 variables, 262/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 19/764 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/786 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/786 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/800 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 16/816 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/816 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 7/823 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/823 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/823 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 312 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2860 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4805ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 366 ms.
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 523/523 transitions.
Graph (trivial) has 234 edges and 300 vertex of which 18 / 300 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 285 transition count 447
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 230 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 229 transition count 444
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 115 place count 229 transition count 412
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 179 place count 197 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 196 transition count 392
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 196 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 237 place count 168 transition count 364
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 297 place count 138 transition count 488
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 303 place count 138 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 4 with 52 rules applied. Total rules applied 355 place count 138 transition count 430
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 375 place count 138 transition count 410
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 401 place count 118 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 456 place count 118 transition count 349
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 458 place count 118 transition count 349
Applied a total of 458 rules in 67 ms. Remains 118 /300 variables (removed 182) and now considering 349/523 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 118/300 places, 349/523 transitions.
RANDOM walk for 40000 steps (2228 resets) in 218 ms. (182 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (540 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (547 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
[2026-05-26 23:38:22] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4506004379925667184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18422302332163735037.kers'
[2026-05-26 23:38:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4506004379925667184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18422302332163735037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 307 rows 118 cols 1098 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 23:38:22] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18422302332163735037.kers
Total runtime 4 ms.
[2026-05-26 23:38:22] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 307/421 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 63/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/425 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 307/421 variables, 114/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 63/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/425 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/425 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1398ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 349/349 transitions.
Applied a total of 0 rules in 6 ms. Remains 118 /118 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 118/118 places, 349/349 transitions.
RANDOM walk for 40000 steps (2230 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (556 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (556 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 545854 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 2
Probabilistic random walk after 545854 steps, saw 173932 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2026-05-26 23:38:27] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2026-05-26 23:38:27] [INFO ] Invariant cache hit.
[2026-05-26 23:38:27] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 307/421 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 63/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/425 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 188 constraints, problems are : Problem set: 0 solved, 2 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 307/421 variables, 114/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 63/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/425 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/425 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 193 constraints, problems are : Problem set: 0 solved, 2 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 349/349 transitions.
Applied a total of 0 rules in 8 ms. Remains 118 /118 variables (removed 0) and now considering 349/349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 118/118 places, 349/349 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 349/349 transitions.
Applied a total of 0 rules in 7 ms. Remains 118 /118 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2026-05-26 23:38:28] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2026-05-26 23:38:28] [INFO ] Invariant cache hit.
[2026-05-26 23:38:28] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-26 23:38:28] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2026-05-26 23:38:28] [INFO ] Invariant cache hit.
[2026-05-26 23:38:28] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-26 23:38:29] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2026-05-26 23:38:29] [INFO ] Redundant transitions in 3 ms returned []
Running 345 sub problems to find dead transitions.
[2026-05-26 23:38:29] [INFO ] Flow matrix only has 307 transitions (discarded 42 similar events)
[2026-05-26 23:38:29] [INFO ] Invariant cache hit.
[2026-05-26 23:38:29] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 307/425 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 194 constraints, problems are : Problem set: 0 solved, 345 unsolved in 28490 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 307/425 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 63/194 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 345/539 constraints. Problems are: Problem set: 0 solved, 345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 539 constraints, problems are : Problem set: 0 solved, 345 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58601ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 58603ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59299 ms. Remains : 118/118 places, 349/349 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 107 edges and 118 vertex of which 15 / 118 are part of one of the 3 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 84 transitions.
Graph (complete) has 485 edges and 106 vertex of which 104 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 100 transition count 261
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 100 transition count 261
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 100 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 99 transition count 254
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 97 transition count 258
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 30 place count 97 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 53 place count 97 transition count 227
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 97 transition count 224
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 94 transition count 224
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 94 transition count 224
Applied a total of 65 rules in 38 ms. Remains 94 /118 variables (removed 24) and now considering 224/349 (removed 125) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14472866761543762158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16839153836612083665.kers'
[2026-05-26 23:39:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14472866761543762158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16839153836612083665.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 94 cols 826 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-26 23:39:27] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16839153836612083665.kers
Total runtime 4 ms.
[2026-05-26 23:39:27] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-26 23:39:28] [INFO ] After 133ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2026-05-26 23:39:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-26 23:39:28] [INFO ] After 23ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 23:39:28] [INFO ] After 257ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-26 23:39:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-26 23:39:28] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-26 23:39:28] [INFO ] After 45ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 23:39:28] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-26 23:39:28] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 688 ms.
Knowledge based reduction with 26 factoid took 164 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Knowledge-based reduction took 74970 ms.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 4 out of 300 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 523/523 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-141176983230700597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9998536256803425739.kers'
[2026-05-26 23:39:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-141176983230700597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9998536256803425739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 523 rows 300 cols 1602 entries
Finished phase 1 with 293 SingleSign rule and 0 generalized
[2026-05-26 23:39:29] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9998536256803425739.kers
Total runtime 6 ms.
[2026-05-26 23:39:29] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-26 23:39:29] [INFO ] Invariant cache hit.
[2026-05-26 23:39:30] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2026-05-26 23:39:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/299 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (OVERLAPS) 1/300 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/300 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/300 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 522 unsolved
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 30120ms
Finished structural reductions in LTL mode , in 1 iterations and 31219 ms. Remains : 300/300 places, 523/523 transitions.
Computed a total of 46 stabilizing places and 50 stable transitions
Computed a total of 46 stabilizing places and 50 stable transitions
Knowledge based reduction with 11 factoid took 115 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (15 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (15 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 487107 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 4
Probabilistic random walk after 487107 steps, saw 99211 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2026-05-26 23:40:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 483/745 variables, 262/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 19/764 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/764 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 22/786 variables, 11/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/786 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 14/800 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/800 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 16/816 variables, 7/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/816 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 7/823 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/823 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/823 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 308 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 208/212 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 50/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 483/745 variables, 262/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 19/764 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/786 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/786 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 14/800 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/800 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 16/816 variables, 7/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/816 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 7/823 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/823 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/823 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 312 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1835 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3110ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 668 ms.
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 300/300 places, 523/523 transitions.
Graph (trivial) has 234 edges and 300 vertex of which 18 / 300 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 285 transition count 447
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 114 place count 230 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 229 transition count 444
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 115 place count 229 transition count 412
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 179 place count 197 transition count 412
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 196 transition count 392
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 196 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 237 place count 168 transition count 364
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -124
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 297 place count 138 transition count 488
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 303 place count 138 transition count 482
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 4 with 52 rules applied. Total rules applied 355 place count 138 transition count 430
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 375 place count 138 transition count 410
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 401 place count 118 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 456 place count 118 transition count 349
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 458 place count 118 transition count 349
Applied a total of 458 rules in 47 ms. Remains 118 /300 variables (removed 182) and now considering 349/523 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 118/300 places, 349/523 transitions.
RANDOM walk for 40000 steps (2219 resets) in 139 ms. (285 steps per ms) remains 2/4 properties
BEST_FIRST walk for 32125 steps (423 resets) in 45 ms. (698 steps per ms) remains 0/2 properties
Knowledge based reduction with 11 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Knowledge-based reduction took 7572 ms.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 1 reset in 178 ms.
Spot run failed in 56 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin1532627499874811120
[2026-05-26 23:40:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1532627499874811120
Running compilation step : cd /tmp/ltsmin1532627499874811120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1242 ms.
Running link step : cd /tmp/ltsmin1532627499874811120;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin1532627499874811120;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13598379095478167370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 523/523 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 299 transition count 522
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 298 transition count 521
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 298 transition count 521
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 297 transition count 520
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 297 transition count 520
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 296 transition count 519
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 296 transition count 519
Applied a total of 8 rules in 14 ms. Remains 296 /300 variables (removed 4) and now considering 519/523 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9419671889192294924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-944712411590290023.kers'
[2026-05-26 23:40:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9419671889192294924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-944712411590290023.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 519 rows 296 cols 1594 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-05-26 23:40:23] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-944712411590290023.kers
Total runtime 4 ms.
[2026-05-26 23:40:23] [INFO ] Implicit Places using invariants in 246 ms returned []
[2026-05-26 23:40:23] [INFO ] Invariant cache hit.
[2026-05-26 23:40:24] [INFO ] Implicit Places using invariants and state equation in 674 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2026-05-26 23:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 519/815 variables, 296/311 constraints. Problems are: Problem set: 0 solved, 518 unsolved
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 30196ms
Starting structural reductions in LTL mode, iteration 1 : 296/300 places, 519/523 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31134 ms. Remains : 296/300 places, 519/523 transitions.
Built C files in :
/tmp/ltsmin4455740370894458288
[2026-05-26 23:40:54] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4455740370894458288
Running compilation step : cd /tmp/ltsmin4455740370894458288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1187 ms.
Running link step : cd /tmp/ltsmin4455740370894458288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4455740370894458288;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2490046405793396143.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 23:41:09] [INFO ] Flatten gal took : 22 ms
[2026-05-26 23:41:09] [INFO ] Flatten gal took : 21 ms
[2026-05-26 23:41:09] [INFO ] Time to serialize gal into /tmp/LTL2773124544080895066.gal : 4 ms
[2026-05-26 23:41:09] [INFO ] Time to serialize properties into /tmp/LTL9745564516564426317.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2773124544080895066.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9683152851123006057.hoa' '-atoms' '/tmp/LTL9745564516564426317.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9745564516564426317.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9683152851123006057.hoa
Detected timeout of ITS tools.
[2026-05-26 23:41:24] [INFO ] Flatten gal took : 16 ms
[2026-05-26 23:41:24] [INFO ] Flatten gal took : 15 ms
[2026-05-26 23:41:24] [INFO ] Time to serialize gal into /tmp/LTL8297326991233705676.gal : 4 ms
[2026-05-26 23:41:24] [INFO ] Time to serialize properties into /tmp/LTL1150652790541399724.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8297326991233705676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1150652790541399724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((!((!("((p62==1)&&(p310==1))"))U((!(F(X("((p62==1)&&(p310==1))"))))&&(X(F("((p22==1)&&(p105==1))"))))))||(G("(p414==1)"))))
Formula 0 simplified : F!"(p414==1)" & (!"((p62==1)&&(p310==1))" U X(F"((p22==1)&&(p105==1))" & G!"((p62==1)&&(p310==1))"))
Detected timeout of ITS tools.
[2026-05-26 23:41:39] [INFO ] Flatten gal took : 13 ms
[2026-05-26 23:41:39] [INFO ] Applying decomposition
[2026-05-26 23:41:39] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13200780194756476732.txt' '-o' '/tmp/graph13200780194756476732.bin' '-w' '/tmp/graph13200780194756476732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13200780194756476732.bin' '-l' '-1' '-v' '-w' '/tmp/graph13200780194756476732.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:41:40] [INFO ] Decomposing Gal with order
[2026-05-26 23:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:41:40] [INFO ] Removed a total of 564 redundant transitions.
[2026-05-26 23:41:40] [INFO ] Flatten gal took : 57 ms
[2026-05-26 23:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 29 ms.
[2026-05-26 23:41:40] [INFO ] Time to serialize gal into /tmp/LTL7045110651565146266.gal : 10 ms
[2026-05-26 23:41:40] [INFO ] Time to serialize properties into /tmp/LTL6109730276198977533.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7045110651565146266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6109730276198977533.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((!((!("((i1.i0.u3.p62==1)&&(i8.i1.u81.p310==1))"))U((!(F(X("((i1.i0.u3.p62==1)&&(i8.i1.u81.p310==1))"))))&&(X(F("((i2.u8.p22==1)&&(...213
Formula 0 simplified : F!"(i12.i2.u112.p414==1)" & (!"((i1.i0.u3.p62==1)&&(i8.i1.u81.p310==1))" U X(F"((i2.u8.p22==1)&&(i3.i0.u26.p105==1))" & G!"((i1.i0.u...189
Detected timeout of ITS tools.
Treatment of property FireWire-PT-17-LTLFireability-09 finished in 283143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(F(p1)))))&&F(p2)))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 303 transition count 526
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 303 transition count 526
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 301 transition count 524
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 301 transition count 524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 300 transition count 523
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 300 transition count 523
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 299 transition count 522
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 298 transition count 521
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 298 transition count 521
Applied a total of 24 rules in 18 ms. Remains 298 /310 variables (removed 12) and now considering 521/533 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17105987665692393134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13311063512359289846.kers'
[2026-05-26 23:41:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17105987665692393134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13311063512359289846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 521 rows 298 cols 1598 entries
Finished phase 1 with 291 SingleSign rule and 0 generalized
[2026-05-26 23:41:55] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13311063512359289846.kers
Total runtime 4 ms.
[2026-05-26 23:41:55] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-26 23:41:55] [INFO ] Invariant cache hit.
[2026-05-26 23:41:56] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2026-05-26 23:41:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/819 variables, and 19 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (OVERLAPS) 521/819 variables, 298/317 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 520/837 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 839 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 298/310 places, 521/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61031 ms. Remains : 298/310 places, 521/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(X(F(p1)))))&&F(p2)))'
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-12
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-12 finished in 61359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1)&&F(p2))))'
Support contains 4 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 304 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 304 transition count 527
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 301 transition count 505
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 301 transition count 505
Applied a total of 18 rules in 13 ms. Remains 301 /310 variables (removed 9) and now considering 505/533 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15301006567972337261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7406369948392319403.kers'
[2026-05-26 23:42:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15301006567972337261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7406369948392319403.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 505 rows 301 cols 1527 entries
Finished phase 1 with 294 SingleSign rule and 0 generalized
[2026-05-26 23:42:56] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7406369948392319403.kers
Total runtime 5 ms.
[2026-05-26 23:42:56] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-26 23:42:56] [INFO ] Invariant cache hit.
[2026-05-26 23:42:57] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
Running 504 sub problems to find dead transitions.
[2026-05-26 23:42:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 504 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/806 variables, and 16 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/301 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/301 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 505/806 variables, 301/317 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/806 variables, 504/821 constraints. Problems are: Problem set: 0 solved, 504 unsolved
SMT process timed out in 60432ms, After SMT, problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Starting structural reductions in LTL mode, iteration 1 : 301/310 places, 505/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61547 ms. Remains : 301/310 places, 505/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 140 ms.
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-13 finished in 62017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(X(G((p1||X(X(F(p2)))))))))'
Support contains 5 out of 310 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 310/310 places, 533/533 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 303 transition count 526
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 303 transition count 526
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 299 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 299 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 298 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 298 transition count 502
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 297 transition count 501
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 296 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 296 transition count 500
Applied a total of 28 rules in 28 ms. Remains 296 /310 variables (removed 14) and now considering 500/533 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2306815910251853067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16641975612396046522.kers'
[2026-05-26 23:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2306815910251853067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16641975612396046522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 500 rows 296 cols 1516 entries
Finished phase 1 with 289 SingleSign rule and 0 generalized
[2026-05-26 23:43:58] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16641975612396046522.kers
Total runtime 5 ms.
[2026-05-26 23:43:59] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-26 23:43:59] [INFO ] Invariant cache hit.
[2026-05-26 23:43:59] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1051 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2026-05-26 23:43:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 296/796 variables, and 18 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/796 variables, 296/314 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 499/813 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 813 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 296/310 places, 500/533 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61229 ms. Remains : 296/310 places, 500/533 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(X(G((X(X(F(p1)))||p2))))))'
Stuttering acceptance computed with spot in 596 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (AND (NOT p1) p0 p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-15
Product exploration explored 100000 steps with 14321 reset in 475 ms.
Stack based approach found an accepted trace after 12104 steps with 1710 reset with depth 10 and stack size 10 in 48 ms.
FORMULA FireWire-PT-17-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-17-LTLFireability-15 finished in 62443 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((X(p0)||G(p1))))))'
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(!p0 U (!F(X(p0))&&X(F(p1))))||G(p2)))'
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 23:45:01] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17089159149250589649
[2026-05-26 23:45:01] [INFO ] Computing symmetric may disable matrix : 533 transitions.
[2026-05-26 23:45:01] [INFO ] Applying decomposition
[2026-05-26 23:45:01] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 23:45:01] [INFO ] Computing symmetric may enable matrix : 533 transitions.
[2026-05-26 23:45:01] [INFO ] Flatten gal took : 22 ms
[2026-05-26 23:45:01] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17987479676535599619.txt' '-o' '/tmp/graph17987479676535599619.bin' '-w' '/tmp/graph17987479676535599619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17987479676535599619.bin' '-l' '-1' '-v' '-w' '/tmp/graph17987479676535599619.weights' '-q' '0' '-e' '0.001'
[2026-05-26 23:45:01] [INFO ] Decomposing Gal with order
[2026-05-26 23:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 23:45:01] [INFO ] Computing Do-Not-Accords matrix : 533 transitions.
[2026-05-26 23:45:01] [INFO ] Removed a total of 569 redundant transitions.
[2026-05-26 23:45:01] [INFO ] Flatten gal took : 50 ms
[2026-05-26 23:45:01] [INFO ] Computation of Completed DNA matrix. took 46 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 23:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 9 ms.
[2026-05-26 23:45:01] [INFO ] Built C files in 219ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17089159149250589649
Running compilation step : cd /tmp/ltsmin17089159149250589649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 23:45:01] [INFO ] Time to serialize gal into /tmp/LTLFireability6258064579761665973.gal : 7 ms
[2026-05-26 23:45:01] [INFO ] Time to serialize properties into /tmp/LTLFireability13776606706974417960.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6258064579761665973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13776606706974417960.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(X(X((X("((i2.u18.p70==1)&&(i3.u94.p350==1))"))||(G("((i4.u16.p62==0)||(i5.u41.p153==0))")))))))
Formula 0 simplified : XXX(X!"((i2.u18.p70==1)&&(i3.u94.p350==1))" & F!"((i4.u16.p62==0)||(i5.u41.p153==0))")
Compilation finished in 1933 ms.
Running link step : cd /tmp/ltsmin17089159149250589649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin17089159149250589649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X((X((LTLAPp0==true))||[]((LTLAPp1==true))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t127, t210, t226, t233, t246, t248, t257, t261, t281, t282, t284, t285, t300, t302, t357, t36...1168
Computing Next relation with stutter on 3.92373e+06 deadlock states
8 unique states visited
8 strongly connected components in search stack
8 transitions explored
8 items max in DFS search stack
6070 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,60.7664,1312532,1,0,2.12868e+06,1871,6098,4.40123e+06,374,8065,6013250
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FireWire-PT-17-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((!((!("((i4.u16.p62==1)&&(i10.u85.p310==1))"))U((!(F(X("((i4.u16.p62==1)&&(i10.u85.p310==1))"))))&&(X(F("((i3.u7.p22==1)&&(i6.u29.p...205
Formula 1 simplified : F!"(i14.i1.i2.u115.p414==1)" & (!"((i4.u16.p62==1)&&(i10.u85.p310==1))" U X(F"((i3.u7.p22==1)&&(i6.u29.p105==1))" & G!"((i4.u16.p62=...181
Computing Next relation with stutter on 3.92373e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
39131 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,452.082,7773552,1,0,1.12433e+07,1916,2926,3.07537e+07,196,8844,84995
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FireWire-PT-17-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1484400 ms.

BK_STOP 1779839555185

--------------------
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="FireWire-PT-17"
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 FireWire-PT-17, 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 r130-smll-177955809000276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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