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.r194-tall-177969913800004.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 MultiwaySync-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 7 18:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 18:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 11:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 111K 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 MultiwaySync-PT-none-LTLFireability-00
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-01
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-02
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-03
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-04
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-05
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-06
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-07
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-08
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-09
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-10
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-11
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-12
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-13
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-14
FORMULA_NAME MultiwaySync-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779700489300

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiwaySync-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:14: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-25 09:14:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:14:50] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2026-05-25 09:14:50] [INFO ] Transformed 222 places.
[2026-05-25 09:14:50] [INFO ] Transformed 472 transitions.
[2026-05-25 09:14:50] [INFO ] Found NUPN structural information;
[2026-05-25 09:14:50] [INFO ] Parsed PT model containing 222 places and 472 transitions and 1496 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 83 transitions
Reduce redundant transitions removed 83 transitions.
FORMULA MultiwaySync-PT-none-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 389/389 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 211 transition count 378
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 211 transition count 378
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 27 place count 211 transition count 373
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 207 transition count 361
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 207 transition count 361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 207 transition count 358
Applied a total of 38 rules in 46 ms. Remains 207 /222 variables (removed 15) and now considering 358/389 (removed 31) transitions.
[2026-05-25 09:14:51] [INFO ] Flow matrix only has 353 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13322523017689802261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1081158087663412518.kers'
[2026-05-25 09:14:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13322523017689802261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1081158087663412518.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 353 rows 207 cols 1160 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-25 09:14:51] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1081158087663412518.kers
Total runtime 2 ms.
[2026-05-25 09:14:51] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-25 09:14:51] [INFO ] Flow matrix only has 353 transitions (discarded 5 similar events)
[2026-05-25 09:14:51] [INFO ] Invariant cache hit.
[2026-05-25 09:14:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:14:51] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2026-05-25 09:14:51] [INFO ] Flow matrix only has 353 transitions (discarded 5 similar events)
[2026-05-25 09:14:51] [INFO ] Invariant cache hit.
[2026-05-25 09:14:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 353/560 variables, 207/240 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (OVERLAPS) 0/560 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 243 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 10/35 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (OVERLAPS) 353/560 variables, 207/242 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 357/600 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (OVERLAPS) 0/560 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 357 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 600 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Starting structural reductions in LTL mode, iteration 1 : 207/222 places, 358/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61076 ms. Remains : 207/222 places, 358/389 transitions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Applied a total of 0 rules in 6 ms. Remains 207 /207 variables (removed 0) and now considering 358/358 (removed 0) transitions.
[2026-05-25 09:15:52] [INFO ] Flow matrix only has 353 transitions (discarded 5 similar events)
[2026-05-25 09:15:52] [INFO ] Invariant cache hit.
[2026-05-25 09:15:52] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 09:15:52] [INFO ] Flow matrix only has 353 transitions (discarded 5 similar events)
[2026-05-25 09:15:52] [INFO ] Invariant cache hit.
[2026-05-25 09:15:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:15:52] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 207/207 places, 358/358 transitions.
Support contains 32 out of 207 places after structural reductions.
[2026-05-25 09:15:52] [INFO ] Flatten gal took : 52 ms
[2026-05-25 09:15:52] [INFO ] Flatten gal took : 22 ms
[2026-05-25 09:15:52] [INFO ] Input system was already deterministic with 358 transitions.
RANDOM walk for 40000 steps (8 resets) in 1517 ms. (26 steps per ms) remains 8/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 4/4 properties
[2026-05-25 09:15:53] [INFO ] Flow matrix only has 353 transitions (discarded 5 similar events)
[2026-05-25 09:15:53] [INFO ] Invariant cache hit.
[2026-05-25 09:15:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp27 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/70 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 131/201 variables, 21/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 353/554 variables, 201/226 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/560 variables, 6/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/560 variables, 0/233 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 233 constraints, problems are : Problem set: 1 solved, 3 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/70 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 131/201 variables, 21/26 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 353/554 variables, 201/228 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/554 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 3/232 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/232 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/560 variables, 6/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/560 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 238 constraints, problems are : Problem set: 1 solved, 3 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 207/207 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 668ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 694 ms.
Support contains 7 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 358/358 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 207 transition count 356
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 205 transition count 356
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 567 edges and 205 vertex of which 70 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.1 ms
Discarding 135 places :
Also discarding 126 output transitions
Drop transitions (Output transitions of discarded places.) removed 126 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 9 rules applied. Total rules applied 13 place count 70 transition count 222
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 111 place count 68 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 66 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 66 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 66 transition count 121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 126 place count 61 transition count 116
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 3 with 2 rules applied. Total rules applied 128 place count 60 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 146 place count 60 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 146 place count 60 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 59 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 57 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 57 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 152 place count 57 transition count 94
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 156 place count 55 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 158 place count 55 transition count 92
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 168 place count 50 transition count 87
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 171 place count 50 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 175 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 176 place count 47 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 177 place count 47 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 47 transition count 74
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 181 place count 47 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 183 place count 45 transition count 72
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 45 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 185 place count 44 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 43 transition count 77
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 16 edges and 42 vertex of which 3 / 42 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
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 7 with 3 rules applied. Total rules applied 189 place count 40 transition count 76
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 196 place count 39 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 197 place count 38 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 197 place count 38 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 199 place count 37 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 201 place count 36 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 202 place count 36 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 203 place count 36 transition count 66
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 206 place count 36 transition count 63
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 209 place count 33 transition count 63
Applied a total of 209 rules in 88 ms. Remains 33 /207 variables (removed 174) and now considering 63/358 (removed 295) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 33/207 places, 63/358 transitions.
RANDOM walk for 40000 steps (3089 resets) in 498 ms. (80 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (38 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6698854230938807138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4206333502106058175.kers'
[2026-05-25 09:15:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6698854230938807138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4206333502106058175.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 63 rows 33 cols 206 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 09:15:54] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4206333502106058175.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/70 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/96 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/70 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/96 variables, 12/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 63/63 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 61
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 31 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 31 transition count 47
Applied a total of 18 rules in 8 ms. Remains 31 /33 variables (removed 2) and now considering 47/63 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 31/33 places, 47/63 transitions.
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1614 steps, run visited all 1 properties in 9 ms. (steps per millisecond=179 )
Probabilistic random walk after 1614 steps, saw 651 distinct states, run finished after 12 ms. (steps per millisecond=134 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 11 stabilizing places and 17 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' '!(X(!(X(G((p0 U p1))) U (X((X(p1)||p0))&&p2))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 204 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 204 transition count 349
Applied a total of 8 rules in 6 ms. Remains 204 /207 variables (removed 3) and now considering 349/358 (removed 9) transitions.
[2026-05-25 09:15:55] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12710160138191450088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4156065480221002776.kers'
[2026-05-25 09:15:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12710160138191450088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4156065480221002776.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 204 cols 1124 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-25 09:15:55] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4156065480221002776.kers
Total runtime 2 ms.
[2026-05-25 09:15:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:15:55] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:15:55] [INFO ] Invariant cache hit.
[2026-05-25 09:15:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:15:55] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 09:15:55] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:15:55] [INFO ] Invariant cache hit.
[2026-05-25 09:15:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 16948 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47121ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 47124ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47365 ms. Remains : 204/207 places, 349/358 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(G((p0 U p1))) U (X((X(p1)||p0))&&p2))))'
Stuttering acceptance computed with spot in 490 ms :[(OR (AND p0 p2) (AND p1 p2)), (OR (AND p0 p2) (AND p1 p2)), (OR p0 p1), (AND p1 p2), true, p1, p1, p1, p1]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 292 ms.
Product exploration explored 100000 steps with 33333 reset in 251 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 13 ms. Proved property starting from automaton with 9 states, 14 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiwaySync-PT-none-LTLFireability-00 finished in 48597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(X(F(p1))))))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 358/358 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 207 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 205 transition count 356
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 203 transition count 352
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 203 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 203 transition count 351
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 59 place count 178 transition count 326
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 174 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 1 with 96 rules applied. Total rules applied 163 place count 174 transition count 259
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 163 place count 174 transition count 239
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 1 with 40 rules applied. Total rules applied 203 place count 154 transition count 239
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 218 place count 139 transition count 224
Iterating global reduction 1 with 15 rules applied. Total rules applied 233 place count 139 transition count 224
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 233 place count 139 transition count 222
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 237 place count 137 transition count 222
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 279 place count 116 transition count 201
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 285 place count 110 transition count 189
Iterating global reduction 1 with 6 rules applied. Total rules applied 291 place count 110 transition count 189
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 296 place count 110 transition count 184
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 297 place count 110 transition count 184
Applied a total of 297 rules in 62 ms. Remains 110 /207 variables (removed 97) and now considering 184/358 (removed 174) transitions.
[2026-05-25 09:16:44] [INFO ] Flow matrix only has 166 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15969238899057144569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6904486284013867151.kers'
[2026-05-25 09:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15969238899057144569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6904486284013867151.kers]
Normalized transition count is 165 out of 166 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 165 rows 108 cols 538 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 09:16:44] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6904486284013867151.kers
Total runtime 1 ms.
[2026-05-25 09:16:44] [INFO ] Implicit Places using invariants in 60 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/207 places, 184/358 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 109 transition count 166
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 109 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 108 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 107 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 107 transition count 164
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 96 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 92 transition count 137
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 92 transition count 137
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 58 place count 89 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 62 place count 89 transition count 156
Applied a total of 62 rules in 18 ms. Remains 89 /109 variables (removed 20) and now considering 156/184 (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-7140696603323055084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3291821807349789733.kers'
[2026-05-25 09:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7140696603323055084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3291821807349789733.kers]
Normalized transition count is 155 out of 156 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 155 rows 88 cols 548 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 09:16:44] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3291821807349789733.kers
Total runtime 1 ms.
[2026-05-25 09:16:44] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 09:16:44] [INFO ] Invariant cache hit.
[2026-05-25 09:16:44] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-25 09:16:44] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/207 places, 156/358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 323 ms. Remains : 89/207 places, 156/358 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||X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge based reduction with 8 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 31082 steps (1184 resets) in 512 ms. (60 steps per ms) remains 0/4 properties
Knowledge based reduction with 8 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 491 ms.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 156/156 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2026-05-25 09:16:45] [INFO ] Invariant cache hit.
[2026-05-25 09:16:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 09:16:45] [INFO ] Invariant cache hit.
[2026-05-25 09:16:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2026-05-25 09:16:45] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2026-05-25 09:16:45] [INFO ] Redundant transitions in 9 ms returned []
Running 148 sub problems to find dead transitions.
[2026-05-25 09:16:45] [INFO ] Invariant cache hit.
[2026-05-25 09:16:45] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 155/244 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 1/245 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 147 constraints, problems are : Problem set: 0 solved, 148 unsolved in 5414 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 155/244 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 46/146 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 148/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 1/245 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 295 constraints, problems are : Problem set: 0 solved, 148 unsolved in 7480 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12913ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 12914ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13091 ms. Remains : 89/89 places, 156/156 transitions.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge based reduction with 8 factoid took 71 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 36591 steps (1379 resets) in 93 ms. (389 steps per ms) remains 0/4 properties
Knowledge based reduction with 8 factoid took 137 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 347 ms.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 184 ms.
Built C files in :
/tmp/ltsmin12456900348139315561
[2026-05-25 09:16:59] [INFO ] Computing symmetric may disable matrix : 156 transitions.
[2026-05-25 09:16:59] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:16:59] [INFO ] Computing symmetric may enable matrix : 156 transitions.
[2026-05-25 09:16:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:16:59] [INFO ] Computing Do-Not-Accords matrix : 156 transitions.
[2026-05-25 09:16:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:16:59] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12456900348139315561
Running compilation step : cd /tmp/ltsmin12456900348139315561;'/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 406 ms.
Running link step : cd /tmp/ltsmin12456900348139315561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12456900348139315561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11321120892285703642.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MultiwaySync-PT-none-LTLFireability-01 finished in 15730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Reduce places removed 1 places and 1 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 206 transition count 355
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 203 transition count 355
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 207 edges and 203 vertex of which 109 / 203 are part of one of the 32 SCC in 1 ms
Free SCC test removed 77 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 80 rules applied. Total rules applied 85 place count 126 transition count 276
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 231 place count 95 transition count 161
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 245 place count 81 transition count 131
Iterating global reduction 2 with 14 rules applied. Total rules applied 259 place count 81 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 81 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 265 place count 76 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 270 place count 76 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 275 place count 76 transition count 112
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 297 place count 65 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 299 place count 64 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 311 place count 64 transition count 90
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 323 place count 58 transition count 84
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 329 place count 52 transition count 64
Iterating global reduction 4 with 6 rules applied. Total rules applied 335 place count 52 transition count 64
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 341 place count 52 transition count 58
Applied a total of 341 rules in 25 ms. Remains 52 /207 variables (removed 155) and now considering 58/358 (removed 300) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1630397806904803789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9066110164078780084.kers'
[2026-05-25 09:16:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1630397806904803789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9066110164078780084.kers]
Normalized transition count is 57 out of 58 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 57 rows 47 cols 148 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 09:16:59] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9066110164078780084.kers
Total runtime 0 ms.
[2026-05-25 09:17:00] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-25 09:17:00] [INFO ] Invariant cache hit.
[2026-05-25 09:17:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2026-05-25 09:17:00] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-25 09:17:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 57/107 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 2/109 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/109 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 62 constraints, problems are : Problem set: 0 solved, 44 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 5/50 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 57/107 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 44/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 2/109 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 106 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1979ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/207 places, 58/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2201 ms. Remains : 52/207 places, 58/358 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 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 55 ms.
Computed a total of 10 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (1747 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (301 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 789 steps, run visited all 1 properties in 7 ms. (steps per millisecond=112 )
Probabilistic random walk after 789 steps, saw 515 distinct states, run finished after 7 ms. (steps per millisecond=112 ) properties seen :1
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 248 ms.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 58/58 (removed 0) transitions.
[2026-05-25 09:17:02] [INFO ] Invariant cache hit.
[2026-05-25 09:17:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 09:17:02] [INFO ] Invariant cache hit.
[2026-05-25 09:17:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2026-05-25 09:17:02] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 52/52 places, 58/58 transitions.
Computed a total of 10 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 42 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 31838 steps (1374 resets) in 104 ms. (303 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 51 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 202 ms.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Built C files in :
/tmp/ltsmin16598684441002683528
[2026-05-25 09:17:03] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2026-05-25 09:17:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:17:03] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2026-05-25 09:17:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:17:03] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2026-05-25 09:17:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:17:03] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16598684441002683528
Running compilation step : cd /tmp/ltsmin16598684441002683528;'/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 146 ms.
Running link step : cd /tmp/ltsmin16598684441002683528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16598684441002683528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7138431378489490000.hoa' '--buchi-type=spotba'
LTSmin run took 29 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MultiwaySync-PT-none-LTLFireability-02 finished in 3671 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((F(p1) U p2))))) U (p2 U p3)))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 204 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 204 transition count 349
Applied a total of 8 rules in 8 ms. Remains 204 /207 variables (removed 3) and now considering 349/358 (removed 9) transitions.
[2026-05-25 09:17:03] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12577576424909486704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7184750418765663773.kers'
[2026-05-25 09:17:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12577576424909486704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7184750418765663773.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 204 cols 1124 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-25 09:17:03] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7184750418765663773.kers
Total runtime 2 ms.
[2026-05-25 09:17:03] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:17:03] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:17:03] [INFO ] Invariant cache hit.
[2026-05-25 09:17:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:17:03] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 09:17:03] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:17:03] [INFO ] Invariant cache hit.
[2026-05-25 09:17:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 17107 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47229ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 47230ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47470 ms. Remains : 204/207 places, 349/358 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((F(p1) U p2))))) U (p2 U p3)))'
Stuttering acceptance computed with spot in 541 ms :[(NOT p3), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-03
Product exploration explored 100000 steps with 22979 reset in 261 ms.
Stack based approach found an accepted trace after 1018 steps with 235 reset with depth 53 and stack size 53 in 4 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-03 finished in 48371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((p0 U p1) U !((p0 U X(p0))||p2)) U p3)))'
Support contains 5 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 352
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 205 transition count 351
Applied a total of 5 rules in 9 ms. Remains 205 /207 variables (removed 2) and now considering 351/358 (removed 7) transitions.
[2026-05-25 09:17:51] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2509840673578469084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13940161185698298109.kers'
[2026-05-25 09:17:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2509840673578469084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13940161185698298109.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 205 cols 1132 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-25 09:17:51] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13940161185698298109.kers
Total runtime 4 ms.
[2026-05-25 09:17:52] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 09:17:52] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2026-05-25 09:17:52] [INFO ] Invariant cache hit.
[2026-05-25 09:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:17:52] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2026-05-25 09:17:52] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2026-05-25 09:17:52] [INFO ] Invariant cache hit.
[2026-05-25 09:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 346/551 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 350 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 240 constraints, problems are : Problem set: 0 solved, 350 unsolved in 20851 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 4 (OVERLAPS) 346/551 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 350/590 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 1/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 591 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50957ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 50958ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 351/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51215 ms. Remains : 205/207 places, 351/358 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((p0 U p1) U !((p0 U X(p0))||p2)) U p3)))'
Stuttering acceptance computed with spot in 310 ms :[(NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (AND (NOT p0) p2 p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-06 finished in 51598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 204 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 204 transition count 349
Applied a total of 8 rules in 6 ms. Remains 204 /207 variables (removed 3) and now considering 349/358 (removed 9) transitions.
[2026-05-25 09:18:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1542678362210419361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17079573352346815120.kers'
[2026-05-25 09:18:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1542678362210419361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17079573352346815120.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 204 cols 1124 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-25 09:18:43] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17079573352346815120.kers
Total runtime 1 ms.
[2026-05-25 09:18:43] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 09:18:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:18:43] [INFO ] Invariant cache hit.
[2026-05-25 09:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:18:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 09:18:43] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:18:43] [INFO ] Invariant cache hit.
[2026-05-25 09:18:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 16848 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46975ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 46977ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47284 ms. Remains : 204/207 places, 349/358 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(!p0) U (X(G(!p0))||(p1&&X(!p0)))))))'
Stuttering acceptance computed with spot in 160 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 241 ms.
Product exploration explored 100000 steps with 25000 reset in 301 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 335 ms. (119 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1518414 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :0 out of 1
Probabilistic random walk after 1518414 steps, saw 872847 distinct states, run finished after 3004 ms. (steps per millisecond=505 ) properties seen :0
[2026-05-25 09:19:34] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:19:34] [INFO ] Invariant cache hit.
[2026-05-25 09:19:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/198 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/542 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/548 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/198 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/542 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/548 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/548 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 349/349 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 204 transition count 347
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 202 transition count 347
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 553 edges and 202 vertex of which 68 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.0 ms
Discarding 134 places :
Also discarding 122 output transitions
Drop transitions (Output transitions of discarded places.) removed 122 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 9 rules applied. Total rules applied 13 place count 68 transition count 217
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 111 place count 66 transition count 121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 121 place count 61 transition count 116
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 2 with 2 rules applied. Total rules applied 123 place count 60 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 141 place count 60 transition count 99
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 141 place count 60 transition count 97
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 58 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 56 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 56 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 149 place count 56 transition count 93
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 54 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 54 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 49 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 168 place count 49 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 47 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 45 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 45 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 45 transition count 66
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 45 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 182 place count 43 transition count 64
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 43 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 42 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 41 transition count 69
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 17 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 6 with 3 rules applied. Total rules applied 188 place count 38 transition count 68
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 195 place count 37 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 196 place count 36 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 200 place count 34 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 202 place count 34 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 203 place count 34 transition count 57
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 206 place count 34 transition count 54
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 209 place count 31 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 216 place count 31 transition count 47
Applied a total of 216 rules in 28 ms. Remains 31 /204 variables (removed 173) and now considering 47/349 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 31/204 places, 47/349 transitions.
RANDOM walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33639 steps (7 resets) in 27 ms. (1201 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 4046 ms.
Stuttering acceptance computed with spot in 130 ms :[p0, p0, p0, p0, true]
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 349/349 transitions.
Applied a total of 0 rules in 2 ms. Remains 204 /204 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2026-05-25 09:19:35] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:19:35] [INFO ] Invariant cache hit.
[2026-05-25 09:19:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 09:19:35] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:19:35] [INFO ] Invariant cache hit.
[2026-05-25 09:19:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:19:35] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 204/204 places, 349/349 transitions.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1694344 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :0 out of 1
Probabilistic random walk after 1694344 steps, saw 968020 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :0
[2026-05-25 09:19:39] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:19:39] [INFO ] Invariant cache hit.
[2026-05-25 09:19:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/198 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/542 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/548 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 145/198 variables, 22/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/542 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/548 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/548 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 349/349 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 204 transition count 347
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 202 transition count 347
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 553 edges and 202 vertex of which 68 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.0 ms
Discarding 134 places :
Also discarding 122 output transitions
Drop transitions (Output transitions of discarded places.) removed 122 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 9 rules applied. Total rules applied 13 place count 68 transition count 217
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 111 place count 66 transition count 121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 121 place count 61 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 60 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 141 place count 60 transition count 99
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 141 place count 60 transition count 97
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 58 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 56 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 56 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 149 place count 56 transition count 93
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 54 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 155 place count 54 transition count 91
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 49 transition count 86
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 168 place count 49 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 47 transition count 81
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 45 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 45 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 45 transition count 66
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 45 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 182 place count 43 transition count 64
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 183 place count 43 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 42 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 41 transition count 69
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 17 edges and 40 vertex of which 3 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
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 6 with 3 rules applied. Total rules applied 188 place count 38 transition count 68
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 195 place count 37 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 196 place count 36 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 200 place count 34 transition count 60
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 202 place count 34 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 203 place count 34 transition count 57
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 206 place count 34 transition count 54
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 209 place count 31 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 216 place count 31 transition count 47
Applied a total of 216 rules in 43 ms. Remains 31 /204 variables (removed 173) and now considering 47/349 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 31/204 places, 47/349 transitions.
RANDOM walk for 40000 steps (8 resets) in 377 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1614 steps, run visited all 1 properties in 5 ms. (steps per millisecond=322 )
Probabilistic random walk after 1614 steps, saw 651 distinct states, run finished after 19 ms. (steps per millisecond=84 ) properties seen :1
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[p0, p0, p0, p0, true]
Knowledge-based reduction took 3964 ms.
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 129 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Product exploration explored 100000 steps with 25000 reset in 308 ms.
Spot run failed in 70 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/ltsmin12482291614767133114
[2026-05-25 09:19:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12482291614767133114
Running compilation step : cd /tmp/ltsmin12482291614767133114;'/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 490 ms.
Running link step : cd /tmp/ltsmin12482291614767133114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12482291614767133114;'/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/stateBased9414426858965350186.hoa' '--buchi-type=spotba'
LTSmin run took 37 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MultiwaySync-PT-none-LTLFireability-07 finished in 58016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 358/358 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 207 transition count 357
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 357
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 203 transition count 350
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 203 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 203 transition count 348
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 58 place count 179 transition count 324
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 175 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 99 place count 175 transition count 320
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 173 transition count 318
Applied a total of 103 rules in 43 ms. Remains 173 /207 variables (removed 34) and now considering 318/358 (removed 40) transitions.
[2026-05-25 09:19:41] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17242810476702376498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9710764737986197570.kers'
[2026-05-25 09:19:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17242810476702376498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9710764737986197570.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 173 cols 1146 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-25 09:19:41] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9710764737986197570.kers
Total runtime 1 ms.
[2026-05-25 09:19:41] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 09:19:41] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2026-05-25 09:19:41] [INFO ] Invariant cache hit.
[2026-05-25 09:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:19:41] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2026-05-25 09:19:41] [INFO ] Redundant transitions in 15 ms returned []
Running 314 sub problems to find dead transitions.
[2026-05-25 09:19:41] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2026-05-25 09:19:41] [INFO ] Invariant cache hit.
[2026-05-25 09:19:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 313/486 variables, 173/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 0/486 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 207 constraints, problems are : Problem set: 0 solved, 314 unsolved in 16980 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 173/173 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 313/486 variables, 173/206 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 314/521 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (OVERLAPS) 0/486 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 523 constraints, problems are : Problem set: 0 solved, 314 unsolved in 29966 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 173/173 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47039ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 47039ms
Starting structural reductions in SI_LTL mode, iteration 1 : 173/207 places, 318/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47451 ms. Remains : 173/207 places, 318/358 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 269 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-09 finished in 47890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1||G(p2))))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 204 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 204 transition count 349
Applied a total of 8 rules in 4 ms. Remains 204 /207 variables (removed 3) and now considering 349/358 (removed 9) transitions.
[2026-05-25 09:20:29] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6063867927481015854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8904862624255823586.kers'
[2026-05-25 09:20:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6063867927481015854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8904862624255823586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 204 cols 1124 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-25 09:20:29] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8904862624255823586.kers
Total runtime 1 ms.
[2026-05-25 09:20:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 09:20:29] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:20:29] [INFO ] Invariant cache hit.
[2026-05-25 09:20:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:20:29] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 09:20:29] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:20:29] [INFO ] Invariant cache hit.
[2026-05-25 09:20:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 16795 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46911ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 46912ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47174 ms. Remains : 204/207 places, 349/358 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)))||p2)))'
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-10
Product exploration explored 100000 steps with 5 reset in 286 ms.
Product exploration explored 100000 steps with 2 reset in 332 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
[2026-05-25 09:21:17] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:21:17] [INFO ] Invariant cache hit.
[2026-05-25 09:21:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf7 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 157/198 variables, 22/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/542 variables, 198/223 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/548 variables, 6/230 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 230 constraints, problems are : Problem set: 2 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 41/548 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 3/25 constraints, State Equation: 0/204 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), false, false, false]
Knowledge-based reduction took 934 ms.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), false, false, false]
Support contains 3 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 349/349 transitions.
Reduce places removed 1 places and 1 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 203 transition count 347
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 202 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 52 place count 177 transition count 322
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 0 with 2 rules applied. Total rules applied 54 place count 176 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 176 transition count 318
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 69 place count 171 transition count 313
Applied a total of 69 rules in 19 ms. Remains 171 /204 variables (removed 33) and now considering 313/349 (removed 36) transitions.
[2026-05-25 09:21:18] [INFO ] Flow matrix only has 308 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-993636009770713651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2438711582687256111.kers'
[2026-05-25 09:21:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-993636009770713651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2438711582687256111.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 308 rows 156 cols 858 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-25 09:21:18] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2438711582687256111.kers
Total runtime 2 ms.
[2026-05-25 09:21:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 09:21:18] [INFO ] Flow matrix only has 308 transitions (discarded 5 similar events)
[2026-05-25 09:21:18] [INFO ] Invariant cache hit.
[2026-05-25 09:21:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:21:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2026-05-25 09:21:18] [INFO ] Redundant transitions in 4 ms returned []
Running 286 sub problems to find dead transitions.
[2026-05-25 09:21:18] [INFO ] Flow matrix only has 308 transitions (discarded 5 similar events)
[2026-05-25 09:21:18] [INFO ] Invariant cache hit.
[2026-05-25 09:21:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 2/171 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 308/479 variables, 171/203 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 205 constraints, problems are : Problem set: 0 solved, 286 unsolved in 19165 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 2/171 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 308/479 variables, 171/204 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 286/491 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 11 (OVERLAPS) 0/479 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 493 constraints, problems are : Problem set: 0 solved, 286 unsolved in 24586 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 171/171 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43838ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 43839ms
Starting structural reductions in SI_LTL mode, iteration 1 : 171/204 places, 313/349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44076 ms. Remains : 171/204 places, 313/349 transitions.
Computed a total of 8 stabilizing places and 14 stable transitions
Computed a total of 8 stabilizing places and 14 stable transitions
Knowledge based reduction with 11 factoid took 219 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 298 ms. (133 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
[2026-05-25 09:22:02] [INFO ] Flow matrix only has 308 transitions (discarded 5 similar events)
[2026-05-25 09:22:02] [INFO ] Invariant cache hit.
[2026-05-25 09:22:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 3/479 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/25 constraints, State Equation: 0/171 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 316 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 5 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), false, false, false]
Knowledge-based reduction took 897 ms.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p2)), false, false, false]
Product exploration explored 100000 steps with 22 reset in 326 ms.
Product exploration explored 100000 steps with 10 reset in 323 ms.
Built C files in :
/tmp/ltsmin1249337898974775490
[2026-05-25 09:22:04] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2026-05-25 09:22:04] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:04] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2026-05-25 09:22:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:04] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2026-05-25 09:22:04] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:04] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1249337898974775490
Running compilation step : cd /tmp/ltsmin1249337898974775490;'/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 649 ms.
Running link step : cd /tmp/ltsmin1249337898974775490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1249337898974775490;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10354938308137048805.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 313/313 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-25 09:22:19] [INFO ] Flow matrix only has 308 transitions (discarded 5 similar events)
[2026-05-25 09:22:19] [INFO ] Invariant cache hit.
[2026-05-25 09:22:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:22:19] [INFO ] Flow matrix only has 308 transitions (discarded 5 similar events)
[2026-05-25 09:22:19] [INFO ] Invariant cache hit.
[2026-05-25 09:22:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:22:19] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2026-05-25 09:22:19] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 171/171 places, 313/313 transitions.
Built C files in :
/tmp/ltsmin9283433467009349365
[2026-05-25 09:22:19] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2026-05-25 09:22:19] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:19] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2026-05-25 09:22:19] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:19] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2026-05-25 09:22:19] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:22:19] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9283433467009349365
Running compilation step : cd /tmp/ltsmin9283433467009349365;'/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 641 ms.
Running link step : cd /tmp/ltsmin9283433467009349365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9283433467009349365;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16584639633081539358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:22:34] [INFO ] Flatten gal took : 18 ms
[2026-05-25 09:22:34] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:22:34] [INFO ] Time to serialize gal into /tmp/LTL2852961410567662881.gal : 18 ms
[2026-05-25 09:22:34] [INFO ] Time to serialize properties into /tmp/LTL7828245659697410622.prop : 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/LTL2852961410567662881.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5078271941255014511.hoa' '-atoms' '/tmp/LTL7828245659697410622.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/LTL7828245659697410622.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5078271941255014511.hoa
Reverse transition relation is NOT exact ! Due to transitions t31, t45, t64, t66, t69, t80, t94, t109, t349, t355, t111.t107, t114.t107, t96.t92, t99.t92, ...329
Detected timeout of ITS tools.
[2026-05-25 09:22:50] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:22:50] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:22:50] [INFO ] Time to serialize gal into /tmp/LTL8224477430943578225.gal : 3 ms
[2026-05-25 09:22:50] [INFO ] Time to serialize properties into /tmp/LTL17178134332908694174.ltl : 17 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/LTL8224477430943578225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17178134332908694174.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((F(("(p117==1)")||(G("((p66==0)||(p220==0))"))))||("((p66==1)&&(p220==1))"))))
Formula 0 simplified : X(!"((p66==1)&&(p220==1))" & G(!"(p117==1)" & F!"((p66==0)||(p220==0))"))
Reverse transition relation is NOT exact ! Due to transitions t31, t45, t64, t66, t69, t80, t94, t109, t349, t355, t111.t107, t114.t107, t96.t92, t99.t92, ...329
Detected timeout of ITS tools.
[2026-05-25 09:23:05] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:23:05] [INFO ] Applying decomposition
[2026-05-25 09:23:05] [INFO ] Flatten gal took : 12 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/graph14328805882612760929.txt' '-o' '/tmp/graph14328805882612760929.bin' '-w' '/tmp/graph14328805882612760929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14328805882612760929.bin' '-l' '-1' '-v' '-w' '/tmp/graph14328805882612760929.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:23:05] [INFO ] Decomposing Gal with order
[2026-05-25 09:23:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:23:05] [INFO ] Removed a total of 252 redundant transitions.
[2026-05-25 09:23:05] [INFO ] Flatten gal took : 243 ms
[2026-05-25 09:23:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 27 ms.
[2026-05-25 09:23:05] [INFO ] Time to serialize gal into /tmp/LTL6893189296353365002.gal : 14 ms
[2026-05-25 09:23:05] [INFO ] Time to serialize properties into /tmp/LTL2448879732647990513.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/LTL6893189296353365002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2448879732647990513.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((F(("(i3.u21.p117==1)")||(G("((i2.u12.p66==0)||(i16.u52.p220==0))"))))||("((i2.u12.p66==1)&&(i16.u52.p220==1))"))))
Formula 0 simplified : X(!"((i2.u12.p66==1)&&(i16.u52.p220==1))" & G(!"(i3.u21.p117==1)" & F!"((i2.u12.p66==0)||(i16.u52.p220==0))"))
Reverse transition relation is NOT exact ! Due to transitions i0.t114_t107, i0.t109, i0.u5.t111.t107, i1.t99_t92, i1.t94, i1.u8.t96.t92, i2.t80, i2.u12.t82...429
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
224 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,2.29225,92852,1,0,154207,15929,2751,253320,914,85536,109892
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MultiwaySync-PT-none-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MultiwaySync-PT-none-LTLFireability-10 finished in 158867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Reduce places removed 1 places and 1 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 206 transition count 355
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 203 transition count 355
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 206 edges and 203 vertex of which 106 / 203 are part of one of the 31 SCC in 0 ms
Free SCC test removed 75 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 81 rules applied. Total rules applied 86 place count 128 transition count 275
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 1 with 143 rules applied. Total rules applied 229 place count 97 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 229 place count 97 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 96 transition count 162
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 245 place count 82 transition count 132
Iterating global reduction 2 with 14 rules applied. Total rules applied 259 place count 82 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 260 place count 82 transition count 131
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 266 place count 76 transition count 112
Iterating global reduction 3 with 6 rules applied. Total rules applied 272 place count 76 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 278 place count 76 transition count 106
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 300 place count 65 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 302 place count 64 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 314 place count 64 transition count 83
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 326 place count 58 transition count 77
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 332 place count 52 transition count 57
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 52 transition count 57
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 344 place count 52 transition count 51
Applied a total of 344 rules in 12 ms. Remains 52 /207 variables (removed 155) and now considering 51/358 (removed 307) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16670909618849945418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8754676579277429715.kers'
[2026-05-25 09:23:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16670909618849945418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8754676579277429715.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 50 rows 45 cols 110 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 09:23:08] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8754676579277429715.kers
Total runtime 1 ms.
[2026-05-25 09:23:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 09:23:08] [INFO ] Invariant cache hit.
[2026-05-25 09:23:08] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2026-05-25 09:23:08] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-25 09:23:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 6/50 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 2/102 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/103 variables, and 63 constraints, problems are : Problem set: 0 solved, 37 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 6/50 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 50/100 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 2/102 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/103 variables, and 100 constraints, problems are : Problem set: 0 solved, 37 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1664ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1664ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/207 places, 51/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1769 ms. Remains : 52/207 places, 51/358 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-11 finished in 1838 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((X(X(X(p0)))&&F(p1)))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 204 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 204 transition count 349
Applied a total of 8 rules in 7 ms. Remains 204 /207 variables (removed 3) and now considering 349/358 (removed 9) transitions.
[2026-05-25 09:23:10] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2741921096075499082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7479443016102034729.kers'
[2026-05-25 09:23:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2741921096075499082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7479443016102034729.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 204 cols 1124 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-25 09:23:10] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7479443016102034729.kers
Total runtime 5 ms.
[2026-05-25 09:23:10] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 09:23:10] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:23:10] [INFO ] Invariant cache hit.
[2026-05-25 09:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:23:10] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 09:23:10] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:23:10] [INFO ] Invariant cache hit.
[2026-05-25 09:23:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 17162 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47267ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 47271ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47526 ms. Remains : 204/207 places, 349/358 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((X(X(X(p0)))&&F(p1)))))'
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-12
Product exploration explored 100000 steps with 20000 reset in 297 ms.
Product exploration explored 100000 steps with 20000 reset in 343 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 207 ms. (192 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2026-05-25 09:23:58] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:23:58] [INFO ] Invariant cache hit.
[2026-05-25 09:23:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/198 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 344/542 variables, 198/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/548 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 22/548 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 2/25 constraints, State Equation: 0/204 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 612 ms.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 349/349 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2026-05-25 09:23:59] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:23:59] [INFO ] Invariant cache hit.
[2026-05-25 09:23:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:23:59] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:23:59] [INFO ] Invariant cache hit.
[2026-05-25 09:23:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:23:59] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 204/204 places, 349/349 transitions.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 17462 steps (4 resets) in 17 ms. (970 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 401 ms.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 218 ms.
Product exploration explored 100000 steps with 20000 reset in 225 ms.
Spot run failed in 46 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/ltsmin5940242636500155425
[2026-05-25 09:24:01] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5940242636500155425
Running compilation step : cd /tmp/ltsmin5940242636500155425;'/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 487 ms.
Running link step : cd /tmp/ltsmin5940242636500155425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5940242636500155425;'/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/stateBased12651451134589458710.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MultiwaySync-PT-none-LTLFireability-12 finished in 51689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Reduce places removed 1 places and 1 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 206 transition count 356
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 205 transition count 356
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 202 transition count 349
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 202 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 202 transition count 347
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 50 rules applied. Total rules applied 60 place count 177 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 176 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 176 transition count 317
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 80 place count 170 transition count 311
Applied a total of 80 rules in 21 ms. Remains 170 /207 variables (removed 37) and now considering 311/358 (removed 47) transitions.
[2026-05-25 09:24:01] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12044596152581541144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10318389722079576088.kers'
[2026-05-25 09:24:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12044596152581541144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10318389722079576088.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 306 rows 155 cols 854 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-25 09:24:01] [INFO ] Computed 25 invariants in 3 ms
Computed 25 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10318389722079576088.kers
Total runtime 4 ms.
[2026-05-25 09:24:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 09:24:01] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2026-05-25 09:24:01] [INFO ] Invariant cache hit.
[2026-05-25 09:24:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:24:02] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-25 09:24:02] [INFO ] Redundant transitions in 1 ms returned []
Running 284 sub problems to find dead transitions.
[2026-05-25 09:24:02] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2026-05-25 09:24:02] [INFO ] Invariant cache hit.
[2026-05-25 09:24:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 306/476 variables, 170/203 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 205 constraints, problems are : Problem set: 0 solved, 284 unsolved in 18539 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 1/170 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 306/476 variables, 170/204 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 284/489 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/476 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 489 constraints, problems are : Problem set: 0 solved, 284 unsolved in 20698 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39313ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 39315ms
Starting structural reductions in SI_LTL mode, iteration 1 : 170/207 places, 311/358 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39558 ms. Remains : 170/207 places, 311/358 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 38 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 283 ms.
Computed a total of 8 stabilizing places and 14 stable transitions
Computed a total of 8 stabilizing places and 14 stable transitions
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30695 steps (6 resets) in 31 ms. (959 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Knowledge-based reduction took 204 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 311/311 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2026-05-25 09:24:42] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2026-05-25 09:24:42] [INFO ] Invariant cache hit.
[2026-05-25 09:24:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:24:42] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2026-05-25 09:24:42] [INFO ] Invariant cache hit.
[2026-05-25 09:24:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:24:42] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2026-05-25 09:24:42] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 170/170 places, 311/311 transitions.
Computed a total of 8 stabilizing places and 14 stable transitions
Computed a total of 8 stabilizing places and 14 stable transitions
Knowledge based reduction with 3 factoid took 42 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35477 steps (7 resets) in 39 ms. (886 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Knowledge-based reduction took 217 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 282 ms.
Product exploration explored 100000 steps with 0 reset in 285 ms.
Built C files in :
/tmp/ltsmin16928488426019951071
[2026-05-25 09:24:43] [INFO ] Computing symmetric may disable matrix : 311 transitions.
[2026-05-25 09:24:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:43] [INFO ] Computing symmetric may enable matrix : 311 transitions.
[2026-05-25 09:24:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:43] [INFO ] Computing Do-Not-Accords matrix : 311 transitions.
[2026-05-25 09:24:43] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:43] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16928488426019951071
Running compilation step : cd /tmp/ltsmin16928488426019951071;'/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 660 ms.
Running link step : cd /tmp/ltsmin16928488426019951071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16928488426019951071;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7433122690393908908.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 311/311 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 311/311 (removed 0) transitions.
[2026-05-25 09:24:58] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2026-05-25 09:24:58] [INFO ] Invariant cache hit.
[2026-05-25 09:24:58] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:24:58] [INFO ] Flow matrix only has 306 transitions (discarded 5 similar events)
[2026-05-25 09:24:58] [INFO ] Invariant cache hit.
[2026-05-25 09:24:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:24:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2026-05-25 09:24:58] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 170/170 places, 311/311 transitions.
Built C files in :
/tmp/ltsmin4786748878161940723
[2026-05-25 09:24:58] [INFO ] Computing symmetric may disable matrix : 311 transitions.
[2026-05-25 09:24:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:58] [INFO ] Computing symmetric may enable matrix : 311 transitions.
[2026-05-25 09:24:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:58] [INFO ] Computing Do-Not-Accords matrix : 311 transitions.
[2026-05-25 09:24:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:24:58] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4786748878161940723
Running compilation step : cd /tmp/ltsmin4786748878161940723;'/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 617 ms.
Running link step : cd /tmp/ltsmin4786748878161940723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4786748878161940723;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4891170147520564580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 09:25:13] [INFO ] Flatten gal took : 13 ms
[2026-05-25 09:25:13] [INFO ] Flatten gal took : 12 ms
[2026-05-25 09:25:13] [INFO ] Time to serialize gal into /tmp/LTL1026317347044565955.gal : 2 ms
[2026-05-25 09:25:13] [INFO ] Time to serialize properties into /tmp/LTL1515188229703268559.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/LTL1026317347044565955.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14160457518237774191.hoa' '-atoms' '/tmp/LTL1515188229703268559.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1515188229703268559.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14160457518237774191.hoa
Reverse transition relation is NOT exact ! Due to transitions t31, t45, t64, t80, t94, t109, t349, t355, t111.t107, t114.t107, t96.t92, t99.t92, t82.t78, t...337
Detected timeout of ITS tools.
[2026-05-25 09:25:28] [INFO ] Flatten gal took : 16 ms
[2026-05-25 09:25:28] [INFO ] Flatten gal took : 19 ms
[2026-05-25 09:25:28] [INFO ] Time to serialize gal into /tmp/LTL8252707599181985671.gal : 2 ms
[2026-05-25 09:25:28] [INFO ] Time to serialize properties into /tmp/LTL15925527426091407935.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/LTL8252707599181985671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15925527426091407935.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p171==0)||(p220==0))"))))
Formula 0 simplified : GF!"((p171==0)||(p220==0))"
Reverse transition relation is NOT exact ! Due to transitions t31, t45, t64, t80, t94, t109, t349, t355, t111.t107, t114.t107, t96.t92, t99.t92, t82.t78, t...337
Detected timeout of ITS tools.
[2026-05-25 09:25:43] [INFO ] Flatten gal took : 14 ms
[2026-05-25 09:25:43] [INFO ] Applying decomposition
[2026-05-25 09:25:43] [INFO ] Flatten gal took : 9 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/graph15948663148569898435.txt' '-o' '/tmp/graph15948663148569898435.bin' '-w' '/tmp/graph15948663148569898435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15948663148569898435.bin' '-l' '-1' '-v' '-w' '/tmp/graph15948663148569898435.weights' '-q' '0' '-e' '0.001'
[2026-05-25 09:25:44] [INFO ] Decomposing Gal with order
[2026-05-25 09:25:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 09:25:44] [INFO ] Removed a total of 244 redundant transitions.
[2026-05-25 09:25:44] [INFO ] Flatten gal took : 28 ms
[2026-05-25 09:25:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 5 ms.
[2026-05-25 09:25:44] [INFO ] Time to serialize gal into /tmp/LTL13303036494222408903.gal : 2 ms
[2026-05-25 09:25:44] [INFO ] Time to serialize properties into /tmp/LTL16384468345247017729.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/LTL13303036494222408903.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16384468345247017729.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i5.u33.p171==0)||(i16.u50.p220==0))"))))
Formula 0 simplified : GF!"((i5.u33.p171==0)||(i16.u50.p220==0))"
Reverse transition relation is NOT exact ! Due to transitions i0.t114_t107, i0.t109, i0.u5.t111.t107, i1.t99_t92, i1.t94, i1.u8.t96.t92, i2.t80, i2.u14.t82...441
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
34 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,0.379703,31396,1,0,25251,10133,2674,43826,981,66627,36790
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MultiwaySync-PT-none-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MultiwaySync-PT-none-LTLFireability-13 finished in 102705 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(F(p0))||G(p1)))))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 354
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 205 transition count 352
Applied a total of 6 rules in 4 ms. Remains 205 /207 variables (removed 2) and now considering 352/358 (removed 6) transitions.
[2026-05-25 09:25:44] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5737566541758973548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4354578977980556851.kers'
[2026-05-25 09:25:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5737566541758973548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4354578977980556851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 347 rows 205 cols 1136 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-25 09:25:44] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4354578977980556851.kers
Total runtime 2 ms.
[2026-05-25 09:25:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 09:25:44] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2026-05-25 09:25:44] [INFO ] Invariant cache hit.
[2026-05-25 09:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:25:44] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 351 sub problems to find dead transitions.
[2026-05-25 09:25:44] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2026-05-25 09:25:44] [INFO ] Invariant cache hit.
[2026-05-25 09:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 347/552 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 0/552 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 239 constraints, problems are : Problem set: 0 solved, 351 unsolved in 17611 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 347/552 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 351/590 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 2/592 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 351 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 Int declared 552/552 variables, and 592 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47742ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 47743ms
Starting structural reductions in LTL mode, iteration 1 : 205/207 places, 352/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47988 ms. Remains : 205/207 places, 352/358 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(F(p0))||G(p1)))))'
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (AND (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 : MultiwaySync-PT-none-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 202 ms.
Product exploration explored 100000 steps with 25000 reset in 213 ms.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1867279 steps, run timeout after 3001 ms. (steps per millisecond=622 ) properties seen :0 out of 1
Probabilistic random walk after 1867279 steps, saw 1059662 distinct states, run finished after 3001 ms. (steps per millisecond=622 ) properties seen :0
[2026-05-25 09:26:36] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2026-05-25 09:26:36] [INFO ] Invariant cache hit.
[2026-05-25 09:26:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 164/199 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/546 variables, 199/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/552 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 164/199 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 347/546 variables, 199/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/552 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/552 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 506 steps, including 9 resets, run visited all 1 properties in 7 ms. (steps per millisecond=72 )
Parikh walk visited 1 properties in 15 ms.
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 3696 ms.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 205 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2026-05-25 09:26:37] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2026-05-25 09:26:37] [INFO ] Invariant cache hit.
[2026-05-25 09:26:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 09:26:37] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2026-05-25 09:26:37] [INFO ] Invariant cache hit.
[2026-05-25 09:26:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:26:37] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 205/205 places, 352/352 transitions.
Computed a total of 11 stabilizing places and 17 stable transitions
Computed a total of 11 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 49 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1829535 steps, run timeout after 3003 ms. (steps per millisecond=609 ) properties seen :0 out of 1
Probabilistic random walk after 1829535 steps, saw 1039488 distinct states, run finished after 3003 ms. (steps per millisecond=609 ) properties seen :0
[2026-05-25 09:26:40] [INFO ] Flow matrix only has 347 transitions (discarded 5 similar events)
[2026-05-25 09:26:40] [INFO ] Invariant cache hit.
[2026-05-25 09:26:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
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) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 164/199 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 347/546 variables, 199/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/552 variables, 6/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/552 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 164/199 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 347/546 variables, 199/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/552 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/552 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1088 steps, including 21 resets, run visited all 1 properties in 8 ms. (steps per millisecond=136 )
Parikh walk visited 1 properties in 7 ms.
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 3667 ms.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 209 ms.
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Spot run failed in 45 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/ltsmin1420836136778159412
[2026-05-25 09:26:41] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1420836136778159412
Running compilation step : cd /tmp/ltsmin1420836136778159412;'/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 509 ms.
Running link step : cd /tmp/ltsmin1420836136778159412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1420836136778159412;'/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/stateBased13354132985789573733.hoa' '--buchi-type=spotba'
LTSmin run took 31 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MultiwaySync-PT-none-LTLFireability-14 finished in 57871 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(p1)))'
Support contains 4 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 358/358 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 204 transition count 351
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 204 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 204 transition count 349
Applied a total of 8 rules in 7 ms. Remains 204 /207 variables (removed 3) and now considering 349/358 (removed 9) transitions.
[2026-05-25 09:26:42] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4031710093642659791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17084896375383143573.kers'
[2026-05-25 09:26:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4031710093642659791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17084896375383143573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 204 cols 1124 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-25 09:26:42] [INFO ] Computed 25 invariants in 2 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17084896375383143573.kers
Total runtime 3 ms.
[2026-05-25 09:26:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 09:26:42] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:26:42] [INFO ] Invariant cache hit.
[2026-05-25 09:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:26:42] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2026-05-25 09:26:42] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:26:42] [INFO ] Invariant cache hit.
[2026-05-25 09:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/548 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 238 constraints, problems are : Problem set: 0 solved, 348 unsolved in 17323 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 344/548 variables, 204/237 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 348/586 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 588 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 204/204 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47426ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 47427ms
Starting structural reductions in LTL mode, iteration 1 : 204/207 places, 349/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47679 ms. Remains : 204/207 places, 349/358 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(p1)))'
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : MultiwaySync-PT-none-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 256 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLFireability-15 finished in 48145 ms.
All properties solved by simple procedures.
Total runtime 759982 ms.

BK_STOP 1779701250561

--------------------
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="MultiwaySync-PT-none"
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 MultiwaySync-PT-none, 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 r194-tall-177969913800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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