fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r194-tall-177969913800003
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for MultiwaySync-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
639.252 257206.00 312564.00 699.10 FTTFFFFTTTFFFFFF normal

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-177969913800003.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969913800003
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-01
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-02
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-03
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-04
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-05
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-06
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-07
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-08
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-09
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-10
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-11
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-12
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-13
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-14
FORMULA_NAME MultiwaySync-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779700489105

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-25 09:14:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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): 83 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 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.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.
Initial state reduction rules removed 1 formulas.
FORMULA MultiwaySync-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiwaySync-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 206 transition count 358
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 206 transition count 358
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 206 transition count 355
Applied a total of 40 rules in 54 ms. Remains 206 /222 variables (removed 16) and now considering 355/389 (removed 34) transitions.
[2026-05-25 09:14:50] [INFO ] Flow matrix only has 350 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-6592731764007798389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6536726018772101598.kers'
[2026-05-25 09:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6592731764007798389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6536726018772101598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 350 rows 206 cols 1148 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-25 09:14:50] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6536726018772101598.kers
Total runtime 3 ms.
[2026-05-25 09:14:50] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-25 09:14:50] [INFO ] Flow matrix only has 350 transitions (discarded 5 similar events)
[2026-05-25 09:14:50] [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 220 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2026-05-25 09:14:51] [INFO ] Flow matrix only has 350 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/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 350/556 variables, 206/239 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 354 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 241 constraints, problems are : Problem set: 0 solved, 354 unsolved in 21795 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (OVERLAPS) 350/556 variables, 206/240 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 354/595 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 596 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52127ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 52142ms
Starting structural reductions in LTL mode, iteration 1 : 206/222 places, 355/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52746 ms. Remains : 206/222 places, 355/389 transitions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 355/355 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 355/355 (removed 0) transitions.
[2026-05-25 09:15:43] [INFO ] Flow matrix only has 350 transitions (discarded 5 similar events)
[2026-05-25 09:15:43] [INFO ] Invariant cache hit.
[2026-05-25 09:15:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 09:15:43] [INFO ] Flow matrix only has 350 transitions (discarded 5 similar events)
[2026-05-25 09:15:43] [INFO ] Invariant cache hit.
[2026-05-25 09:15:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:15:43] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 206/206 places, 355/355 transitions.
Support contains 28 out of 206 places after structural reductions.
[2026-05-25 09:15:43] [INFO ] Flatten gal took : 49 ms
[2026-05-25 09:15:43] [INFO ] Flatten gal took : 25 ms
[2026-05-25 09:15:44] [INFO ] Input system was already deterministic with 355 transitions.
RANDOM walk for 40000 steps (8 resets) in 1521 ms. (26 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2026-05-25 09:15:44] [INFO ] Flow matrix only has 350 transitions (discarded 5 similar events)
[2026-05-25 09:15:44] [INFO ] Invariant cache hit.
[2026-05-25 09:15:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 170/200 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 350/550 variables, 200/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/556 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 233 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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) 28/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 170/200 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 350/550 variables, 200/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/556 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/556 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 206/206 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 355/355 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 353
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 204 transition count 353
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 562 edges and 204 vertex of which 68 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.1 ms
Discarding 136 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 68 transition count 219
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 113 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 123 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 125 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 143 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 143 place count 60 transition count 97
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 58 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 56 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 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 151 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 155 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 157 place count 54 transition count 91
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 3 with 12 rules applied. Total rules applied 169 place count 48 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 173 place count 48 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 181 place count 44 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 183 place count 42 transition count 64
Iterating global reduction 4 with 2 rules applied. Total rules applied 185 place count 42 transition count 64
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 187 place count 42 transition count 62
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 42 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 40 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 40 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 193 place count 39 transition count 59
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 18 edges and 38 vertex of which 8 / 38 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
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 5 with 4 rules applied. Total rules applied 197 place count 32 transition count 57
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 211 place count 30 transition count 45
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 213 place count 28 transition count 32
Iterating global reduction 7 with 2 rules applied. Total rules applied 215 place count 28 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 217 place count 28 transition count 30
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 219 place count 28 transition count 28
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 23 edges and 24 vertex of which 12 / 24 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 8 with 11 rules applied. Total rules applied 230 place count 15 transition count 22
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 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 9 with 20 rules applied. Total rules applied 250 place count 9 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 252 place count 7 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 252 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 256 place count 5 transition count 6
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 11 with 2 rules applied. Total rules applied 258 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 259 place count 4 transition count 4
Applied a total of 259 rules in 77 ms. Remains 4 /206 variables (removed 202) and now considering 4/355 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 4/206 places, 4/355 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
FORMULA MultiwaySync-PT-none-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 355/355 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 353
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 204 transition count 353
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 202 transition count 349
Iterating global reduction 0 with 2 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 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 58 place count 178 transition count 323
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
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 174 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 1 with 95 rules applied. Total rules applied 161 place count 174 transition count 256
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 161 place count 174 transition count 237
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 1 with 38 rules applied. Total rules applied 199 place count 155 transition count 237
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 214 place count 140 transition count 222
Iterating global reduction 1 with 15 rules applied. Total rules applied 229 place count 140 transition count 222
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 229 place count 140 transition count 219
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 235 place count 137 transition count 219
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
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 275 place count 117 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 281 place count 111 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 287 place count 111 transition count 187
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 293 place count 111 transition count 181
Applied a total of 293 rules in 61 ms. Remains 111 /206 variables (removed 95) and now considering 181/355 (removed 174) transitions.
[2026-05-25 09:15:45] [INFO ] Flow matrix only has 164 transitions (discarded 17 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2958099198327648810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8974811612181572203.kers'
[2026-05-25 09:15:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2958099198327648810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8974811612181572203.kers]
Normalized transition count is 163 out of 164 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 163 rows 109 cols 530 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 09:15:45] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8974811612181572203.kers
Total runtime 1 ms.
[2026-05-25 09:15:45] [INFO ] Implicit Places using invariants in 59 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/206 places, 181/355 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 110 transition count 164
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 18 place count 110 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 109 transition count 163
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 39 place count 99 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 45 place count 93 transition count 133
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 93 transition count 133
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 57 place count 90 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 90 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 63 place count 89 transition count 159
Applied a total of 63 rules in 20 ms. Remains 89 /110 variables (removed 21) and now considering 159/181 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17235423708818358006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7627526789775103139.kers'
[2026-05-25 09:15:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17235423708818358006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7627526789775103139.kers]
Normalized transition count is 158 out of 159 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 158 rows 88 cols 638 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 09:15:45] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7627526789775103139.kers
Total runtime 1 ms.
[2026-05-25 09:15:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 09:15:45] [INFO ] Invariant cache hit.
[2026-05-25 09:15:45] [INFO ] State equation strengthened by 50 read => feed constraints.
[2026-05-25 09:15:46] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/206 places, 159/355 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 89/206 places, 159/355 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 221 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-00 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 355/355 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 354
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 354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 203 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 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 8 place count 203 transition count 348
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 44 rules applied. Total rules applied 52 place count 181 transition count 326
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
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 60 place count 177 transition count 354
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 93 place count 177 transition count 321
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 174 transition count 318
Applied a total of 99 rules in 65 ms. Remains 174 /206 variables (removed 32) and now considering 318/355 (removed 37) transitions.
[2026-05-25 09:15:46] [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-12574774982835782123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6025303539129549359.kers'
[2026-05-25 09:15:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12574774982835782123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6025303539129549359.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 174 cols 1146 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-25 09:15:46] [INFO ] Computed 25 invariants in 5 ms
Computed 25 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6025303539129549359.kers
Total runtime 6 ms.
[2026-05-25 09:15:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-25 09:15:46] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2026-05-25 09:15:46] [INFO ] Invariant cache hit.
[2026-05-25 09:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:15:46] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2026-05-25 09:15:46] [INFO ] Redundant transitions in 14 ms returned []
Running 314 sub problems to find dead transitions.
[2026-05-25 09:15:46] [INFO ] Flow matrix only has 313 transitions (discarded 5 similar events)
[2026-05-25 09:15:46] [INFO ] Invariant cache hit.
[2026-05-25 09:15:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 313/487 variables, 174/207 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 209 constraints, problems are : Problem set: 0 solved, 314 unsolved in 19180 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 174/174 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 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/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 313/487 variables, 174/208 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 314/523 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 523 constraints, problems are : Problem set: 0 solved, 314 unsolved in 24835 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 174/174 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44179ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 44181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 174/206 places, 318/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44551 ms. Remains : 174/206 places, 318/355 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)||p1)))'
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Computed a total of 9 stabilizing places and 18 stable transitions
Computed a total of 9 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 15 ms. Proved property starting from automaton with 1 states, 2 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 32 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiwaySync-PT-none-LTLCardinality-02 finished in 45207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p1)||p0))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 355/355 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 205 transition count 354
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 205 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 205 transition count 353
Applied a total of 3 rules in 5 ms. Remains 205 /206 variables (removed 1) and now considering 353/355 (removed 2) transitions.
[2026-05-25 09:16:31] [INFO ] Flow matrix only has 348 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-14685292811629542366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13874282584564815416.kers'
[2026-05-25 09:16:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14685292811629542366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13874282584564815416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 348 rows 205 cols 1140 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-25 09:16:31] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13874282584564815416.kers
Total runtime 2 ms.
[2026-05-25 09:16:31] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-25 09:16:31] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2026-05-25 09:16:31] [INFO ] Invariant cache hit.
[2026-05-25 09:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:16:31] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2026-05-25 09:16:31] [INFO ] Flow matrix only has 348 transitions (discarded 5 similar events)
[2026-05-25 09:16:31] [INFO ] Invariant cache hit.
[2026-05-25 09:16:31] [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, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/238 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 240 constraints, problems are : Problem set: 0 solved, 352 unsolved in 17845 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 348/553 variables, 205/239 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 352/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 592 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 205/205 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47961ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 47964ms
Starting structural reductions in LTL mode, iteration 1 : 205/206 places, 353/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48262 ms. Remains : 205/206 places, 353/355 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((G(p1)||p0))))))'
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1699 steps with 339 reset in 12 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-04 finished in 48561 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 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 355/355 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 205 transition count 352
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 202 transition count 352
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 208 edges and 202 vertex of which 109 / 202 are part of one of the 32 SCC in 0 ms
Free SCC test removed 77 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 125 transition count 272
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 1 with 147 rules applied. Total rules applied 233 place count 93 transition count 157
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 246 place count 80 transition count 130
Iterating global reduction 2 with 13 rules applied. Total rules applied 259 place count 80 transition count 130
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 80 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 266 place count 74 transition count 110
Iterating global reduction 3 with 6 rules applied. Total rules applied 272 place count 74 transition count 110
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 74 transition count 104
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 63 transition count 93
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 62 transition count 93
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 62 transition count 81
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 56 transition count 75
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 332 place count 50 transition count 55
Iterating global reduction 4 with 6 rules applied. Total rules applied 338 place count 50 transition count 55
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 50 transition count 49
Applied a total of 344 rules in 20 ms. Remains 50 /206 variables (removed 156) and now considering 49/355 (removed 306) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3549162161181731449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2105584569293419594.kers'
[2026-05-25 09:17:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3549162161181731449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2105584569293419594.kers]
Normalized transition count is 48 out of 49 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 48 rows 44 cols 108 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-25 09:17:20] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2105584569293419594.kers
Total runtime 6 ms.
[2026-05-25 09:17:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 09:17:20] [INFO ] Invariant cache hit.
[2026-05-25 09:17:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-25 09:17:20] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2026-05-25 09:17:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 2/98 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/99 variables, and 60 constraints, problems are : Problem set: 0 solved, 36 unsolved in 715 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 48/96 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 36/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 2/98 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/99 variables, and 96 constraints, problems are : Problem set: 0 solved, 36 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1536ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/206 places, 49/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1653 ms. Remains : 50/206 places, 49/355 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 26 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-06
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-06 finished in 1700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X((F(p3)&&p2)))))||p0)))'
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 355/355 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 205 transition count 352
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 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 3 place count 205 transition count 351
Applied a total of 3 rules in 8 ms. Remains 205 /206 variables (removed 1) and now considering 351/355 (removed 4) transitions.
[2026-05-25 09:17:21] [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-4755434644399828921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14399124776643927812.kers'
[2026-05-25 09:17:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4755434644399828921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14399124776643927812.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:21] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14399124776643927812.kers
Total runtime 1 ms.
[2026-05-25 09:17:21] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 09:17:21] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2026-05-25 09:17:21] [INFO ] Invariant cache hit.
[2026-05-25 09:17:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:17:22] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2026-05-25 09:17:22] [INFO ] Flow matrix only has 346 transitions (discarded 5 similar events)
[2026-05-25 09:17:22] [INFO ] Invariant cache hit.
[2026-05-25 09:17:22] [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 20282 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 30017 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 50388ms problems are : Problem set: 0 solved, 350 unsolved
Search for dead transitions found 0 dead transitions in 50389ms
Starting structural reductions in LTL mode, iteration 1 : 205/206 places, 351/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50643 ms. Remains : 205/206 places, 351/355 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1||X(X((F(p3)&&p2)))))||p0)))'
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 215 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 50 ms. Proved property starting from automaton with 7 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 55 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiwaySync-PT-none-LTLCardinality-07 finished in 51414 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 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 355/355 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 205 transition count 352
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 202 transition count 352
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 199 edges and 202 vertex of which 105 / 202 are part of one of the 32 SCC in 0 ms
Free SCC test removed 73 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 129 transition count 273
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 140 rules applied. Total rules applied 225 place count 98 transition count 164
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 228 place count 96 transition count 163
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 241 place count 83 transition count 136
Iterating global reduction 3 with 13 rules applied. Total rules applied 254 place count 83 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 83 transition count 135
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 261 place count 77 transition count 116
Iterating global reduction 4 with 6 rules applied. Total rules applied 267 place count 77 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 271 place count 77 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 5 with 22 rules applied. Total rules applied 293 place count 66 transition count 101
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 5 with 2 rules applied. Total rules applied 295 place count 65 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 309 place count 65 transition count 87
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 5 with 12 rules applied. Total rules applied 321 place count 59 transition count 81
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 327 place count 53 transition count 61
Iterating global reduction 5 with 6 rules applied. Total rules applied 333 place count 53 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 339 place count 53 transition count 55
Applied a total of 339 rules in 18 ms. Remains 53 /206 variables (removed 153) and now considering 55/355 (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-17796513492991136759.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-914590159081639533.kers'
[2026-05-25 09:18:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17796513492991136759.kers, --Pflows, --basisKERS=/tmp/petrispot-output-914590159081639533.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 54 rows 49 cols 135 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 09:18:13] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-914590159081639533.kers
Total runtime 5 ms.
[2026-05-25 09:18:13] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 09:18:13] [INFO ] Invariant cache hit.
[2026-05-25 09:18:13] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2026-05-25 09:18:13] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2026-05-25 09:18:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 5/51 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 54/105 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 2/107 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/108 variables, and 63 constraints, problems are : Problem set: 0 solved, 40 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 5/51 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 54/105 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 2/107 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/107 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/108 variables, and 103 constraints, problems are : Problem set: 0 solved, 40 unsolved in 968 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1820ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/206 places, 55/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1960 ms. Remains : 53/206 places, 55/355 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-10 finished in 2063 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 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 355/355 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 205 transition count 352
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 202 transition count 352
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 204 edges and 202 vertex of which 105 / 202 are part of one of the 31 SCC in 0 ms
Free SCC test removed 74 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 272
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 227 place count 97 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 227 place count 97 transition count 161
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 229 place count 96 transition count 161
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 242 place count 83 transition count 134
Iterating global reduction 2 with 13 rules applied. Total rules applied 255 place count 83 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 256 place count 83 transition count 133
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 262 place count 77 transition count 114
Iterating global reduction 3 with 6 rules applied. Total rules applied 268 place count 77 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 274 place count 77 transition count 108
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 296 place count 66 transition count 97
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 298 place count 65 transition count 97
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 310 place count 65 transition count 85
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 322 place count 59 transition count 79
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 328 place count 53 transition count 59
Iterating global reduction 4 with 6 rules applied. Total rules applied 334 place count 53 transition count 59
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 340 place count 53 transition count 53
Applied a total of 340 rules in 21 ms. Remains 53 /206 variables (removed 153) and now considering 53/355 (removed 302) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7933589795009371838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6831043044486422264.kers'
[2026-05-25 09:18:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7933589795009371838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6831043044486422264.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 52 rows 47 cols 117 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 09:18:15] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6831043044486422264.kers
Total runtime 0 ms.
[2026-05-25 09:18:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 09:18:15] [INFO ] Invariant cache hit.
[2026-05-25 09:18:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2026-05-25 09:18:15] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2026-05-25 09:18:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 6/51 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 52/103 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 2/105 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 64 constraints, problems are : Problem set: 0 solved, 38 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 6/51 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 52/103 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 2/105 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/105 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 102 constraints, problems are : Problem set: 0 solved, 38 unsolved in 893 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1634ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1634ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/206 places, 53/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1756 ms. Remains : 53/206 places, 53/355 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 42 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-11
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-11 finished in 1821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X(G(p1))&&G(p2))))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 355/355 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 204 transition count 351
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 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 6 place count 204 transition count 349
Applied a total of 6 rules in 6 ms. Remains 204 /206 variables (removed 2) and now considering 349/355 (removed 6) transitions.
[2026-05-25 09:18:17] [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-2786456308769138708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15125066658790924193.kers'
[2026-05-25 09:18:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2786456308769138708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15125066658790924193.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:17] [INFO ] Computed 25 invariants in 1 ms
Computed 25 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15125066658790924193.kers
Total runtime 2 ms.
[2026-05-25 09:18:17] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 09:18:17] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:18:17] [INFO ] Invariant cache hit.
[2026-05-25 09:18:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 09:18:17] [INFO ] Implicit Places using invariants and state equation in 143 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:18:17] [INFO ] Flow matrix only has 344 transitions (discarded 5 similar events)
[2026-05-25 09:18:17] [INFO ] Invariant cache hit.
[2026-05-25 09:18:17] [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 16632 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 30011 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 46717ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 46717ms
Starting structural reductions in LTL mode, iteration 1 : 204/206 places, 349/355 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46954 ms. Remains : 204/206 places, 349/355 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X(G(p1))&&G(p2))))))'
Stuttering acceptance computed with spot in 123 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 268 ms.
Entered a terminal (fully accepting) state of product in 263 steps with 0 reset in 1 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-13 finished in 47373 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 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 355/355 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 205 transition count 352
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 202 transition count 352
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (trivial) has 206 edges and 202 vertex of which 109 / 202 are part of one of the 32 SCC in 0 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 125 transition count 273
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 94 transition count 158
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 244 place count 81 transition count 131
Iterating global reduction 2 with 13 rules applied. Total rules applied 257 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 258 place count 81 transition count 130
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 264 place count 75 transition count 111
Iterating global reduction 3 with 6 rules applied. Total rules applied 270 place count 75 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 276 place count 75 transition count 105
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 298 place count 64 transition count 94
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 300 place count 63 transition count 94
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 312 place count 63 transition count 82
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 324 place count 57 transition count 76
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 330 place count 51 transition count 56
Iterating global reduction 4 with 6 rules applied. Total rules applied 336 place count 51 transition count 56
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 341 place count 51 transition count 51
Applied a total of 341 rules in 19 ms. Remains 51 /206 variables (removed 155) and now considering 51/355 (removed 304) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13022872303354171061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4520322209210868157.kers'
[2026-05-25 09:19:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13022872303354171061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4520322209210868157.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 50 rows 46 cols 120 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 09:19:04] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4520322209210868157.kers
Total runtime 0 ms.
[2026-05-25 09:19:04] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 09:19:04] [INFO ] Invariant cache hit.
[2026-05-25 09:19:04] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2026-05-25 09:19:04] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2026-05-25 09:19:04] [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) 5/49 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 50/99 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 2/101 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/102 variables, and 61 constraints, problems are : Problem set: 0 solved, 37 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 51/51 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) 5/49 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 50/99 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 37/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 2/101 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/102 variables, and 98 constraints, problems are : Problem set: 0 solved, 37 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1539ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 1539ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/206 places, 51/355 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1739 ms. Remains : 51/206 places, 51/355 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 45 ms :[(NOT p0)]
Running random walk in product with property : MultiwaySync-PT-none-LTLCardinality-14
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MultiwaySync-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiwaySync-PT-none-LTLCardinality-14 finished in 1821 ms.
All properties solved by simple procedures.
Total runtime 255982 ms.

BK_STOP 1779700746311

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-177969913800003"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;