About the Execution of ITS-Tools for FireWire-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 611.972 | 451643.00 | 568948.00 | 1546.00 | FFFTFTFTFFFTFFFF | 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.r130-smll-177955809000220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is FireWire-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000220
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.8K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Mar 7 05:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 05:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Mar 7 05:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:07 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 101K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-10-LTLFireability-00
FORMULA_NAME FireWire-PT-10-LTLFireability-01
FORMULA_NAME FireWire-PT-10-LTLFireability-02
FORMULA_NAME FireWire-PT-10-LTLFireability-03
FORMULA_NAME FireWire-PT-10-LTLFireability-04
FORMULA_NAME FireWire-PT-10-LTLFireability-05
FORMULA_NAME FireWire-PT-10-LTLFireability-06
FORMULA_NAME FireWire-PT-10-LTLFireability-07
FORMULA_NAME FireWire-PT-10-LTLFireability-08
FORMULA_NAME FireWire-PT-10-LTLFireability-09
FORMULA_NAME FireWire-PT-10-LTLFireability-10
FORMULA_NAME FireWire-PT-10-LTLFireability-11
FORMULA_NAME FireWire-PT-10-LTLFireability-12
FORMULA_NAME FireWire-PT-10-LTLFireability-13
FORMULA_NAME FireWire-PT-10-LTLFireability-14
FORMULA_NAME FireWire-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779809608986
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 15:33:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 15:33:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 15:33:32] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2026-05-26 15:33:32] [INFO ] Transformed 131 places.
[2026-05-26 15:33:32] [INFO ] Transformed 409 transitions.
[2026-05-26 15:33:32] [INFO ] Found NUPN structural information;
[2026-05-26 15:33:32] [INFO ] Parsed PT model containing 131 places and 409 transitions and 1529 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 353/353 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 127 transition count 345
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 127 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 127 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 126 transition count 339
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 126 transition count 339
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 125 transition count 337
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 125 transition count 337
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 124 transition count 334
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 124 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 23 place count 124 transition count 328
Applied a total of 23 rules in 133 ms. Remains 124 /131 variables (removed 7) and now considering 328/353 (removed 25) transitions.
[2026-05-26 15:33:32] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11079384215693231891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12466433620545893260.kers'
[2026-05-26 15:33:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11079384215693231891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12466433620545893260.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 124 cols 1031 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 15:33:32] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12466433620545893260.kers
Total runtime 4 ms.
[2026-05-26 15:33:33] [INFO ] Implicit Places using invariants in 538 ms returned []
[2026-05-26 15:33:33] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 15:33:33] [INFO ] Invariant cache hit.
[2026-05-26 15:33:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:33:34] [INFO ] Implicit Places using invariants and state equation in 677 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1311 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/131 places, 328/353 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1497 ms. Remains : 123/131 places, 328/353 transitions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2026-05-26 15:33:34] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8230133931938358477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17162265624200180638.kers'
[2026-05-26 15:33:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8230133931938358477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17162265624200180638.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 123 cols 1028 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 15:33:34] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17162265624200180638.kers
Total runtime 4 ms.
[2026-05-26 15:33:34] [INFO ] Implicit Places using invariants in 338 ms returned []
[2026-05-26 15:33:34] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 15:33:34] [INFO ] Invariant cache hit.
[2026-05-26 15:33:34] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:33:34] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-26 15:33:35] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 15:33:35] [INFO ] Invariant cache hit.
[2026-05-26 15:33:35] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 301/424 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (OVERLAPS) 1/425 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/425 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 327 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 179 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (OVERLAPS) 301/424 variables, 123/136 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/178 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 327/505 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/425 variables, and 506 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60601ms problems are : Problem set: 0 solved, 327 unsolved
Search for dead transitions found 0 dead transitions in 60633ms
Finished structural reductions in LTL mode , in 1 iterations and 61581 ms. Remains : 123/123 places, 328/328 transitions.
Support contains 34 out of 123 places after structural reductions.
[2026-05-26 15:34:36] [INFO ] Flatten gal took : 122 ms
[2026-05-26 15:34:36] [INFO ] Flatten gal took : 83 ms
[2026-05-26 15:34:36] [INFO ] Input system was already deterministic with 328 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (2210 resets) in 3417 ms. (11 steps per ms) remains 18/31 properties
BEST_FIRST walk for 4003 steps (59 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (54 resets) in 51 ms. (76 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (106 resets) in 103 ms. (38 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (59 resets) in 73 ms. (54 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (50 resets) in 117 ms. (33 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4001 steps (103 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (22 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (11 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (18 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (58 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (56 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
[2026-05-26 15:34:38] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 15:34:38] [INFO ] Invariant cache hit.
[2026-05-26 15:34:38] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 91/111 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 8/119 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 301/420 variables, 119/129 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 42/171 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/171 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 4/424 variables, 4/175 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/425 variables, 1/176 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/425 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/425 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 176 constraints, problems are : Problem set: 2 solved, 15 unsolved in 2896 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 92/111 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 8/119 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 301/420 variables, 119/129 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 42/171 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 14/185 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/185 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 4/424 variables, 4/189 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 1/190 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/190 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 1/425 variables, 1/191 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/425 variables, 1/192 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 192 constraints, problems are : Problem set: 2 solved, 15 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7950ms problems are : Problem set: 2 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 328/328 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 122 transition count 324
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 120 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 120 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 120 transition count 322
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 120 transition count 323
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 21 place count 118 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 118 transition count 319
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 117 transition count 318
Applied a total of 24 rules in 140 ms. Remains 117 /123 variables (removed 6) and now considering 318/328 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 117/123 places, 318/328 transitions.
RANDOM walk for 40000 steps (2370 resets) in 587 ms. (68 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40003 steps (577 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (13 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (564 resets) in 170 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1098 resets) in 174 ms. (228 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (604 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (73 resets) in 367 ms. (108 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40004 steps (68 resets) in 342 ms. (116 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (1111 resets) in 272 ms. (146 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (598 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
[2026-05-26 15:34:47] [INFO ] Flow matrix only has 291 transitions (discarded 27 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9477475639996406310.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8240707949796797442.kers'
[2026-05-26 15:34:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9477475639996406310.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8240707949796797442.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 291 rows 116 cols 992 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-26 15:34:47] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8240707949796797442.kers
Total runtime 4 ms.
[2026-05-26 15:34:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 72/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 262/344 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 58/402 variables, 29/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/403 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 5/408 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/408 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 167 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 72/82 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 262/344 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/344 variables, 31/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 58/402 variables, 29/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 12/159 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/403 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/403 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 5/408 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/408 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/408 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 178 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3273 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4470ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 9898 ms.
Support contains 10 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 318/318 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 320
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 116 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 116 transition count 317
Applied a total of 5 rules in 27 ms. Remains 116 /117 variables (removed 1) and now considering 317/318 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 116/117 places, 317/318 transitions.
RANDOM walk for 40000 steps (2349 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (594 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (577 resets) in 72 ms. (548 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1111 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (550 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (68 resets) in 72 ms. (547 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (63 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1084 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (570 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
[2026-05-26 15:35:01] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2094963363787471689.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5443005205564961702.kers'
[2026-05-26 15:35:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2094963363787471689.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5443005205564961702.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 288 rows 115 cols 984 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-26 15:35:01] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5443005205564961702.kers
Total runtime 1 ms.
[2026-05-26 15:35:01] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 72/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 259/340 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 58/398 variables, 29/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/399 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 5/404 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 166 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 72/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 259/340 variables, 81/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 58/398 variables, 29/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 12/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/399 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/399 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 5/404 variables, 5/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/404 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/404 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/404 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 175 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4150ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 3583 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 317/317 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 116/116 places, 317/317 transitions.
RANDOM walk for 40000 steps (2285 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (543 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (584 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1113 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (567 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1111 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (590 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 601115 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :3 out of 6
Probabilistic random walk after 601115 steps, saw 130405 distinct states, run finished after 3016 ms. (steps per millisecond=199 ) properties seen :3
[2026-05-26 15:35:12] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-26 15:35:12] [INFO ] Invariant cache hit.
[2026-05-26 15:35:12] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/297 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 101/398 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/399 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/404 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/297 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 101/398 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/399 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/404 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/404 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1081ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 806 ms.
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 317/317 transitions.
Applied a total of 0 rules in 16 ms. Remains 116 /116 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 116/116 places, 317/317 transitions.
RANDOM walk for 40000 steps (2354 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (606 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1106 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (584 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 769349 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 3
Probabilistic random walk after 769349 steps, saw 164699 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2026-05-26 15:35:17] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-26 15:35:17] [INFO ] Invariant cache hit.
[2026-05-26 15:35:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/297 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 101/398 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/399 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/404 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/404 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/297 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 101/398 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/399 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/404 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/404 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 758 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1115ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 882 ms.
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 317/317 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 116/116 places, 317/317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 317/317 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2026-05-26 15:35:19] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-26 15:35:19] [INFO ] Invariant cache hit.
[2026-05-26 15:35:19] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-26 15:35:19] [INFO ] Flow matrix only has 288 transitions (discarded 29 similar events)
[2026-05-26 15:35:19] [INFO ] Invariant cache hit.
[2026-05-26 15:35:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:35:20] [INFO ] Implicit Places using invariants and state equation in 360 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 505 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 115/116 places, 317/317 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 316
Applied a total of 2 rules in 33 ms. Remains 114 /115 variables (removed 1) and now considering 316/317 (removed 1) transitions.
[2026-05-26 15:35:20] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7477342286278833983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11777011446207843130.kers'
[2026-05-26 15:35:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7477342286278833983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11777011446207843130.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 114 cols 983 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-26 15:35:20] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11777011446207843130.kers
Total runtime 3 ms.
[2026-05-26 15:35:20] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-26 15:35:20] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2026-05-26 15:35:20] [INFO ] Invariant cache hit.
[2026-05-26 15:35:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:35:21] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 114/116 places, 316/317 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1201 ms. Remains : 114/116 places, 316/317 transitions.
RANDOM walk for 40000 steps (2285 resets) in 193 ms. (206 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (587 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1096 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (557 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 742680 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 3
Probabilistic random walk after 742680 steps, saw 160919 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
[2026-05-26 15:35:24] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2026-05-26 15:35:24] [INFO ] Invariant cache hit.
[2026-05-26 15:35:24] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/297 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 100/397 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/398 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/398 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/398 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3/401 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/401 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 163 constraints, problems are : Problem set: 0 solved, 3 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 237/297 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 100/397 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/398 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/398 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/398 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/401 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/401 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1217ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 596 ms.
Support contains 5 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 316/316 transitions.
Applied a total of 0 rules in 20 ms. Remains 114 /114 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 114/114 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 316/316 transitions.
Applied a total of 0 rules in 11 ms. Remains 114 /114 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2026-05-26 15:35:25] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2026-05-26 15:35:25] [INFO ] Invariant cache hit.
[2026-05-26 15:35:26] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 15:35:26] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2026-05-26 15:35:26] [INFO ] Invariant cache hit.
[2026-05-26 15:35:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:35:26] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2026-05-26 15:35:26] [INFO ] Redundant transitions in 36 ms returned []
Running 314 sub problems to find dead transitions.
[2026-05-26 15:35:26] [INFO ] Flow matrix only has 287 transitions (discarded 29 similar events)
[2026-05-26 15:35:26] [INFO ] Invariant cache hit.
[2026-05-26 15:35:26] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (OVERLAPS) 287/400 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 43/170 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 401/401 variables, and 172 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 287/400 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 314/485 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/401 variables, and 489 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60163ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60847 ms. Remains : 114/114 places, 316/316 transitions.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA FireWire-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 38 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((G(p2)||p1))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 325
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 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 324
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 117 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 117 transition count 324
Applied a total of 16 rules in 67 ms. Remains 117 /123 variables (removed 6) and now considering 324/328 (removed 4) transitions.
[2026-05-26 15:36:27] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18014732891007623583.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-517158010597253424.kers'
[2026-05-26 15:36:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18014732891007623583.kers, --Pflows, --basisKERS=/tmp/petrispot-output-517158010597253424.kers]
Normalized transition count is 290 out of 291 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 290 rows 116 cols 985 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-26 15:36:27] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-517158010597253424.kers
Total runtime 3 ms.
[2026-05-26 15:36:27] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-26 15:36:27] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
[2026-05-26 15:36:27] [INFO ] Invariant cache hit.
[2026-05-26 15:36:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:36:28] [INFO ] Implicit Places using invariants and state equation in 436 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 636 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/123 places, 324/328 transitions.
Applied a total of 0 rules in 15 ms. Remains 116 /116 variables (removed 0) and now considering 324/324 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 719 ms. Remains : 116/123 places, 324/328 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((G(p2)||p1))))'
Stuttering acceptance computed with spot in 453 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-00
Product exploration explored 100000 steps with 3 reset in 311 ms.
Product exploration explored 100000 steps with 0 reset in 143 ms.
Computed a total of 16 stabilizing places and 34 stable transitions
Computed a total of 16 stabilizing places and 34 stable transitions
Knowledge based reduction with 11 factoid took 62 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (2281 resets) in 219 ms. (181 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (545 resets) in 292 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (555 resets) in 310 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (565 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
[2026-05-26 15:36:29] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15219989387287622615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13820992747729593817.kers'
[2026-05-26 15:36:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15219989387287622615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13820992747729593817.kers]
Normalized transition count is 290 out of 291 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 116 cols 985 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-26 15:36:29] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13820992747729593817.kers
Total runtime 3 ms.
[2026-05-26 15:36:29] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/298 variables, 60/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 21/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/400 variables, 50/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 3/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 22/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/401 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/406 variables, 5/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/407 variables, and 165 constraints, problems are : Problem set: 1 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 238/298 variables, 60/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 21/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 102/400 variables, 50/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 3/136 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 22/158 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 2/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/401 variables, 1/161 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 1/162 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5/406 variables, 5/167 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/407 variables, and 167 constraints, problems are : Problem set: 1 solved, 2 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1065ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 35 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 324/324 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 318
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 116 transition count 318
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 113 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 113 transition count 314
Applied a total of 16 rules in 38 ms. Remains 113 /116 variables (removed 3) and now considering 314/324 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 113/116 places, 314/324 transitions.
RANDOM walk for 40000 steps (2323 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (605 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (560 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 370684 steps, run visited all 2 properties in 1561 ms. (steps per millisecond=237 )
Probabilistic random walk after 370684 steps, saw 86060 distinct states, run finished after 1566 ms. (steps per millisecond=236 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 92 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Knowledge-based reduction took 3388 ms.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 324/324 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 324/324 (removed 0) transitions.
[2026-05-26 15:36:32] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
[2026-05-26 15:36:32] [INFO ] Invariant cache hit.
[2026-05-26 15:36:32] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-26 15:36:32] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
[2026-05-26 15:36:32] [INFO ] Invariant cache hit.
[2026-05-26 15:36:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:36:33] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2026-05-26 15:36:33] [INFO ] Redundant transitions in 10 ms returned []
Running 321 sub problems to find dead transitions.
[2026-05-26 15:36:33] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
[2026-05-26 15:36:33] [INFO ] Invariant cache hit.
[2026-05-26 15:36:33] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 290/405 variables, 115/128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 43/171 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 1/406 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/407 variables, and 172 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 290/405 variables, 115/129 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 43/172 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 321/493 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 321 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/407 variables, and 495 constraints, problems are : Problem set: 0 solved, 321 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60739 ms. Remains : 116/116 places, 324/324 transitions.
Computed a total of 16 stabilizing places and 34 stable transitions
Computed a total of 16 stabilizing places and 34 stable transitions
Knowledge based reduction with 5 factoid took 55 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2317 resets) in 164 ms. (242 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (581 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2026-05-26 15:37:33] [INFO ] Flow matrix only has 291 transitions (discarded 33 similar events)
[2026-05-26 15:37:33] [INFO ] Invariant cache hit.
[2026-05-26 15:37:33] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/298 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/400 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/401 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/406 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/407 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 238/298 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 102/400 variables, 50/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/401 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/406 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/406 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/407 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 324/324 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 318
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 115 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 115 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 114 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 114 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 113 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 113 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 112 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 112 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 111 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 111 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 110 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 110 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 109 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 109 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 108 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 108 transition count 299
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 108 transition count 299
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 105 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 105 transition count 295
Applied a total of 32 rules in 63 ms. Remains 105 /116 variables (removed 11) and now considering 295/324 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 105/116 places, 295/324 transitions.
RANDOM walk for 40000 steps (2308 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (601 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 370684 steps, run visited all 1 properties in 1149 ms. (steps per millisecond=322 )
Probabilistic random walk after 370684 steps, saw 86060 distinct states, run finished after 1150 ms. (steps per millisecond=322 ) properties seen :1
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Knowledge-based reduction took 2202 ms.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 308 ms.
Product exploration explored 100000 steps with 6 reset in 225 ms.
Built C files in :
/tmp/ltsmin4251594713444503166
[2026-05-26 15:37:36] [INFO ] Computing symmetric may disable matrix : 324 transitions.
[2026-05-26 15:37:36] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:37:36] [INFO ] Computing symmetric may enable matrix : 324 transitions.
[2026-05-26 15:37:36] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:37:36] [INFO ] Computing Do-Not-Accords matrix : 324 transitions.
[2026-05-26 15:37:36] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:37:36] [INFO ] Built C files in 164ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4251594713444503166
Running compilation step : cd /tmp/ltsmin4251594713444503166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1665 ms.
Running link step : cd /tmp/ltsmin4251594713444503166;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin4251594713444503166;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17953058126956701017.hoa' '--buchi-type=spotba'
LTSmin run took 3591 ms.
FORMULA FireWire-PT-10-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-10-LTLFireability-00 finished in 74426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(X(G((G(p2)||X(p3))))))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2026-05-26 15:37:41] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12030952790415985235.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4337283957374749609.kers'
[2026-05-26 15:37:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12030952790415985235.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4337283957374749609.kers]
Normalized transition count is 301 out of 302 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 123 cols 1028 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 15:37:41] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4337283957374749609.kers
Total runtime 2 ms.
[2026-05-26 15:37:41] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 15:37:41] [INFO ] Flow matrix only has 302 transitions (discarded 26 similar events)
[2026-05-26 15:37:41] [INFO ] Invariant cache hit.
[2026-05-26 15:37:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:37:42] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 567 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 328/328 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 328/328 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 571 ms. Remains : 122/123 places, 328/328 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(X(G((G(p2)||X(p3))))))))'
Stuttering acceptance computed with spot in 730 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p2) p3 (NOT p1))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-02 finished in 1371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((X(p1) U (X(G(p1))||(X(p1)&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))||p0))))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 119 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 117 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 116 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 115 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Applied a total of 18 rules in 15 ms. Remains 114 /123 variables (removed 9) and now considering 307/328 (removed 21) transitions.
[2026-05-26 15:37:43] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16563678661199357109.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2738390209643146809.kers'
[2026-05-26 15:37:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16563678661199357109.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2738390209643146809.kers]
Normalized transition count is 280 out of 281 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 114 cols 950 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 15:37:43] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2738390209643146809.kers
Total runtime 3 ms.
[2026-05-26 15:37:43] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 15:37:43] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:37:43] [INFO ] Invariant cache hit.
[2026-05-26 15:37:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:37:43] [INFO ] Implicit Places using invariants and state equation in 438 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 628 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/123 places, 307/328 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 644 ms. Remains : 113/123 places, 307/328 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(((X(p1) U (X(G(p1))||(X(p1)&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2)))))))||p0))))))'
Stuttering acceptance computed with spot in 426 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-04
Product exploration explored 100000 steps with 2 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 150 ms.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (2151 resets) in 565 ms. (70 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40002 steps (20 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (582 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (16 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (590 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (586 resets) in 115 ms. (344 steps per ms) remains 3/5 properties
[2026-05-26 15:37:45] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16440782225103232858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9888152253791176504.kers'
[2026-05-26 15:37:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16440782225103232858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9888152253791176504.kers]
Normalized transition count is 280 out of 281 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 113 cols 947 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 15:37:45] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9888152253791176504.kers
Total runtime 3 ms.
[2026-05-26 15:37:45] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 59/394 variables, and 3 constraints, problems are : Problem set: 3 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, State Equation: 0/113 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 1097 ms.
Stuttering acceptance computed with spot in 225 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 113 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 307/307 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2026-05-26 15:37:45] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:37:45] [INFO ] Invariant cache hit.
[2026-05-26 15:37:46] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-26 15:37:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:37:46] [INFO ] Invariant cache hit.
[2026-05-26 15:37:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:37:46] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-26 15:37:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:37:46] [INFO ] Invariant cache hit.
[2026-05-26 15:37:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 163 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/393 variables, 113/123 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 39/162 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 306/468 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/394 variables, and 470 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 60600 ms. Remains : 113/113 places, 307/307 transitions.
Computed a total of 10 stabilizing places and 17 stable transitions
Computed a total of 10 stabilizing places and 17 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2303 resets) in 149 ms. (266 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (574 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2026-05-26 15:38:46] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:38:46] [INFO ] Invariant cache hit.
[2026-05-26 15:38:46] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/108 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 280/388 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/393 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/394 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/394 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/108 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 280/388 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/388 variables, 39/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/393 variables, 5/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/394 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/394 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 657ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 307/307 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 112 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 109 transition count 309
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 17 place count 109 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 109 transition count 300
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 109 transition count 300
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 106 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 106 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 105 transition count 295
Applied a total of 31 rules in 55 ms. Remains 105 /113 variables (removed 8) and now considering 295/307 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 105/113 places, 295/307 transitions.
RANDOM walk for 40000 steps (2350 resets) in 246 ms. (161 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (524 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14346 steps, run visited all 1 properties in 51 ms. (steps per millisecond=281 )
Probabilistic random walk after 14346 steps, saw 4384 distinct states, run finished after 51 ms. (steps per millisecond=281 ) properties seen :1
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 1461 ms.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 113 ms.
Product exploration explored 100000 steps with 0 reset in 72 ms.
Spot run failed in 108 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10082621929949749203
[2026-05-26 15:38:48] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10082621929949749203
Running compilation step : cd /tmp/ltsmin10082621929949749203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 876 ms.
Running link step : cd /tmp/ltsmin10082621929949749203;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin10082621929949749203;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13879509510010374867.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA FireWire-PT-10-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-10-LTLFireability-04 finished in 66669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(F(!p1)&&((X(!p0)&&F(!p2))||X(G(!p0))))||G((X(!p0)&&F(!p2))))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 119 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 119 transition count 318
Applied a total of 8 rules in 7 ms. Remains 119 /123 variables (removed 4) and now considering 318/328 (removed 10) transitions.
[2026-05-26 15:38:49] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2332764544269479706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15673399146862708115.kers'
[2026-05-26 15:38:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2332764544269479706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15673399146862708115.kers]
Normalized transition count is 291 out of 292 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 119 cols 992 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-26 15:38:49] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15673399146862708115.kers
Total runtime 3 ms.
[2026-05-26 15:38:50] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-26 15:38:50] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-26 15:38:50] [INFO ] Invariant cache hit.
[2026-05-26 15:38:50] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 15:38:50] [INFO ] Implicit Places using invariants and state equation in 496 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 685 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 118/123 places, 318/328 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 694 ms. Remains : 118/123 places, 318/328 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((X(p0)&&F(p1)))||(F(p2)&&(X(G(p0))||(X(p0)&&F(p1)))))))'
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Computed a total of 15 stabilizing places and 28 stable transitions
Computed a total of 15 stabilizing places and 28 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 17 ms. Proved property starting from automaton with 4 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA FireWire-PT-10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-10-LTLFireability-05 finished in 1807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 119 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 117 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 116 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 115 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Applied a total of 18 rules in 13 ms. Remains 114 /123 variables (removed 9) and now considering 307/328 (removed 21) transitions.
[2026-05-26 15:38:51] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6776883751737985827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7873085244605737105.kers'
[2026-05-26 15:38:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6776883751737985827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7873085244605737105.kers]
Normalized transition count is 280 out of 281 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 114 cols 950 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 15:38:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7873085244605737105.kers
Total runtime 2 ms.
[2026-05-26 15:38:51] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-26 15:38:51] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:38:51] [INFO ] Invariant cache hit.
[2026-05-26 15:38:51] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:38:52] [INFO ] Implicit Places using invariants and state equation in 369 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 505 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/123 places, 307/328 transitions.
Applied a total of 0 rules in 1 ms. Remains 113 /113 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 520 ms. Remains : 113/123 places, 307/328 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)))'
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-08 finished in 648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 306
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 0 with 2 rules applied. Total rules applied 20 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 109 transition count 305
Applied a total of 32 rules in 49 ms. Remains 109 /123 variables (removed 14) and now considering 305/328 (removed 23) transitions.
[2026-05-26 15:38:52] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16318361989175028086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7854097679365719051.kers'
[2026-05-26 15:38:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16318361989175028086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7854097679365719051.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 108 cols 915 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 15:38:52] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7854097679365719051.kers
Total runtime 2 ms.
[2026-05-26 15:38:52] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-26 15:38:52] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2026-05-26 15:38:52] [INFO ] Invariant cache hit.
[2026-05-26 15:38:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:38:53] [INFO ] Implicit Places using invariants and state equation in 644 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 838 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/123 places, 305/328 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 896 ms. Remains : 108/123 places, 305/328 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-09 finished in 988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(F(p2))||p1)))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 306
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 0 with 2 rules applied. Total rules applied 20 place count 112 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 110 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 110 transition count 305
Applied a total of 28 rules in 46 ms. Remains 110 /123 variables (removed 13) and now considering 305/328 (removed 23) transitions.
[2026-05-26 15:38:53] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4493336249899177042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16779648266132461488.kers'
[2026-05-26 15:38:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4493336249899177042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16779648266132461488.kers]
Normalized transition count is 274 out of 275 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 274 rows 109 cols 923 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 15:38:53] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16779648266132461488.kers
Total runtime 2 ms.
[2026-05-26 15:38:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-26 15:38:53] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
[2026-05-26 15:38:53] [INFO ] Invariant cache hit.
[2026-05-26 15:38:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:38:53] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 607 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/123 places, 305/328 transitions.
Applied a total of 0 rules in 10 ms. Remains 109 /109 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 664 ms. Remains : 109/123 places, 305/328 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(X(F(p2))||p1)))))'
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-12
Product exploration explored 100000 steps with 4 reset in 213 ms.
Product exploration explored 100000 steps with 0 reset in 254 ms.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge based reduction with 13 factoid took 83 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (2390 resets) in 322 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 434 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (8 resets) in 498 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (9 resets) in 431 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 244 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 785772 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :4 out of 6
Probabilistic random walk after 785772 steps, saw 154962 distinct states, run finished after 3001 ms. (steps per millisecond=261 ) properties seen :4
[2026-05-26 15:38:58] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6032890776579690453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12440914190569517908.kers'
[2026-05-26 15:38:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6032890776579690453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12440914190569517908.kers]
Normalized transition count is 274 out of 275 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 274 rows 109 cols 923 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-26 15:38:58] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12440914190569517908.kers
Total runtime 1 ms.
[2026-05-26 15:38:58] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 75/384 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, State Equation: 0/109 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 15 factoid took 95 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Knowledge-based reduction took 4015 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 305/305 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 305/305 (removed 0) transitions.
[2026-05-26 15:38:58] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
[2026-05-26 15:38:58] [INFO ] Invariant cache hit.
[2026-05-26 15:38:58] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-26 15:38:58] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
[2026-05-26 15:38:58] [INFO ] Invariant cache hit.
[2026-05-26 15:38:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:38:59] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2026-05-26 15:38:59] [INFO ] Redundant transitions in 6 ms returned []
Running 302 sub problems to find dead transitions.
[2026-05-26 15:38:59] [INFO ] Flow matrix only has 275 transitions (discarded 30 similar events)
[2026-05-26 15:38:59] [INFO ] Invariant cache hit.
[2026-05-26 15:38:59] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 274/382 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/383 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 383/384 variables, and 161 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 274/382 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/382 variables, 40/160 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 302/462 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/384 variables, and 466 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 108/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60596 ms. Remains : 109/109 places, 305/305 transitions.
Computed a total of 8 stabilizing places and 15 stable transitions
Computed a total of 8 stabilizing places and 15 stable transitions
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (2335 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (23 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 228 steps, run visited all 1 properties in 6 ms. (steps per millisecond=38 )
Probabilistic random walk after 228 steps, saw 174 distinct states, run finished after 6 ms. (steps per millisecond=38 ) properties seen :1
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Knowledge-based reduction took 280 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 64 ms.
Product exploration explored 100000 steps with 3 reset in 72 ms.
Built C files in :
/tmp/ltsmin8904686117833423620
[2026-05-26 15:39:59] [INFO ] Computing symmetric may disable matrix : 305 transitions.
[2026-05-26 15:39:59] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:39:59] [INFO ] Computing symmetric may enable matrix : 305 transitions.
[2026-05-26 15:39:59] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:39:59] [INFO ] Computing Do-Not-Accords matrix : 305 transitions.
[2026-05-26 15:39:59] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 15:39:59] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8904686117833423620
Running compilation step : cd /tmp/ltsmin8904686117833423620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin8904686117833423620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8904686117833423620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12067182053885670607.hoa' '--buchi-type=spotba'
LTSmin run took 394 ms.
FORMULA FireWire-PT-10-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-10-LTLFireability-12 finished in 67962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(G(p0))||G(F(p1))) U p2) U p3))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 326
Applied a total of 2 rules in 3 ms. Remains 122 /123 variables (removed 1) and now considering 326/328 (removed 2) transitions.
[2026-05-26 15:40:01] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-254613566674090535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2933784724270835151.kers'
[2026-05-26 15:40:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-254613566674090535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2933784724270835151.kers]
Normalized transition count is 299 out of 300 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 122 cols 1020 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-26 15:40:01] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2933784724270835151.kers
Total runtime 2 ms.
[2026-05-26 15:40:01] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-26 15:40:01] [INFO ] Flow matrix only has 300 transitions (discarded 26 similar events)
[2026-05-26 15:40:01] [INFO ] Invariant cache hit.
[2026-05-26 15:40:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 15:40:01] [INFO ] Implicit Places using invariants and state equation in 407 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 584 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 326/328 transitions.
Applied a total of 0 rules in 0 ms. Remains 121 /121 variables (removed 0) and now considering 326/326 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 589 ms. Remains : 121/123 places, 326/328 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))||G(F(p1))) U p2) U p3))'
Stuttering acceptance computed with spot in 261 ms :[(NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-13 finished in 901 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 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 325
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 325
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 120 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 119 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 119 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 118 transition count 317
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 118 transition count 317
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 117 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 117 transition count 315
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 116 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 116 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 115 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 115 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 114 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 114 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 113 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 113 transition count 306
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 0 with 2 rules applied. Total rules applied 20 place count 112 transition count 305
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 109 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 109 transition count 305
Applied a total of 32 rules in 29 ms. Remains 109 /123 variables (removed 14) and now considering 305/328 (removed 23) transitions.
[2026-05-26 15:40:02] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16904256833779723646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2283040882149851530.kers'
[2026-05-26 15:40:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16904256833779723646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2283040882149851530.kers]
Normalized transition count is 271 out of 272 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 271 rows 108 cols 915 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 15:40:02] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2283040882149851530.kers
Total runtime 2 ms.
[2026-05-26 15:40:02] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-26 15:40:02] [INFO ] Flow matrix only has 272 transitions (discarded 33 similar events)
[2026-05-26 15:40:02] [INFO ] Invariant cache hit.
[2026-05-26 15:40:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:40:02] [INFO ] Implicit Places using invariants and state equation in 452 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 566 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/123 places, 305/328 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 600 ms. Remains : 108/123 places, 305/328 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 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-10-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-14 finished in 732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(((!p1&&(p2 U X(p2))&&G(!p3))||G((!p3&&(p2 U X(p2)))))))))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 328/328 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 121 transition count 323
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 120 transition count 321
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 120 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 119 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 119 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 118 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 117 transition count 313
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 116 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 115 transition count 309
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 307
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 307
Applied a total of 18 rules in 15 ms. Remains 114 /123 variables (removed 9) and now considering 307/328 (removed 21) transitions.
[2026-05-26 15:40:02] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13344120097769989354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9490837103246051807.kers'
[2026-05-26 15:40:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13344120097769989354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9490837103246051807.kers]
Normalized transition count is 280 out of 281 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 114 cols 950 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-26 15:40:02] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9490837103246051807.kers
Total runtime 2 ms.
[2026-05-26 15:40:03] [INFO ] Implicit Places using invariants in 161 ms returned []
[2026-05-26 15:40:03] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:40:03] [INFO ] Invariant cache hit.
[2026-05-26 15:40:03] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-26 15:40:03] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 306 sub problems to find dead transitions.
[2026-05-26 15:40:03] [INFO ] Flow matrix only has 281 transitions (discarded 26 similar events)
[2026-05-26 15:40:03] [INFO ] Invariant cache hit.
[2026-05-26 15:40:03] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/394 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (OVERLAPS) 1/395 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 306 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 166 constraints, problems are : Problem set: 0 solved, 306 unsolved in 26370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 306 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 4 (OVERLAPS) 280/394 variables, 114/126 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 39/165 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 306/471 constraints. Problems are: Problem set: 0 solved, 306 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 306 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/395 variables, and 473 constraints, problems are : Problem set: 0 solved, 306 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 114/114 constraints, ReadFeed: 39/40 constraints, PredecessorRefiner: 306/306 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56493ms problems are : Problem set: 0 solved, 306 unsolved
Search for dead transitions found 0 dead transitions in 56495ms
Starting structural reductions in LTL mode, iteration 1 : 114/123 places, 307/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57070 ms. Remains : 114/123 places, 307/328 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&&(p1 U X(p1))&&G(p2))||G((p2&&(p1 U X(p1))))))||p3)))'
Stuttering acceptance computed with spot in 379 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FireWire-PT-10-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 204 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-10-LTLFireability-15 finished in 57739 ms.
All properties solved by simple procedures.
Total runtime 448902 ms.
BK_STOP 1779810060629
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-10.tgz
mv FireWire-PT-10 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 ;