About the Execution of ITS-Tools for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1357.560 | 350344.00 | 445733.00 | 5457.20 | FFFTFFFFTFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r098-tall-177955695800868.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 DoubleExponent-PT-003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800868
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 6 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Mar 6 16:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 16:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779676718868
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 02:38:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:38:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:38:40] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2026-05-25 02:38:40] [INFO ] Transformed 163 places.
[2026-05-25 02:38:40] [INFO ] Transformed 148 transitions.
[2026-05-25 02:38:40] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-003-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 21 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-855070793626266262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12003618268082840088.kers'
[2026-05-25 02:38:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-855070793626266262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12003618268082840088.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 159 cols 413 entries
Finished phase 1 with 133 SingleSign rule and 10 generalized
[2026-05-25 02:38:40] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12003618268082840088.kers
Total runtime 2 ms.
[2026-05-25 02:38:40] [INFO ] Implicit Places using invariants in 217 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 247 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 158/163 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 296 ms. Remains : 158/163 places, 148/148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4366769012059955741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10635759695535121464.kers'
[2026-05-25 02:38:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4366769012059955741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10635759695535121464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:38:40] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10635759695535121464.kers
Total runtime 1 ms.
[2026-05-25 02:38:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 02:38:40] [INFO ] Invariant cache hit.
[2026-05-25 02:38:40] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-25 02:38:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/174 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 147/329 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 334 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 53872ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 53886ms
Finished structural reductions in LTL mode , in 1 iterations and 54232 ms. Remains : 158/158 places, 148/148 transitions.
Support contains 34 out of 158 places after structural reductions.
[2026-05-25 02:39:34] [INFO ] Flatten gal took : 31 ms
[2026-05-25 02:39:34] [INFO ] Flatten gal took : 14 ms
[2026-05-25 02:39:34] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1323 resets) in 2452 ms. (16 steps per ms) remains 19/26 properties
BEST_FIRST walk for 4000 steps (119 resets) in 60 ms. (65 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (107 resets) in 28 ms. (137 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (112 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (107 resets) in 88 ms. (44 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (116 resets) in 99 ms. (40 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (117 resets) in 32 ms. (121 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (109 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (111 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (114 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (114 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (111 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (117 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (115 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (105 resets) in 28 ms. (137 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (111 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (113 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (109 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
[2026-05-25 02:39:36] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 15/42 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 92/134 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 138/272 variables, 134/149 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 25/297 variables, 19/168 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 1/169 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 4/301 variables, 2/171 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 4/305 variables, 2/173 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/305 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 1/306 variables, 1/174 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/306 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/306 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 177 constraints, problems are : Problem set: 1 solved, 18 unsolved in 2886 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 15/41 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 93/134 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 138/272 variables, 134/150 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 10/160 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 25/297 variables, 19/179 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 8/187 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 1/188 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 4/301 variables, 2/190 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/190 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 4/305 variables, 2/192 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 1/306 variables, 1/193 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 1/196 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 22 (OVERLAPS) 0/306 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 196 constraints, problems are : Problem set: 1 solved, 18 unsolved in 3394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 6293ms problems are : Problem set: 1 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 3245 ms.
Support contains 26 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 158 transition count 128
Reduce places removed 20 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 26 rules applied. Total rules applied 46 place count 138 transition count 122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 52 place count 132 transition count 122
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 52 place count 132 transition count 117
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 127 transition count 117
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 104 place count 106 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 103 transition count 96
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 103 transition count 90
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 122 place count 97 transition count 90
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 128 place count 97 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 96 transition count 89
Applied a total of 129 rules in 43 ms. Remains 96 /158 variables (removed 62) and now considering 89/148 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 96/158 places, 89/148 transitions.
RANDOM walk for 40000 steps (3842 resets) in 547 ms. (72 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4001 steps (263 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (253 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (260 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (284 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (271 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (261 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (275 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (282 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (280 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (274 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (272 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (276 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (274 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (285 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (268 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7890245741134801091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4342104077070964321.kers'
[2026-05-25 02:39:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7890245741134801091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4342104077070964321.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 96 cols 313 entries
Finished phase 1 with 65 SingleSign rule and 16 generalized
[2026-05-25 02:39:45] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4342104077070964321.kers
Total runtime 1 ms.
[2026-05-25 02:39:45] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 59/81 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/85 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/87 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 88/175 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 10/185 variables, 9/117 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/185 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 119 constraints, problems are : Problem set: 0 solved, 15 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 96/96 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 59/81 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/85 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/87 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 88/175 variables, 87/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/175 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 10/185 variables, 9/125 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 7/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/185 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/185 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/185 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/185 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 20 (OVERLAPS) 0/185 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 137 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1653 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 96/96 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 1 properties in 8197 ms.
Support contains 20 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 89/89 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 95 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 92 transition count 85
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 92 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 90 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 90 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 89 transition count 82
Applied a total of 14 rules in 17 ms. Remains 89 /96 variables (removed 7) and now considering 82/89 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 89/96 places, 82/89 transitions.
RANDOM walk for 40000 steps (5166 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3396 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3345 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3407 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3353 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3344 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3365 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3380 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3393 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3365 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (3370 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3393 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (3316 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (3372 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (3388 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 959506 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :13 out of 14
Probabilistic random walk after 959506 steps, saw 479942 distinct states, run finished after 3006 ms. (steps per millisecond=319 ) properties seen :13
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9193099377286350798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15914837916405628487.kers'
[2026-05-25 02:39:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9193099377286350798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15914837916405628487.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 82 rows 87 cols 289 entries
Finished phase 1 with 57 SingleSign rule and 17 generalized
[2026-05-25 02:39:59] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15914837916405628487.kers
Total runtime 3 ms.
[2026-05-25 02:39:59] [INFO ] State equation strengthened by 6 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) 60/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/72 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/150 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/170 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/171 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/171 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 89/89 constraints, ReadFeed: 6/6 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) 60/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/72 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 78/150 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/170 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/171 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 89/89 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 306ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 82/82 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 89 transition count 77
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 84 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 84 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 82 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 76 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 75 transition count 69
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 75 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 71 transition count 65
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 41 place count 71 transition count 65
Applied a total of 41 rules in 22 ms. Remains 71 /89 variables (removed 18) and now considering 65/82 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 71/89 places, 65/82 transitions.
RANDOM walk for 40000 steps (5127 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3455 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1391328 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :0 out of 1
Probabilistic random walk after 1391328 steps, saw 695695 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-776236697170041753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4489278450493609960.kers'
[2026-05-25 02:40:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-776236697170041753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4489278450493609960.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 65 rows 69 cols 296 entries
Finished phase 1 with 41 SingleSign rule and 15 generalized
[2026-05-25 02:40:03] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4489278450493609960.kers
Total runtime 0 ms.
[2026-05-25 02:40:03] [INFO ] State equation strengthened by 10 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) 40/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/58 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/123 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/135 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/136 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/136 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/136 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 71/71 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/58 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/123 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/135 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/135 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/136 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/136 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/136 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 71/71 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 71 /71 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 71/71 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2026-05-25 02:40:03] [INFO ] Invariant cache hit.
[2026-05-25 02:40:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 02:40:03] [INFO ] Invariant cache hit.
[2026-05-25 02:40:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:40:03] [INFO ] Implicit Places using invariants and state equation in 201 ms returned [39, 44, 62, 68]
[2026-05-25 02:40:03] [INFO ] Actually due to overlaps returned [44, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 261 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/71 places, 65/65 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 69 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 64
Applied a total of 2 rules in 9 ms. Remains 68 /69 variables (removed 1) and now considering 64/65 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3459088051662756864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5098351550818640325.kers'
[2026-05-25 02:40:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3459088051662756864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5098351550818640325.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 64 rows 66 cols 277 entries
Finished phase 1 with 45 SingleSign rule and 10 generalized
[2026-05-25 02:40:03] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5098351550818640325.kers
Total runtime 1 ms.
[2026-05-25 02:40:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 02:40:03] [INFO ] Invariant cache hit.
[2026-05-25 02:40:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:40:04] [INFO ] Implicit Places using invariants and state equation in 135 ms returned [59, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 185 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/71 places, 64/65 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 63
Applied a total of 2 rules in 6 ms. Remains 65 /66 variables (removed 1) and now considering 63/64 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4812162549897882942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2127582267539387836.kers'
[2026-05-25 02:40:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4812162549897882942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2127582267539387836.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 63 rows 63 cols 266 entries
Finished phase 1 with 45 SingleSign rule and 9 generalized
[2026-05-25 02:40:04] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2127582267539387836.kers
Total runtime 1 ms.
[2026-05-25 02:40:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 02:40:04] [INFO ] Invariant cache hit.
[2026-05-25 02:40:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 02:40:04] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 65/71 places, 63/65 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 637 ms. Remains : 65/71 places, 63/65 transitions.
RANDOM walk for 40000 steps (5847 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3693 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Probably explored full state space saw : 156886 states, properties seen :0
Probabilistic random walk after 313773 steps, saw 156886 distinct states, run finished after 627 ms. (steps per millisecond=500 ) properties seen :0
Finished exhaustive random walk after 1451304 steps, run visited all 1 properties in 2964 ms. (steps per millisecond=489 )
Exhaustive walk after 1451304 steps, saw 725717 distinct states, run finished after 2969 ms. (steps per millisecond=488 ) properties seen :1
FORMULA DoubleExponent-PT-003-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 261 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 121 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 119 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 76 place count 119 transition count 103
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 88 place count 113 transition count 103
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 146 place count 84 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 80 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 79 transition count 73
Applied a total of 155 rules in 16 ms. Remains 79 /158 variables (removed 79) and now considering 73/148 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2309456700845503117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9546902748451940755.kers'
[2026-05-25 02:40:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2309456700845503117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9546902748451940755.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 73 rows 77 cols 266 entries
Finished phase 1 with 45 SingleSign rule and 19 generalized
[2026-05-25 02:40:08] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9546902748451940755.kers
Total runtime 0 ms.
[2026-05-25 02:40:08] [INFO ] Implicit Places using invariants in 58 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/158 places, 73/148 transitions.
Graph (complete) has 232 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 3 place count 76 transition count 71
Applied a total of 3 rules in 5 ms. Remains 76 /78 variables (removed 2) and now considering 71/73 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11549630923899591785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4643896075439414729.kers'
[2026-05-25 02:40:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11549630923899591785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4643896075439414729.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 71 rows 74 cols 258 entries
Finished phase 1 with 45 SingleSign rule and 17 generalized
[2026-05-25 02:40:08] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4643896075439414729.kers
Total runtime 0 ms.
[2026-05-25 02:40:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 02:40:08] [INFO ] Invariant cache hit.
[2026-05-25 02:40:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:40:08] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/158 places, 71/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 76/158 places, 71/148 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 215 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-00 finished in 533 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(p0)))))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15087169990268216720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1776612747260035739.kers'
[2026-05-25 02:40:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15087169990268216720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1776612747260035739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:40:08] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1776612747260035739.kers
Total runtime 1 ms.
[2026-05-25 02:40:08] [INFO ] Implicit Places using invariants in 71 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/158 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8289907045865184082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10552683694682694210.kers'
[2026-05-25 02:40:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8289907045865184082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10552683694682694210.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 156 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 15 generalized
[2026-05-25 02:40:08] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10552683694682694210.kers
Total runtime 1 ms.
[2026-05-25 02:40:08] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 02:40:08] [INFO ] Invariant cache hit.
[2026-05-25 02:40:09] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/158 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 452 ms. Remains : 156/158 places, 147/148 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(p0)))))'
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-04
Product exploration explored 100000 steps with 3290 reset in 187 ms.
Product exploration explored 100000 steps with 3291 reset in 160 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1332 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1135 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 274370 steps, run visited all 1 properties in 825 ms. (steps per millisecond=332 )
Probabilistic random walk after 274370 steps, saw 137215 distinct states, run finished after 825 ms. (steps per millisecond=332 ) properties seen :1
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 1239 ms.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 02:40:11] [INFO ] Invariant cache hit.
[2026-05-25 02:40:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 02:40:11] [INFO ] Invariant cache hit.
[2026-05-25 02:40:11] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 02:40:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 8/180 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 181 constraints, problems are : Problem set: 0 solved, 146 unsolved in 12267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/327 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 331 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42309ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 42311ms
Finished structural reductions in LTL mode , in 1 iterations and 42649 ms. Remains : 156/156 places, 147/147 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1311 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1146 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 274370 steps, run visited all 1 properties in 841 ms. (steps per millisecond=326 )
Probabilistic random walk after 274370 steps, saw 137215 distinct states, run finished after 841 ms. (steps per millisecond=326 ) properties seen :1
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 1125 ms.
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3334 reset in 66 ms.
Product exploration explored 100000 steps with 3299 reset in 75 ms.
Spot run failed in 85 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/ltsmin14478120800223486227
[2026-05-25 02:40:55] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14478120800223486227
Running compilation step : cd /tmp/ltsmin14478120800223486227;'/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 367 ms.
Running link step : cd /tmp/ltsmin14478120800223486227;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14478120800223486227;'/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/stateBased2310595168962366670.hoa' '--buchi-type=spotba'
LTSmin run took 1428 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-04 finished in 48640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F((!p0||(p1&&X(p2)))))))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9646938739259796295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16893010308525566757.kers'
[2026-05-25 02:40:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9646938739259796295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16893010308525566757.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:40:57] [INFO ] Computed 15 invariants in 4 ms
Computed 15 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16893010308525566757.kers
Total runtime 5 ms.
[2026-05-25 02:40:57] [INFO ] Implicit Places using invariants in 75 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/158 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 3 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-311730589755401778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10024181089757233874.kers'
[2026-05-25 02:40:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-311730589755401778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10024181089757233874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 156 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 15 generalized
[2026-05-25 02:40:57] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10024181089757233874.kers
Total runtime 1 ms.
[2026-05-25 02:40:57] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 02:40:57] [INFO ] Invariant cache hit.
[2026-05-25 02:40:57] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/158 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 451 ms. Remains : 156/158 places, 147/148 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(F((!p0||(p1&&X(p2)))))))))'
Stuttering acceptance computed with spot in 201 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-05 finished in 693 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(((F(p0) U X(X(p1))) U p2))))'
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-882687267814856451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5054042389917137707.kers'
[2026-05-25 02:40:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-882687267814856451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5054042389917137707.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:40:58] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5054042389917137707.kers
Total runtime 2 ms.
[2026-05-25 02:40:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 02:40:58] [INFO ] Invariant cache hit.
[2026-05-25 02:40:58] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-25 02:40:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/174 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 4/183 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 147 unsolved in 23128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 147/329 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 334 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 53154ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 53157ms
Finished structural reductions in LTL mode , in 1 iterations and 53487 ms. Remains : 158/158 places, 148/148 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(((F(p0) U X(X(p1))) U p2))))'
Stuttering acceptance computed with spot in 362 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-07
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-07 finished in 53895 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)||((!p1||X(G(!p0)))&&G((p2||X(!p1)))))))'
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2026-05-25 02:41:52] [INFO ] Invariant cache hit.
[2026-05-25 02:41:52] [INFO ] Implicit Places using invariants in 61 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/158 places, 148/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 157/158 places, 148/148 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((p1||X(p2)))&&(X(G(p0))||p3)))))'
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-08
Product exploration explored 100000 steps with 3292 reset in 209 ms.
Product exploration explored 100000 steps with 3303 reset in 225 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 37 factoid took 115 ms. Reduced automaton from 3 states, 16 edges and 4 AP (stutter sensitive) to 3 states, 16 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 18 to 13
RANDOM walk for 40000 steps (1321 resets) in 145 ms. (273 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40000 steps (1127 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1138 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1132 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1114 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1107 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1130 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1145 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1132 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1157 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14927137603377729766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11692231516266718875.kers'
[2026-05-25 02:41:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14927137603377729766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11692231516266718875.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 157 cols 407 entries
Finished phase 1 with 128 SingleSign rule and 15 generalized
[2026-05-25 02:41:53] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11692231516266718875.kers
Total runtime 1 ms.
Problem apf0 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/21 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 76/97 variables, 8/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 21/118 variables, 3/13 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/123 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 129/252 variables, 123/137 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/138 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Problem apf14 is UNSAT
At refinement iteration 14 (OVERLAPS) 39/291 variables, 26/164 constraints. Problems are: Problem set: 5 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/164 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 8/299 variables, 4/168 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 0/168 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 5/304 variables, 3/171 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/304 variables, 0/171 constraints. Problems are: Problem set: 5 solved, 5 unsolved
Problem apf6 is UNSAT
At refinement iteration 20 (OVERLAPS) 1/305 variables, 1/172 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/305 variables, 0/172 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/305 variables, 0/172 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 172 constraints, problems are : Problem set: 6 solved, 4 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/21 variables, 1/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 76/97 variables, 8/11 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/12 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 21/118 variables, 3/15 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/15 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 5/123 variables, 1/16 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/16 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 129/252 variables, 123/139 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 1/140 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 0/140 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 39/291 variables, 26/166 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 4/170 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/291 variables, 1/171 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/291 variables, 0/171 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 8/299 variables, 4/175 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/299 variables, 0/175 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 5/304 variables, 3/178 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/304 variables, 0/178 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 1/305 variables, 1/179 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/305 variables, 2/181 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/305 variables, 0/181 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/305 variables, 0/181 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 181 constraints, problems are : Problem set: 6 solved, 4 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1848ms problems are : Problem set: 6 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 856 ms.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 155 transition count 115
Reduce places removed 31 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 124 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 120 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 72 place count 120 transition count 104
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 86 place count 113 transition count 104
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 142 place count 85 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 81 transition count 76
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 159 place count 81 transition count 67
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 168 place count 72 transition count 67
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 178 place count 72 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 71 transition count 66
Applied a total of 179 rules in 20 ms. Remains 71 /157 variables (removed 86) and now considering 66/148 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 71/157 places, 66/148 transitions.
RANDOM walk for 40000 steps (3874 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2785 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2786 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2780 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2782 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1932 steps, run visited all 4 properties in 15 ms. (steps per millisecond=128 )
Probabilistic random walk after 1932 steps, saw 1008 distinct states, run finished after 15 ms. (steps per millisecond=128 ) properties seen :4
Found 8 invariant AP formulas.
Knowledge based reduction with 45 factoid took 206 ms. Reduced automaton from 3 states, 16 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 3884 ms.
Stuttering acceptance computed with spot in 120 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2026-05-25 02:41:56] [INFO ] Invariant cache hit.
[2026-05-25 02:41:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 02:41:56] [INFO ] Invariant cache hit.
[2026-05-25 02:41:56] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2026-05-25 02:41:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/305 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/305 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 179 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/305 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 147/326 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 147 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 331 constraints, problems are : Problem set: 0 solved, 147 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41704ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 41705ms
Finished structural reductions in LTL mode , in 1 iterations and 42002 ms. Remains : 157/157 places, 148/148 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 13 factoid took 73 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (1328 resets) in 78 ms. (506 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40002 steps (1126 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1122 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
[2026-05-25 02:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/66 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/117 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/122 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 129/251 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 40/291 variables, 27/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/299 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 5/304 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/304 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 1/305 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/305 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/305 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 173 constraints, problems are : Problem set: 0 solved, 2 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/51 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/66 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/117 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 5/122 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 129/251 variables, 122/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 40/291 variables, 27/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 8/299 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/304 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/304 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/305 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/305 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/305 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 823ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 308 ms.
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 110
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 119 transition count 108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 78 place count 117 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 90 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 150 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 77 transition count 72
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 166 place count 77 transition count 64
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 174 place count 69 transition count 64
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 184 place count 69 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 185 place count 68 transition count 63
Applied a total of 185 rules in 12 ms. Remains 68 /157 variables (removed 89) and now considering 63/148 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 68/157 places, 63/148 transitions.
RANDOM walk for 40000 steps (5088 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3331 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3377 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3104 steps, run visited all 2 properties in 17 ms. (steps per millisecond=182 )
Probabilistic random walk after 3104 steps, saw 1589 distinct states, run finished after 17 ms. (steps per millisecond=182 ) properties seen :2
Knowledge based reduction with 13 factoid took 113 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Knowledge-based reduction took 1649 ms.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 3336 reset in 100 ms.
Product exploration explored 100000 steps with 3315 reset in 211 ms.
Spot run failed in 50 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/ltsmin7120167145500943175
[2026-05-25 02:42:40] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7120167145500943175
Running compilation step : cd /tmp/ltsmin7120167145500943175;'/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 241 ms.
Running link step : cd /tmp/ltsmin7120167145500943175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7120167145500943175;'/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/stateBased4435123366191476100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2026-05-25 02:42:56] [INFO ] Invariant cache hit.
[2026-05-25 02:42:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 02:42:56] [INFO ] Invariant cache hit.
[2026-05-25 02:42:56] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 157/157 places, 148/148 transitions.
Built C files in :
/tmp/ltsmin8836529757308950754
[2026-05-25 02:42:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8836529757308950754
Running compilation step : cd /tmp/ltsmin8836529757308950754;'/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 243 ms.
Running link step : cd /tmp/ltsmin8836529757308950754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8836529757308950754;'/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/stateBased1021230777605754512.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 02:43:12] [INFO ] Flatten gal took : 13 ms
[2026-05-25 02:43:12] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:43:12] [INFO ] Time to serialize gal into /tmp/LTL8619172171154839779.gal : 2 ms
[2026-05-25 02:43:12] [INFO ] Time to serialize properties into /tmp/LTL12725638396163902224.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8619172171154839779.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17286001371850356413.hoa' '-atoms' '/tmp/LTL12725638396163902224.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12725638396163902224.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17286001371850356413.hoa
Detected timeout of ITS tools.
[2026-05-25 02:43:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:43:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 02:43:27] [INFO ] Time to serialize gal into /tmp/LTL6108593255560473317.gal : 2 ms
[2026-05-25 02:43:27] [INFO ] Time to serialize properties into /tmp/LTL7000900106628266072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6108593255560473317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7000900106628266072.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p10<1)||(p16<1))&&((p157<1)||(p84<1)))"))||((G(("(p72<1)")||(X("((p157<1)||(p84<1))"))))&&(("((p157<1)||(p84<1))")||(X(G("...205
Formula 0 simplified : G(F!"(((p10<1)||(p16<1))&&((p157<1)||(p84<1)))" & (F(!"(p72<1)" & X!"((p157<1)||(p84<1))") | (!"((p157<1)||(p84<1))" & XF!"(((p10<1)...191
Detected timeout of ITS tools.
[2026-05-25 02:43:42] [INFO ] Flatten gal took : 8 ms
[2026-05-25 02:43:42] [INFO ] Applying decomposition
[2026-05-25 02:43:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2720273954223398983.txt' '-o' '/tmp/graph2720273954223398983.bin' '-w' '/tmp/graph2720273954223398983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2720273954223398983.bin' '-l' '-1' '-v' '-w' '/tmp/graph2720273954223398983.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:43:42] [INFO ] Decomposing Gal with order
[2026-05-25 02:43:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 02:43:42] [INFO ] Removed a total of 39 redundant transitions.
[2026-05-25 02:43:42] [INFO ] Flatten gal took : 236 ms
[2026-05-25 02:43:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2026-05-25 02:43:42] [INFO ] Time to serialize gal into /tmp/LTL17990116011969805363.gal : 5 ms
[2026-05-25 02:43:42] [INFO ] Time to serialize properties into /tmp/LTL1075742715910572940.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17990116011969805363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1075742715910572940.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i3.u0.p10<1)||(i3.u25.p16<1))&&((i2.i0.u23.p157<1)||(i2.i1.u55.p84<1)))"))||((G(("(i1.i0.u8.p72<1)")||(X("((i2.i0.u23.p157...320
Formula 0 simplified : G(F!"(((i3.u0.p10<1)||(i3.u25.p16<1))&&((i2.i0.u23.p157<1)||(i2.i1.u55.p84<1)))" & (F(!"(i1.i0.u8.p72<1)" & X!"((i2.i0.u23.p157<1)||...306
Reverse transition relation is NOT exact ! Due to transitions t3, t27, t40, t43, t50, t53, t56, t59, t66, t95, t106, t119, t132, t142, i0.t20, i0.i0.u9.t10...504
Computing Next relation with stutter on 254172 deadlock states
Detected timeout of ITS tools.
Treatment of property DoubleExponent-PT-003-LTLFireability-08 finished in 126036 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&&F((p1&&X(p2)))&&(G(p0) U !p1)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9959862794058034149.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18273902777503723124.kers'
[2026-05-25 02:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9959862794058034149.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18273902777503723124.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:43:58] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18273902777503723124.kers
Total runtime 2 ms.
[2026-05-25 02:43:58] [INFO ] Implicit Places using invariants in 74 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/158 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 2 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5425753352442482031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17995884235830948867.kers'
[2026-05-25 02:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5425753352442482031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17995884235830948867.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 156 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 15 generalized
[2026-05-25 02:43:58] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17995884235830948867.kers
Total runtime 1 ms.
[2026-05-25 02:43:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 02:43:58] [INFO ] Invariant cache hit.
[2026-05-25 02:43:58] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/158 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 417 ms. Remains : 156/158 places, 147/148 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&&F((p1&&X(p2)))&&(G(p0) U !p1)))))'
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p0) p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-09
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-09 finished in 787 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 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 121 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 74 place count 120 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 86 place count 114 transition count 104
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 142 place count 86 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 82 transition count 76
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 82 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 81 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 81 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 80 transition count 74
Applied a total of 155 rules in 23 ms. Remains 80 /158 variables (removed 78) and now considering 74/148 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10185073111411487286.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16580686356558048743.kers'
[2026-05-25 02:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10185073111411487286.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16580686356558048743.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 78 cols 273 entries
Finished phase 1 with 50 SingleSign rule and 15 generalized
[2026-05-25 02:43:58] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16580686356558048743.kers
Total runtime 0 ms.
[2026-05-25 02:43:58] [INFO ] Implicit Places using invariants in 65 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/158 places, 74/148 transitions.
Graph (complete) has 234 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 3 place count 77 transition count 72
Applied a total of 3 rules in 4 ms. Remains 77 /79 variables (removed 2) and now considering 72/74 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9307869421032755610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8826313934443251156.kers'
[2026-05-25 02:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9307869421032755610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8826313934443251156.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 72 rows 75 cols 265 entries
Finished phase 1 with 48 SingleSign rule and 15 generalized
[2026-05-25 02:43:58] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8826313934443251156.kers
Total runtime 1 ms.
[2026-05-25 02:43:58] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 02:43:58] [INFO ] Invariant cache hit.
[2026-05-25 02:43:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/158 places, 72/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 77/158 places, 72/148 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 37 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-10 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 111
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 121 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 119 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 76 place count 119 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 86 place count 114 transition count 104
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 144 place count 85 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 82 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 81 transition count 74
Applied a total of 151 rules in 19 ms. Remains 81 /158 variables (removed 77) and now considering 74/148 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8944851758185331912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9820137685599339102.kers'
[2026-05-25 02:43:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8944851758185331912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9820137685599339102.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 74 rows 79 cols 265 entries
Finished phase 1 with 47 SingleSign rule and 19 generalized
[2026-05-25 02:43:59] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9820137685599339102.kers
Total runtime 2 ms.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants in 56 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/158 places, 74/148 transitions.
Graph (complete) has 232 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 3 place count 78 transition count 72
Applied a total of 3 rules in 3 ms. Remains 78 /80 variables (removed 2) and now considering 72/74 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9381403897076893737.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2406972530221236741.kers'
[2026-05-25 02:43:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9381403897076893737.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2406972530221236741.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 72 rows 76 cols 257 entries
Finished phase 1 with 47 SingleSign rule and 17 generalized
[2026-05-25 02:43:59] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2406972530221236741.kers
Total runtime 1 ms.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 02:43:59] [INFO ] Invariant cache hit.
[2026-05-25 02:43:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/158 places, 72/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 78/158 places, 72/148 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-11
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-11 finished in 396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(((p1 U p2) U X(X((p3&&X(G(p4)))))))))'
Support contains 7 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4280388647998022140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15442452305534782501.kers'
[2026-05-25 02:43:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4280388647998022140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15442452305534782501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:43:59] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15442452305534782501.kers
Total runtime 2 ms.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants in 61 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/158 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 2 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13409730001609127830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2877129526622499531.kers'
[2026-05-25 02:43:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13409730001609127830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2877129526622499531.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 156 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 15 generalized
[2026-05-25 02:43:59] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2877129526622499531.kers
Total runtime 1 ms.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 02:43:59] [INFO ] Invariant cache hit.
[2026-05-25 02:43:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/158 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 361 ms. Remains : 156/158 places, 147/148 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(((p1 U p2) U X(X((p3&&X(G(p4)))))))))'
Stuttering acceptance computed with spot in 3000 ms :[(OR (NOT p3) (NOT p4)), (OR (NOT p4) (NOT p3)), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), true, (NOT p4), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (NOT p3) (NOT p4)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (NOT p4), (NOT p4), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), (NOT p4), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4), (NOT p4), (NOT p4), (AND (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4)), (NOT p2), (AND (NOT p2) (NOT p4)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4))), (AND (NOT p2) (NOT p4)), (AND (NOT p2) p3 (NOT p4)), (AND (NOT p2) p3 (NOT p4))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-12 finished in 3558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 157 transition count 110
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 120 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 74 place count 120 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 114 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 146 place count 84 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 154 place count 80 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 79 transition count 73
Applied a total of 155 rules in 14 ms. Remains 79 /158 variables (removed 79) and now considering 73/148 (removed 75) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16369705740907252916.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16662543196872503729.kers'
[2026-05-25 02:44:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16369705740907252916.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16662543196872503729.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 73 rows 78 cols 276 entries
Finished phase 1 with 49 SingleSign rule and 15 generalized
[2026-05-25 02:44:03] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16662543196872503729.kers
Total runtime 0 ms.
[2026-05-25 02:44:03] [INFO ] Implicit Places using invariants in 44 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/158 places, 73/148 transitions.
Graph (complete) has 233 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 3 place count 76 transition count 71
Applied a total of 3 rules in 2 ms. Remains 76 /78 variables (removed 2) and now considering 71/73 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7839001956589423563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17851366976489746217.kers'
[2026-05-25 02:44:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7839001956589423563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17851366976489746217.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 71 rows 75 cols 268 entries
Finished phase 1 with 47 SingleSign rule and 15 generalized
[2026-05-25 02:44:03] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17851366976489746217.kers
Total runtime 3 ms.
[2026-05-25 02:44:03] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 02:44:03] [INFO ] Invariant cache hit.
[2026-05-25 02:44:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 02:44:03] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/158 places, 71/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 76/158 places, 71/148 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((p0||X(G(p1))))))'
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 4 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8076362584658736540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14268506462805697456.kers'
[2026-05-25 02:44:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8076362584658736540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14268506462805697456.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 148 rows 158 cols 410 entries
Finished phase 1 with 134 SingleSign rule and 9 generalized
[2026-05-25 02:44:03] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14268506462805697456.kers
Total runtime 2 ms.
[2026-05-25 02:44:03] [INFO ] Implicit Places using invariants in 64 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/158 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 2 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3729158103989993891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-710207296025641309.kers'
[2026-05-25 02:44:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3729158103989993891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-710207296025641309.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 156 cols 405 entries
Finished phase 1 with 127 SingleSign rule and 15 generalized
[2026-05-25 02:44:03] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-710207296025641309.kers
Total runtime 1 ms.
[2026-05-25 02:44:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 02:44:03] [INFO ] Invariant cache hit.
[2026-05-25 02:44:03] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/158 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 405 ms. Remains : 156/158 places, 147/148 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)&&G((p0||X(G(p1))))))'
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-15 finished in 584 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)||((!p1||X(G(!p0)))&&G((p2||X(!p1)))))))'
Spot run failed in 48 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 02:44:04] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3456329204626174235
[2026-05-25 02:44:04] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2026-05-25 02:44:04] [INFO ] Applying decomposition
[2026-05-25 02:44:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:44:04] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2026-05-25 02:44:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:44:04] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11557716834761684298.txt' '-o' '/tmp/graph11557716834761684298.bin' '-w' '/tmp/graph11557716834761684298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11557716834761684298.bin' '-l' '-1' '-v' '-w' '/tmp/graph11557716834761684298.weights' '-q' '0' '-e' '0.001'
[2026-05-25 02:44:04] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2026-05-25 02:44:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 02:44:04] [INFO ] Decomposing Gal with order
[2026-05-25 02:44:04] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3456329204626174235
[2026-05-25 02:44:04] [INFO ] Rewriting arrays to variables to allow decomposition.
Running compilation step : cd /tmp/ltsmin3456329204626174235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 02:44:04] [INFO ] Removed a total of 39 redundant transitions.
[2026-05-25 02:44:04] [INFO ] Flatten gal took : 23 ms
[2026-05-25 02:44:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 6 ms.
[2026-05-25 02:44:04] [INFO ] Time to serialize gal into /tmp/LTLFireability18034727495947282932.gal : 3 ms
[2026-05-25 02:44:04] [INFO ] Time to serialize properties into /tmp/LTLFireability1129070104353772610.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18034727495947282932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1129070104353772610.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(!("(((i6.i0.u0.p10>=1)&&(i5.i2.u30.p16>=1))||((i3.i0.u28.p157>=1)&&(i1.i1.u61.p84>=1)))")))||(((!("((i3.i0.u28.p157>=1)&&(i1.i...354
Formula 0 simplified : G(F"(((i6.i0.u0.p10>=1)&&(i5.i2.u30.p16>=1))||((i3.i0.u28.p157>=1)&&(i1.i1.u61.p84>=1)))" & (F(!"(i4.u10.p72<1)" & X"((i3.i0.u28.p15...324
Compilation finished in 300 ms.
Running link step : cd /tmp/ltsmin3456329204626174235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3456329204626174235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](!(LTLAPp0==true))||((!(LTLAPp1==true)||X([](!(LTLAPp0==true))))&&[](((LTLAPp2==true)||X(!(LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t3, t27, t40, t43, t59, t102, t119, t132, t135, t137, t145, i1.t106, i1.t53, i1.i2.t95, i1.i2...511
Computing Next relation with stutter on 254172 deadlock states
LTSmin run took 24750 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 349224 ms.
BK_STOP 1779677069212
--------------------
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-tall-177955695800868"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 ;