About the Execution of ITS-Tools for DLCshifumi-PT-2b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1042.283 | 694867.00 | 865820.00 | 29607.10 | FFFTFTFFFFFFFFFF | 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.r098-tall-177955695700692.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 DLCshifumi-PT-2b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695700692
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 6 18:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 18:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 09:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 6 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 6 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 729K 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 DLCshifumi-PT-2b-LTLFireability-00
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-01
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-02
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-03
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-04
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-05
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-06
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-07
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-08
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-09
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-10
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-11
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-12
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-13
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-14
FORMULA_NAME DLCshifumi-PT-2b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779653062998
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 20:04:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 20:04:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 20:04:24] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2026-05-24 20:04:24] [INFO ] Transformed 2483 places.
[2026-05-24 20:04:24] [INFO ] Transformed 3183 transitions.
[2026-05-24 20:04:24] [INFO ] Found NUPN structural information;
[2026-05-24 20:04:24] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DLCshifumi-PT-2b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCshifumi-PT-2b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Discarding 385 places :
Symmetric choice reduction at 0 with 385 rule applications. Total rules 385 place count 2098 transition count 2798
Iterating global reduction 0 with 385 rules applied. Total rules applied 770 place count 2098 transition count 2798
Discarding 305 places :
Symmetric choice reduction at 0 with 305 rule applications. Total rules 1075 place count 1793 transition count 2493
Iterating global reduction 0 with 305 rules applied. Total rules applied 1380 place count 1793 transition count 2493
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 1382 place count 1793 transition count 2491
Discarding 107 places :
Symmetric choice reduction at 1 with 107 rule applications. Total rules 1489 place count 1686 transition count 2370
Iterating global reduction 1 with 107 rules applied. Total rules applied 1596 place count 1686 transition count 2370
Discarding 99 places :
Symmetric choice reduction at 1 with 99 rule applications. Total rules 1695 place count 1587 transition count 2271
Iterating global reduction 1 with 99 rules applied. Total rules applied 1794 place count 1587 transition count 2271
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1807 place count 1587 transition count 2258
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 1849 place count 1545 transition count 2216
Iterating global reduction 2 with 42 rules applied. Total rules applied 1891 place count 1545 transition count 2216
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 1931 place count 1505 transition count 2176
Iterating global reduction 2 with 40 rules applied. Total rules applied 1971 place count 1505 transition count 2176
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 2011 place count 1465 transition count 2136
Iterating global reduction 2 with 40 rules applied. Total rules applied 2051 place count 1465 transition count 2136
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 2090 place count 1426 transition count 2097
Iterating global reduction 2 with 39 rules applied. Total rules applied 2129 place count 1426 transition count 2097
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 2155 place count 1400 transition count 2071
Iterating global reduction 2 with 26 rules applied. Total rules applied 2181 place count 1400 transition count 2071
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 2206 place count 1375 transition count 2046
Iterating global reduction 2 with 25 rules applied. Total rules applied 2231 place count 1375 transition count 2046
Applied a total of 2231 rules in 1222 ms. Remains 1375 /2483 variables (removed 1108) and now considering 2046/3183 (removed 1137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12588550281087748141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-210668686438872202.kers'
[2026-05-24 20:04:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12588550281087748141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-210668686438872202.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2046 rows 1375 cols 5482 entries
Finished phase 1 with 1296 SingleSign rule and 0 generalized
[2026-05-24 20:04:26] [INFO ] Computed 79 invariants in 8 ms
Computed 79 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-210668686438872202.kers
Total runtime 11 ms.
[2026-05-24 20:04:27] [INFO ] Implicit Places using invariants in 653 ms returned []
[2026-05-24 20:04:27] [INFO ] Invariant cache hit.
[2026-05-24 20:04:28] [INFO ] Implicit Places using invariants and state equation in 1120 ms returned []
Implicit Place search using SMT with State Equation took 1812 ms to find 0 implicit places.
Running 2045 sub problems to find dead transitions.
[2026-05-24 20:04:31] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1374/3421 variables, and 0 constraints, problems are : Problem set: 0 solved, 2045 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 2045/2045 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2045 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1374/3421 variables, and 0 constraints, problems are : Problem set: 0 solved, 2045 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1375 constraints, PredecessorRefiner: 0/2045 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60751ms problems are : Problem set: 0 solved, 2045 unsolved
Search for dead transitions found 0 dead transitions in 60775ms
Starting structural reductions in LTL mode, iteration 1 : 1375/2483 places, 2046/3183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67566 ms. Remains : 1375/2483 places, 2046/3183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Applied a total of 0 rules in 33 ms. Remains 1375 /1375 variables (removed 0) and now considering 2046/2046 (removed 0) transitions.
[2026-05-24 20:05:32] [INFO ] Invariant cache hit.
[2026-05-24 20:05:33] [INFO ] Implicit Places using invariants in 416 ms returned []
[2026-05-24 20:05:33] [INFO ] Invariant cache hit.
[2026-05-24 20:05:34] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1495 ms. Remains : 1375/1375 places, 2046/2046 transitions.
Support contains 48 out of 1375 places after structural reductions.
[2026-05-24 20:05:34] [INFO ] Flatten gal took : 139 ms
[2026-05-24 20:05:34] [INFO ] Flatten gal took : 81 ms
[2026-05-24 20:05:34] [INFO ] Input system was already deterministic with 2046 transitions.
RANDOM walk for 40000 steps (8 resets) in 1712 ms. (23 steps per ms) remains 4/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
[2026-05-24 20:05:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 441/450 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 925/1375 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1375 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2046/3421 variables, 1375/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 0/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3421 variables, 0/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3421/3421 variables, and 1454 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1375/1375 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 441/450 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 925/1375 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1375 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2046/3421 variables, 1375/1454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3421 variables, 4/1458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3421 variables, 0/1458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3421 variables, 0/1458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3421/3421 variables, and 1458 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2243 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1375/1375 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3368ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 366 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=122 )
Parikh walk visited 4 properties in 529 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DLCshifumi-PT-2b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DLCshifumi-PT-2b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 152 stabilizing places and 152 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1355 transition count 1995
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1355 transition count 1995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1355 transition count 1994
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 1344 transition count 1983
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 1344 transition count 1983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 1344 transition count 1982
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 1337 transition count 1975
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 1337 transition count 1975
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 1332 transition count 1970
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 1332 transition count 1970
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 1327 transition count 1965
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 1327 transition count 1965
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 1322 transition count 1960
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 1322 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 1317 transition count 1955
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 1317 transition count 1955
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 1315 transition count 1953
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 1315 transition count 1953
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 1313 transition count 1951
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 1313 transition count 1951
Applied a total of 126 rules in 405 ms. Remains 1313 /1375 variables (removed 62) and now considering 1951/2046 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2355522431854768595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8705549599834353385.kers'
[2026-05-24 20:05:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2355522431854768595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8705549599834353385.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1951 rows 1313 cols 5228 entries
Finished phase 1 with 1234 SingleSign rule and 0 generalized
[2026-05-24 20:05:40] [INFO ] Computed 79 invariants in 18 ms
Computed 79 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-8705549599834353385.kers
Total runtime 21 ms.
[2026-05-24 20:05:40] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-05-24 20:05:40] [INFO ] Invariant cache hit.
[2026-05-24 20:05:41] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Running 1950 sub problems to find dead transitions.
[2026-05-24 20:05:41] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 1950/1950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1950 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1312/3264 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1313 constraints, PredecessorRefiner: 0/1950 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60576ms problems are : Problem set: 0 solved, 1950 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Starting structural reductions in LTL mode, iteration 1 : 1313/1375 places, 1951/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62319 ms. Remains : 1313/1375 places, 1951/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-00 finished in 62697 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)&&F(G(p1)))))'
Support contains 2 out of 1375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Graph (trivial) has 1307 edges and 1375 vertex of which 326 / 1375 are part of one of the 23 SCC in 11 ms
Free SCC test removed 303 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 317 place count 1071 transition count 1390
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 371 rules applied. Total rules applied 688 place count 755 transition count 1335
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 724 place count 719 transition count 1335
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 724 place count 719 transition count 1227
Deduced a syphon composed of 108 places in 2 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 940 place count 611 transition count 1227
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 990 place count 561 transition count 1042
Iterating global reduction 3 with 50 rules applied. Total rules applied 1040 place count 561 transition count 1042
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1055 place count 561 transition count 1027
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1055 place count 561 transition count 1024
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1061 place count 558 transition count 1024
Performed 192 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 4 with 384 rules applied. Total rules applied 1445 place count 366 transition count 830
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1447 place count 366 transition count 828
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1466 place count 347 transition count 720
Iterating global reduction 5 with 19 rules applied. Total rules applied 1485 place count 347 transition count 720
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1503 place count 347 transition count 702
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1505 place count 346 transition count 701
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1506 place count 345 transition count 685
Iterating global reduction 6 with 1 rules applied. Total rules applied 1507 place count 345 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1508 place count 345 transition count 684
Performed 48 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 1604 place count 297 transition count 751
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1605 place count 297 transition count 750
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1620 place count 282 transition count 684
Iterating global reduction 8 with 15 rules applied. Total rules applied 1635 place count 282 transition count 684
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1665 place count 282 transition count 654
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 9 with 15 rules applied. Total rules applied 1680 place count 282 transition count 639
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1684 place count 278 transition count 631
Iterating global reduction 9 with 4 rules applied. Total rules applied 1688 place count 278 transition count 631
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1692 place count 274 transition count 565
Iterating global reduction 9 with 4 rules applied. Total rules applied 1696 place count 274 transition count 565
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1700 place count 274 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1701 place count 273 transition count 560
Applied a total of 1701 rules in 284 ms. Remains 273 /1375 variables (removed 1102) and now considering 560/2046 (removed 1486) transitions.
[2026-05-24 20:06:42] [INFO ] Flow matrix only has 537 transitions (discarded 23 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10134814630980409406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10511597153245310252.kers'
[2026-05-24 20:06:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10134814630980409406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10511597153245310252.kers]
Normalized transition count is 536 out of 537 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 536 rows 273 cols 2530 entries
Finished phase 1 with 194 SingleSign rule and 0 generalized
[2026-05-24 20:06:42] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10511597153245310252.kers
Total runtime 3 ms.
[2026-05-24 20:06:42] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 20:06:42] [INFO ] Flow matrix only has 537 transitions (discarded 23 similar events)
[2026-05-24 20:06:42] [INFO ] Invariant cache hit.
[2026-05-24 20:06:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 20:06:43] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2026-05-24 20:06:43] [INFO ] Redundant transitions in 31 ms returned []
Running 475 sub problems to find dead transitions.
[2026-05-24 20:06:43] [INFO ] Flow matrix only has 537 transitions (discarded 23 similar events)
[2026-05-24 20:06:43] [INFO ] Invariant cache hit.
[2026-05-24 20:06:43] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (OVERLAPS) 536/809 variables, 273/352 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 42/394 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/810 variables, and 394 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 273/273 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 475 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 4 (OVERLAPS) 536/809 variables, 273/352 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 42/394 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/809 variables, 475/869 constraints. Problems are: Problem set: 0 solved, 475 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/809 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 475 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/810 variables, and 870 constraints, problems are : Problem set: 0 solved, 475 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 273/273 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 475/475 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 475 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 273/1375 places, 560/2046 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60857 ms. Remains : 273/1375 places, 560/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-01 finished in 61017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(X(X(p1)) U G(p2))) U !p1))'
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1354 transition count 1994
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1354 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1354 transition count 1993
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 1344 transition count 1983
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 1344 transition count 1983
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 1344 transition count 1982
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 1338 transition count 1976
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 1338 transition count 1976
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 1333 transition count 1971
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 1333 transition count 1971
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 1328 transition count 1966
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 1328 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 1323 transition count 1961
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 1323 transition count 1961
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 1318 transition count 1956
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 1316 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 1314 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 1314 transition count 1952
Applied a total of 124 rules in 347 ms. Remains 1314 /1375 variables (removed 61) and now considering 1952/2046 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12787821301306630052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8329902789164056695.kers'
[2026-05-24 20:07:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12787821301306630052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8329902789164056695.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1952 rows 1314 cols 5230 entries
Finished phase 1 with 1235 SingleSign rule and 0 generalized
[2026-05-24 20:07:43] [INFO ] Computed 79 invariants in 7 ms
Computed 79 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8329902789164056695.kers
Total runtime 11 ms.
[2026-05-24 20:07:44] [INFO ] Implicit Places using invariants in 533 ms returned []
[2026-05-24 20:07:44] [INFO ] Invariant cache hit.
[2026-05-24 20:07:45] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1443 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2026-05-24 20:07:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1313/3266 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1314 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Starting structural reductions in LTL mode, iteration 1 : 1314/1375 places, 1952/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62253 ms. Remains : 1314/1375 places, 1952/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(X(X(p1)) U G(p2))) U !p1))'
Stuttering acceptance computed with spot in 301 ms :[p1, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-04
Product exploration explored 100000 steps with 22228 reset in 333 ms.
Product exploration explored 100000 steps with 22265 reset in 287 ms.
Computed a total of 142 stabilizing places and 142 stable transitions
Computed a total of 142 stabilizing places and 142 stable transitions
Knowledge based reduction with 15 factoid took 76 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 367 ms. (108 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
[2026-05-24 20:08:47] [INFO ] Invariant cache hit.
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) 105/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1207/1314 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1314 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1952/3266 variables, 1314/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3266 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3266 variables, 0/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3266/3266 variables, and 1394 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 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) 105/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1207/1314 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1314 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1314 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1952/3266 variables, 1314/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3266 variables, 1/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3266 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3266 variables, 0/1395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3266/3266 variables, and 1395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 1314/1314 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1770ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 9220 steps, including 22 resets, run visited all 1 properties in 28 ms. (steps per millisecond=329 )
Parikh walk visited 1 properties in 28 ms.
Negative knowledge disproves property using: (G (OR p1 p2))
Knowledge based reduction with 15 factoid took 115 ms. Proved property starting from automaton with 8 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 2244 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-04 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property DLCshifumi-PT-2b-LTLFireability-04 finished in 65489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&(p2||G(p3)))))'
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1354 transition count 1994
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1354 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1354 transition count 1993
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 1343 transition count 1982
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 1343 transition count 1982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1343 transition count 1981
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 1336 transition count 1974
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 1336 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 1331 transition count 1969
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 1331 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 1326 transition count 1964
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 1326 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 1321 transition count 1959
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 1321 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 1316 transition count 1954
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 1314 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 1312 transition count 1950
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 1312 transition count 1950
Applied a total of 128 rules in 314 ms. Remains 1312 /1375 variables (removed 63) and now considering 1950/2046 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1263188812244496083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17884565948691495193.kers'
[2026-05-24 20:08:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1263188812244496083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17884565948691495193.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1950 rows 1312 cols 5226 entries
Finished phase 1 with 1233 SingleSign rule and 0 generalized
[2026-05-24 20:08:49] [INFO ] Computed 79 invariants in 16 ms
Computed 79 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-17884565948691495193.kers
Total runtime 20 ms.
[2026-05-24 20:08:49] [INFO ] Implicit Places using invariants in 386 ms returned []
[2026-05-24 20:08:49] [INFO ] Invariant cache hit.
[2026-05-24 20:08:50] [INFO ] Implicit Places using invariants and state equation in 881 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2026-05-24 20:08:50] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60465ms
Starting structural reductions in LTL mode, iteration 1 : 1312/1375 places, 1950/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62057 ms. Remains : 1312/1375 places, 1950/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U p1)&&(p2||G(p3)))))'
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-06
Stuttering criterion allowed to conclude after 2852 steps with 0 reset in 10 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-06 finished in 62355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0)) U X((p2 U p3))))'
Support contains 5 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1357 transition count 1997
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1357 transition count 1997
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 1357 transition count 1996
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 1348 transition count 1987
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 1348 transition count 1987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 1348 transition count 1986
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 1342 transition count 1980
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 1342 transition count 1980
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 1338 transition count 1976
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 1338 transition count 1976
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 1334 transition count 1972
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 1334 transition count 1972
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 1330 transition count 1968
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 1330 transition count 1968
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 1326 transition count 1964
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 1326 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 1325 transition count 1963
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 1325 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 1324 transition count 1962
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 1324 transition count 1962
Applied a total of 104 rules in 302 ms. Remains 1324 /1375 variables (removed 51) and now considering 1962/2046 (removed 84) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-289034394759220213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6515413631440881966.kers'
[2026-05-24 20:09:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-289034394759220213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6515413631440881966.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 1962 rows 1324 cols 5250 entries
Finished phase 1 with 1245 SingleSign rule and 0 generalized
[2026-05-24 20:09:51] [INFO ] Computed 79 invariants in 18 ms
Computed 79 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-6515413631440881966.kers
Total runtime 23 ms.
[2026-05-24 20:09:52] [INFO ] Implicit Places using invariants in 454 ms returned []
[2026-05-24 20:09:52] [INFO ] Invariant cache hit.
[2026-05-24 20:09:53] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1961 sub problems to find dead transitions.
[2026-05-24 20:09:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/3286 variables, and 0 constraints, problems are : Problem set: 0 solved, 1961 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1324 constraints, PredecessorRefiner: 1961/1961 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/3286 variables, and 0 constraints, problems are : Problem set: 0 solved, 1961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1324 constraints, PredecessorRefiner: 0/1961 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60495ms problems are : Problem set: 0 solved, 1961 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Starting structural reductions in LTL mode, iteration 1 : 1324/1375 places, 1962/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62287 ms. Remains : 1324/1375 places, 1962/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p1)&&p0)) U X((p2 U p3))))'
Stuttering acceptance computed with spot in 242 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-07
Stuttering criterion allowed to conclude after 6612 steps with 0 reset in 25 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-07 finished in 62606 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 1375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Graph (trivial) has 1308 edges and 1375 vertex of which 312 / 1375 are part of one of the 24 SCC in 2 ms
Free SCC test removed 288 places
Ensure Unique test removed 322 transitions
Reduce isomorphic transitions removed 322 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 1086 transition count 1402
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 1 with 376 rules applied. Total rules applied 698 place count 765 transition count 1347
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 734 place count 729 transition count 1347
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 734 place count 729 transition count 1236
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 956 place count 618 transition count 1236
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 1005 place count 569 transition count 1052
Iterating global reduction 3 with 49 rules applied. Total rules applied 1054 place count 569 transition count 1052
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1069 place count 569 transition count 1037
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1069 place count 569 transition count 1035
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1073 place count 567 transition count 1035
Performed 198 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 396 rules applied. Total rules applied 1469 place count 369 transition count 835
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1471 place count 369 transition count 833
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 1490 place count 350 transition count 739
Iterating global reduction 5 with 19 rules applied. Total rules applied 1509 place count 350 transition count 739
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1526 place count 350 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1528 place count 349 transition count 721
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 1628 place count 299 transition count 798
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1643 place count 284 transition count 730
Iterating global reduction 6 with 15 rules applied. Total rules applied 1658 place count 284 transition count 730
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 6 with 31 rules applied. Total rules applied 1689 place count 284 transition count 699
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 1702 place count 284 transition count 686
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1704 place count 282 transition count 682
Iterating global reduction 7 with 2 rules applied. Total rules applied 1706 place count 282 transition count 682
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1708 place count 280 transition count 650
Iterating global reduction 7 with 2 rules applied. Total rules applied 1710 place count 280 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1712 place count 280 transition count 648
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1713 place count 279 transition count 647
Applied a total of 1713 rules in 158 ms. Remains 279 /1375 variables (removed 1096) and now considering 647/2046 (removed 1399) transitions.
[2026-05-24 20:10:54] [INFO ] Flow matrix only has 613 transitions (discarded 34 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9714920383853538958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2102174320688535435.kers'
[2026-05-24 20:10:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9714920383853538958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2102174320688535435.kers]
Normalized transition count is 612 out of 613 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 612 rows 279 cols 2808 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-24 20:10:54] [INFO ] Computed 79 invariants in 2 ms
Computed 79 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2102174320688535435.kers
Total runtime 3 ms.
[2026-05-24 20:10:54] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-24 20:10:54] [INFO ] Flow matrix only has 613 transitions (discarded 34 similar events)
[2026-05-24 20:10:54] [INFO ] Invariant cache hit.
[2026-05-24 20:10:54] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-24 20:10:54] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2026-05-24 20:10:54] [INFO ] Redundant transitions in 18 ms returned []
Running 564 sub problems to find dead transitions.
[2026-05-24 20:10:54] [INFO ] Flow matrix only has 613 transitions (discarded 34 similar events)
[2026-05-24 20:10:54] [INFO ] Invariant cache hit.
[2026-05-24 20:10:54] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 2/279 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (OVERLAPS) 612/891 variables, 279/358 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 63/421 constraints. Problems are: Problem set: 0 solved, 564 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 7 (OVERLAPS) 0/891 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 564 unsolved
No progress, stopping.
After SMT solving in domain Real declared 891/892 variables, and 421 constraints, problems are : Problem set: 0 solved, 564 unsolved in 24113 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 279/279 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (OVERLAPS) 2/279 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (OVERLAPS) 612/891 variables, 279/358 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/891 variables, 63/421 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/891 variables, 564/985 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 891/892 variables, and 986 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 279/279 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 54231ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 54232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 279/1375 places, 647/2046 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55005 ms. Remains : 279/1375 places, 647/2046 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 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-09
Product exploration explored 100000 steps with 11 reset in 428 ms.
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-09 finished in 55537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1)&&(G(F(p0)) U (p2 U p3)))))'
Support contains 7 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1355 transition count 2010
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1355 transition count 2010
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1355 transition count 2009
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 1345 transition count 1999
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 1345 transition count 1999
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1345 transition count 1998
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 1339 transition count 1992
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 1339 transition count 1992
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 1335 transition count 1988
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 1335 transition count 1988
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 1331 transition count 1984
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 1331 transition count 1984
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 1327 transition count 1980
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 1327 transition count 1980
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 1323 transition count 1976
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 1323 transition count 1976
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 1321 transition count 1974
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 1321 transition count 1974
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 1319 transition count 1972
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 1319 transition count 1972
Applied a total of 114 rules in 290 ms. Remains 1319 /1375 variables (removed 56) and now considering 1972/2046 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1814455726661804347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16948980316540941233.kers'
[2026-05-24 20:11:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1814455726661804347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16948980316540941233.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1972 rows 1319 cols 5302 entries
Finished phase 1 with 1240 SingleSign rule and 0 generalized
[2026-05-24 20:11:49] [INFO ] Computed 79 invariants in 8 ms
Computed 79 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16948980316540941233.kers
Total runtime 12 ms.
[2026-05-24 20:11:50] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-24 20:11:50] [INFO ] Invariant cache hit.
[2026-05-24 20:11:51] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Running 1971 sub problems to find dead transitions.
[2026-05-24 20:11:51] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1318/3291 variables, and 0 constraints, problems are : Problem set: 0 solved, 1971 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1319 constraints, PredecessorRefiner: 1971/1971 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1971 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1318/3291 variables, and 0 constraints, problems are : Problem set: 0 solved, 1971 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1319 constraints, PredecessorRefiner: 0/1971 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 1971 unsolved
Search for dead transitions found 0 dead transitions in 60453ms
Starting structural reductions in LTL mode, iteration 1 : 1319/1375 places, 1972/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62066 ms. Remains : 1319/1375 places, 1972/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1)&&(G(F(p0)) U (p2 U p3)))))'
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p3), true]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-10
Stuttering criterion allowed to conclude after 8256 steps with 0 reset in 29 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-10 finished in 62468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1354 transition count 1994
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1354 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1354 transition count 1993
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 1343 transition count 1982
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 1343 transition count 1982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 1343 transition count 1981
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 1336 transition count 1974
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 1336 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 1331 transition count 1969
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 1331 transition count 1969
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 1326 transition count 1964
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 1326 transition count 1964
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 1321 transition count 1959
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 1321 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 1316 transition count 1954
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 1316 transition count 1954
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 1314 transition count 1952
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 1314 transition count 1952
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 1312 transition count 1950
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 1312 transition count 1950
Applied a total of 128 rules in 297 ms. Remains 1312 /1375 variables (removed 63) and now considering 1950/2046 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10830991732932584258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2776305775509598966.kers'
[2026-05-24 20:12:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10830991732932584258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2776305775509598966.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 1950 rows 1312 cols 5226 entries
Finished phase 1 with 1233 SingleSign rule and 0 generalized
[2026-05-24 20:12:52] [INFO ] Computed 79 invariants in 18 ms
Computed 79 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-2776305775509598966.kers
Total runtime 22 ms.
[2026-05-24 20:12:52] [INFO ] Implicit Places using invariants in 419 ms returned []
[2026-05-24 20:12:52] [INFO ] Invariant cache hit.
[2026-05-24 20:12:53] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2026-05-24 20:12:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1311/3262 variables, and 0 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1312 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Starting structural reductions in LTL mode, iteration 1 : 1312/1375 places, 1950/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62199 ms. Remains : 1312/1375 places, 1950/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-12 finished in 62372 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)&&F(p1)))'
Support contains 4 out of 1375 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Graph (trivial) has 1306 edges and 1375 vertex of which 326 / 1375 are part of one of the 23 SCC in 4 ms
Free SCC test removed 303 places
Ensure Unique test removed 339 transitions
Reduce isomorphic transitions removed 339 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 316 rules applied. Total rules applied 317 place count 1071 transition count 1390
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 365 rules applied. Total rules applied 682 place count 755 transition count 1341
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 714 place count 723 transition count 1341
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 714 place count 723 transition count 1231
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 934 place count 613 transition count 1231
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 984 place count 563 transition count 1061
Iterating global reduction 3 with 50 rules applied. Total rules applied 1034 place count 563 transition count 1061
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 1049 place count 563 transition count 1046
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1049 place count 563 transition count 1043
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1055 place count 560 transition count 1043
Performed 191 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 4 with 382 rules applied. Total rules applied 1437 place count 369 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1438 place count 369 transition count 849
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1458 place count 349 transition count 739
Iterating global reduction 5 with 20 rules applied. Total rules applied 1478 place count 349 transition count 739
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 1497 place count 349 transition count 720
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 6 with 2 rules applied. Total rules applied 1499 place count 348 transition count 719
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1500 place count 347 transition count 703
Iterating global reduction 6 with 1 rules applied. Total rules applied 1501 place count 347 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1502 place count 347 transition count 702
Performed 49 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 1600 place count 298 transition count 769
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1615 place count 283 transition count 703
Iterating global reduction 7 with 15 rules applied. Total rules applied 1630 place count 283 transition count 703
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1661 place count 283 transition count 672
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1675 place count 283 transition count 658
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1677 place count 281 transition count 654
Iterating global reduction 8 with 2 rules applied. Total rules applied 1679 place count 281 transition count 654
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1681 place count 279 transition count 620
Iterating global reduction 8 with 2 rules applied. Total rules applied 1683 place count 279 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1685 place count 279 transition count 618
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1687 place count 279 transition count 618
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1688 place count 279 transition count 617
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1689 place count 278 transition count 615
Iterating global reduction 9 with 1 rules applied. Total rules applied 1690 place count 278 transition count 615
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1691 place count 277 transition count 599
Iterating global reduction 9 with 1 rules applied. Total rules applied 1692 place count 277 transition count 599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1693 place count 277 transition count 598
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1694 place count 276 transition count 597
Applied a total of 1694 rules in 203 ms. Remains 276 /1375 variables (removed 1099) and now considering 597/2046 (removed 1449) transitions.
[2026-05-24 20:13:54] [INFO ] Flow matrix only has 573 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10476182150876126737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6213227850649686174.kers'
[2026-05-24 20:13:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10476182150876126737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6213227850649686174.kers]
Normalized transition count is 572 out of 573 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 572 rows 276 cols 2674 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-24 20:13:54] [INFO ] Computed 79 invariants in 8 ms
Computed 79 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-6213227850649686174.kers
Total runtime 9 ms.
[2026-05-24 20:13:54] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-24 20:13:54] [INFO ] Flow matrix only has 573 transitions (discarded 24 similar events)
[2026-05-24 20:13:54] [INFO ] Invariant cache hit.
[2026-05-24 20:13:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-24 20:13:55] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2026-05-24 20:13:55] [INFO ] Redundant transitions in 6 ms returned []
Running 512 sub problems to find dead transitions.
[2026-05-24 20:13:55] [INFO ] Flow matrix only has 573 transitions (discarded 24 similar events)
[2026-05-24 20:13:55] [INFO ] Invariant cache hit.
[2026-05-24 20:13:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 572/848 variables, 276/355 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 42/397 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/849 variables, and 397 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 276/276 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (OVERLAPS) 1/276 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/276 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (OVERLAPS) 572/848 variables, 276/355 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/848 variables, 42/397 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 512/909 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 848/849 variables, and 909 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 79/79 constraints, State Equation: 276/276 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in SI_LTL mode, iteration 1 : 276/1375 places, 597/2046 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60800 ms. Remains : 276/1375 places, 597/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-13 finished in 60969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)&&(p1 U p2)))) U G(p2)))'
Support contains 5 out of 1375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1375/1375 places, 2046/2046 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 1355 transition count 1995
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 1355 transition count 1995
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1355 transition count 1994
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 1346 transition count 1985
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 1346 transition count 1985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1346 transition count 1984
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 1340 transition count 1978
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 1340 transition count 1978
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 1335 transition count 1973
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 1335 transition count 1973
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 1330 transition count 1968
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 1330 transition count 1968
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 1325 transition count 1963
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 1325 transition count 1963
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 1320 transition count 1958
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 1320 transition count 1958
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 1318 transition count 1956
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 1318 transition count 1956
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 1316 transition count 1954
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 1316 transition count 1954
Applied a total of 120 rules in 304 ms. Remains 1316 /1375 variables (removed 59) and now considering 1954/2046 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7262438997475879255.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15668414953099110818.kers'
[2026-05-24 20:14:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7262438997475879255.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15668414953099110818.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1954 rows 1316 cols 5234 entries
Finished phase 1 with 1237 SingleSign rule and 0 generalized
[2026-05-24 20:14:55] [INFO ] Computed 79 invariants in 7 ms
Computed 79 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15668414953099110818.kers
Total runtime 12 ms.
[2026-05-24 20:14:56] [INFO ] Implicit Places using invariants in 430 ms returned []
[2026-05-24 20:14:56] [INFO ] Invariant cache hit.
[2026-05-24 20:14:57] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
Running 1953 sub problems to find dead transitions.
[2026-05-24 20:14:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1315/3270 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1316 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1315/3270 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/79 constraints, State Equation: 0/1316 constraints, PredecessorRefiner: 0/1953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Starting structural reductions in LTL mode, iteration 1 : 1316/1375 places, 1954/2046 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62084 ms. Remains : 1316/1375 places, 1954/2046 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p0)&&(p1 U p2)))) U G(p2)))'
Stuttering acceptance computed with spot in 360 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1 p0), false]
Running random walk in product with property : DLCshifumi-PT-2b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DLCshifumi-PT-2b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCshifumi-PT-2b-LTLFireability-14 finished in 62483 ms.
All properties solved by simple procedures.
Total runtime 693348 ms.
BK_STOP 1779653757865
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCshifumi-PT-2b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DLCshifumi-PT-2b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695700692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;