About the Execution of ITS-Tools for IBM703-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 650.747 | 564598.00 | 631152.00 | 1580.50 | TFFTFTTFFTFFFTFF | 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.r162-smll-177961107700092.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 IBM703-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 13K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-LTLFireability-00
FORMULA_NAME IBM703-PT-none-LTLFireability-01
FORMULA_NAME IBM703-PT-none-LTLFireability-02
FORMULA_NAME IBM703-PT-none-LTLFireability-03
FORMULA_NAME IBM703-PT-none-LTLFireability-04
FORMULA_NAME IBM703-PT-none-LTLFireability-05
FORMULA_NAME IBM703-PT-none-LTLFireability-06
FORMULA_NAME IBM703-PT-none-LTLFireability-07
FORMULA_NAME IBM703-PT-none-LTLFireability-08
FORMULA_NAME IBM703-PT-none-LTLFireability-09
FORMULA_NAME IBM703-PT-none-LTLFireability-10
FORMULA_NAME IBM703-PT-none-LTLFireability-11
FORMULA_NAME IBM703-PT-none-LTLFireability-12
FORMULA_NAME IBM703-PT-none-LTLFireability-13
FORMULA_NAME IBM703-PT-none-LTLFireability-14
FORMULA_NAME IBM703-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779724087102
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 15:48:09] [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 15:48:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:48:09] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2026-05-25 15:48:09] [INFO ] Transformed 262 places.
[2026-05-25 15:48:09] [INFO ] Transformed 284 transitions.
[2026-05-25 15:48:09] [INFO ] Found NUPN structural information;
[2026-05-25 15:48:09] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBM703-PT-none-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 31 place count 231 transition count 259
Iterating global reduction 1 with 25 rules applied. Total rules applied 56 place count 231 transition count 259
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 221 transition count 249
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 221 transition count 249
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 216 transition count 244
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 216 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 216 transition count 243
Applied a total of 87 rules in 158 ms. Remains 216 /262 variables (removed 46) and now considering 243/284 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-206275460027956014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15804216778884580939.kers'
[2026-05-25 15:48:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-206275460027956014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15804216778884580939.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 243 rows 216 cols 487 entries
Finished phase 1 with 216 SingleSign rule and 0 generalized
[2026-05-25 15:48:10] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-15804216778884580939.kers
Total runtime 4 ms.
[2026-05-25 15:48:10] [INFO ] Implicit Places using invariants in 436 ms returned []
[2026-05-25 15:48:10] [INFO ] Invariant cache hit.
[2026-05-25 15:48:11] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2026-05-25 15:48:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 243/458 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 1/459 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 216 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30042 ms.
Refiners :[State Equation: 216/216 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 243/458 variables, 215/215 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/458 variables, 242/457 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (OVERLAPS) 1/459 variables, 1/458 constraints. Problems are: Problem set: 0 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 458 constraints, problems are : Problem set: 0 solved, 242 unsolved in 30021 ms.
Refiners :[State Equation: 216/216 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 216/262 places, 243/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61272 ms. Remains : 216/262 places, 243/284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 216 /216 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2026-05-25 15:49:11] [INFO ] Invariant cache hit.
[2026-05-25 15:49:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 15:49:11] [INFO ] Invariant cache hit.
[2026-05-25 15:49:11] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 216/216 places, 243/243 transitions.
Support contains 34 out of 216 places after structural reductions.
[2026-05-25 15:49:12] [INFO ] Flatten gal took : 71 ms
[2026-05-25 15:49:12] [INFO ] Flatten gal took : 31 ms
[2026-05-25 15:49:12] [INFO ] Input system was already deterministic with 243 transitions.
RANDOM walk for 40000 steps (690 resets) in 1462 ms. (27 steps per ms) remains 1/33 properties
BEST_FIRST walk for 40001 steps (496 resets) in 369 ms. (108 steps per ms) remains 1/1 properties
[2026-05-25 15:49:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/37 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/61 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/89 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/116 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/144 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/173 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/173 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 28/201 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/223 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/223 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/245 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/245 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 26/271 variables, 11/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/271 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 34/305 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/305 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 29/334 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/334 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 26/360 variables, 14/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/360 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 24/384 variables, 11/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/384 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 21/405 variables, 11/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/405 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 16/421 variables, 7/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/421 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 14/435 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/435 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 8/443 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/443 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 8/451 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/451 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp32 is UNSAT
After SMT solving in domain Real declared 457/459 variables, and 215 constraints, problems are : Problem set: 1 solved, 0 unsolved in 621 ms.
Refiners :[State Equation: 215/216 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA IBM703-PT-none-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 216 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 216 transition count 243
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA IBM703-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X(p0)&&F((G(F(p1))||(F(p1)&&(p2||G(F(p3)))))))))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 204 transition count 231
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 204 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 204 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 198 transition count 224
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 198 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 193 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 193 transition count 219
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 188 transition count 214
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 188 transition count 214
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 184 transition count 210
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 184 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 180 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 180 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 177 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 177 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 176 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 176 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 175 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 175 transition count 201
Applied a total of 83 rules in 47 ms. Remains 175 /216 variables (removed 41) and now considering 201/243 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13387669326934252295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5105201806632270509.kers'
[2026-05-25 15:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13387669326934252295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5105201806632270509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 175 cols 404 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-25 15:49:14] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5105201806632270509.kers
Total runtime 2 ms.
[2026-05-25 15:49:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 15:49:14] [INFO ] Invariant cache hit.
[2026-05-25 15:49:14] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-25 15:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/375 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/376 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 175 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30019 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/375 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 200/374 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 1/376 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 375 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30019 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60074ms
Starting structural reductions in LTL mode, iteration 1 : 175/216 places, 201/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60432 ms. Remains : 175/216 places, 201/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(X(p0)&&F((G(F(p1))||(F(p1)&&(p2||G(F(p3)))))))))'
Stuttering acceptance computed with spot in 640 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 516 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Computed a total of 175 stabilizing places and 201 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 201
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 29 factoid took 31 ms. Proved property starting from automaton with 10 states, 22 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 196 ms.
FORMULA IBM703-PT-none-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-00 finished in 62301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!p0)&&(!p0||(F(p1) U X(p2))))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 204 transition count 231
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 204 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 204 transition count 230
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 197 transition count 223
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 197 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 197 transition count 222
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 192 transition count 217
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 192 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 187 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 187 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 183 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 183 transition count 208
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 180 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 180 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 178 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 177 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 176 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 176 transition count 201
Applied a total of 82 rules in 49 ms. Remains 176 /216 variables (removed 40) and now considering 201/243 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-564224268861235090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9917732088074942566.kers'
[2026-05-25 15:50:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-564224268861235090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9917732088074942566.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 176 cols 404 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-25 15:50:16] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9917732088074942566.kers
Total runtime 3 ms.
[2026-05-25 15:50:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 15:50:16] [INFO ] Invariant cache hit.
[2026-05-25 15:50:16] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-25 15:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/376 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/377 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 377/377 variables, and 176 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30015 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 201/376 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 200/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 1/377 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/377 variables, and 376 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30015 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 176/216 places, 201/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60372 ms. Remains : 176/216 places, 201/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&(p0||(F(p1) U X(p2))))))'
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-02 finished in 60756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U !p1) U !p2)))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 205 transition count 232
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 205 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 205 transition count 231
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 199 transition count 225
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 199 transition count 225
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 194 transition count 220
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 194 transition count 220
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 189 transition count 215
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 189 transition count 215
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 184 transition count 210
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 184 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 179 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 179 transition count 205
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 175 transition count 201
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 175 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 173 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 173 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 171 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 171 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 170 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 170 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 169 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 169 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 168 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 168 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 168 transition count 193
Applied a total of 98 rules in 55 ms. Remains 168 /216 variables (removed 48) and now considering 193/243 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16239248258383562045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2153068219811363860.kers'
[2026-05-25 15:51:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16239248258383562045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2153068219811363860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 168 cols 387 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-25 15:51:17] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2153068219811363860.kers
Total runtime 3 ms.
[2026-05-25 15:51:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 15:51:17] [INFO ] Invariant cache hit.
[2026-05-25 15:51:17] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2026-05-25 15:51:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 193/360 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (OVERLAPS) 1/361 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/361 variables, and 168 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30016 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 193/360 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 192/359 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 1/361 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/361 variables, and 360 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30016 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 168/216 places, 193/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60379 ms. Remains : 168/216 places, 193/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U !p1) U !p2)))'
Stuttering acceptance computed with spot in 135 ms :[p2, p2, true, p1]
Running random walk in product with property : IBM703-PT-none-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Computed a total of 168 stabilizing places and 193 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 193
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 18 factoid took 15 ms. Proved property starting from automaton with 4 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 106 ms.
FORMULA IBM703-PT-none-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-03 finished in 60862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Graph (complete) has 244 edges and 216 vertex of which 82 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.3 ms
Discarding 134 places :
Also discarding 150 output transitions
Drop transitions (Output transitions of discarded places.) removed 150 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 81 transition count 31
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 66 rules applied. Total rules applied 128 place count 20 transition count 26
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 131 place count 17 transition count 26
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 131 place count 17 transition count 21
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 141 place count 12 transition count 21
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 11 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 11 transition count 19
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 153 place count 6 transition count 13
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 156 place count 6 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 159 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 160 place count 5 transition count 7
Applied a total of 160 rules in 58 ms. Remains 5 /216 variables (removed 211) and now considering 7/243 (removed 236) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15905163586132061325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9381232593894671928.kers'
[2026-05-25 15:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15905163586132061325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9381232593894671928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 12 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-25 15:52:18] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9381232593894671928.kers
Total runtime 2 ms.
[2026-05-25 15:52:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 15:52:18] [INFO ] Invariant cache hit.
[2026-05-25 15:52:18] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2026-05-25 15:52:18] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-25 15:52:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 124 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 1/12 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 119 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 246ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/216 places, 7/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 5/216 places, 7/243 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 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-04
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-04 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X((p1&&X(p2))) U ((p3&&X((p1&&X(p2))))||X(G((p1&&X(p2)))))))))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 206 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 206 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 206 transition count 232
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 200 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 200 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 200 transition count 225
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 196 transition count 221
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 196 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 192 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 192 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 188 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 188 transition count 213
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 185 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 185 transition count 210
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 182 transition count 207
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 182 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 180 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 180 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 178 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 177 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 176 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 176 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 175 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 175 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 175 transition count 199
Applied a total of 85 rules in 52 ms. Remains 175 /216 variables (removed 41) and now considering 199/243 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14038699996620125239.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15970955616532854458.kers'
[2026-05-25 15:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14038699996620125239.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15970955616532854458.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 175 cols 399 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-25 15:52:18] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15970955616532854458.kers
Total runtime 2 ms.
[2026-05-25 15:52:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 15:52:18] [INFO ] Invariant cache hit.
[2026-05-25 15:52:19] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-25 15:52:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/374 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/374 variables, and 175 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/373 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 198/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/374 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 373 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30020 ms.
Refiners :[State Equation: 175/175 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 175/216 places, 199/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60376 ms. Remains : 175/216 places, 199/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((X((p1&&X(p2))) U ((p3&&X((p1&&X(p2))))||X(G((p1&&X(p2)))))))))'
Stuttering acceptance computed with spot in 368 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-05
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Product exploration explored 100000 steps with 25000 reset in 172 ms.
Computed a total of 175 stabilizing places and 199 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 199
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 28 factoid took 187 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (751 resets) in 144 ms. (275 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (511 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
[2026-05-25 15:53:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/19 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/32 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/47 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/61 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/61 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/79 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/105 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 33/138 variables, 15/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/138 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/170 variables, 15/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/170 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 24/194 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/194 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 17/211 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/211 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 18/229 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/229 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 244/374 variables, and 114 constraints, problems are : Problem set: 1 solved, 0 unsolved in 220 ms.
Refiners :[State Equation: 114/175 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 29 factoid took 185 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1100 ms.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 175 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 175 /175 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2026-05-25 15:53:21] [INFO ] Invariant cache hit.
[2026-05-25 15:53:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 15:53:21] [INFO ] Invariant cache hit.
[2026-05-25 15:53:21] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 175/175 places, 199/199 transitions.
Computed a total of 175 stabilizing places and 199 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 175 transition count 199
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 585 steps (13 resets) in 10 ms. (53 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 517 ms.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 128 ms.
Spot run failed in 144 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/ltsmin3517838873778869390
[2026-05-25 15:53:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3517838873778869390
Running compilation step : cd /tmp/ltsmin3517838873778869390;'/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 782 ms.
Running link step : cd /tmp/ltsmin3517838873778869390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 70 ms.
Running LTSmin : cd /tmp/ltsmin3517838873778869390;'/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/stateBased8159725437294369152.hoa' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA IBM703-PT-none-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM703-PT-none-LTLFireability-05 finished in 65175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F((G(F(p1))||G(p2)))))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 205 transition count 232
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 205 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 205 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 198 transition count 224
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 198 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 198 transition count 223
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 193 transition count 218
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 193 transition count 218
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 188 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 188 transition count 213
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 183 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 183 transition count 208
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 178 transition count 203
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 178 transition count 203
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 174 transition count 199
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 174 transition count 199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 172 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 172 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 170 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 169 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 168 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 167 transition count 192
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 167 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 167 transition count 191
Applied a total of 101 rules in 38 ms. Remains 167 /216 variables (removed 49) and now considering 191/243 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2159677008885248451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2285128891471318225.kers'
[2026-05-25 15:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2159677008885248451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2285128891471318225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 167 cols 383 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-25 15:53:23] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2285128891471318225.kers
Total runtime 1 ms.
[2026-05-25 15:53:23] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 15:53:23] [INFO ] Invariant cache hit.
[2026-05-25 15:53:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-25 15:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/358 variables, and 167 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30014 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 190/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 1/358 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 357 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30016 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 167/216 places, 191/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60339 ms. Remains : 167/216 places, 191/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F((G(F(p1))||G(p2)))))))'
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Product exploration explored 100000 steps with 33333 reset in 114 ms.
Computed a total of 167 stabilizing places and 191 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 167 transition count 191
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 5 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 132 ms.
FORMULA IBM703-PT-none-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-06 finished in 60886 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 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Graph (complete) has 244 edges and 216 vertex of which 66 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.2 ms
Discarding 150 places :
Also discarding 167 output transitions
Drop transitions (Output transitions of discarded places.) removed 167 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 65 transition count 27
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 56 rules applied. Total rules applied 105 place count 17 transition count 19
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 12 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 110 place count 12 transition count 16
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 116 place count 9 transition count 16
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 7 transition count 13
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 7 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 3 with 2 rules applied. Total rules applied 122 place count 7 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 123 place count 6 transition count 11
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 127 place count 4 transition count 8
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 129 place count 4 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 131 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 132 place count 3 transition count 4
Applied a total of 132 rules in 16 ms. Remains 3 /216 variables (removed 213) and now considering 4/243 (removed 239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14550264184830738803.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11373447060793043377.kers'
[2026-05-25 15:54:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14550264184830738803.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11373447060793043377.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:54:24] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11373447060793043377.kers
Total runtime 1 ms.
[2026-05-25 15:54:24] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 15:54:24] [INFO ] Invariant cache hit.
[2026-05-25 15:54:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-25 15:54:24] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:54:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 61 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 53 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/216 places, 4/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 3/216 places, 4/243 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 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 4 steps with 1 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-07 finished in 350 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 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Graph (complete) has 244 edges and 216 vertex of which 185 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 184 transition count 72
Reduce places removed 138 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 166 rules applied. Total rules applied 306 place count 46 transition count 44
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 24 rules applied. Total rules applied 330 place count 28 transition count 38
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 334 place count 24 transition count 38
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 334 place count 24 transition count 32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 346 place count 18 transition count 32
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 348 place count 16 transition count 29
Iterating global reduction 4 with 2 rules applied. Total rules applied 350 place count 16 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 352 place count 16 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 15 transition count 27
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 14 transition count 26
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 14 transition count 26
Performed 10 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 375 place count 4 transition count 11
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 380 place count 4 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 382 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 383 place count 3 transition count 4
Applied a total of 383 rules in 16 ms. Remains 3 /216 variables (removed 213) and now considering 4/243 (removed 239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5939803363386547393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17481132481633219374.kers'
[2026-05-25 15:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5939803363386547393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17481132481633219374.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:54:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17481132481633219374.kers
Total runtime 1 ms.
[2026-05-25 15:54:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 15:54:25] [INFO ] Invariant cache hit.
[2026-05-25 15:54:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 15:54:25] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/216 places, 4/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 3/216 places, 4/243 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 49 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-09
Product exploration explored 100000 steps with 33329 reset in 58 ms.
Product exploration explored 100000 steps with 33253 reset in 241 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 17 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 50 ms.
FORMULA IBM703-PT-none-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLFireability-09 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F((p0&&G(p1))) U X(p2)) U p3))'
Support contains 4 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 206 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 206 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 206 transition count 232
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 200 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 200 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 200 transition count 225
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 196 transition count 221
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 196 transition count 221
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 192 transition count 217
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 192 transition count 217
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 188 transition count 213
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 188 transition count 213
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 184 transition count 209
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 184 transition count 209
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 181 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 181 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 180 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 180 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 179 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 179 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 178 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 177 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 176 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 176 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 176 transition count 200
Applied a total of 83 rules in 48 ms. Remains 176 /216 variables (removed 40) and now considering 200/243 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1729646066198602376.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7235006554617445522.kers'
[2026-05-25 15:54:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1729646066198602376.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7235006554617445522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 176 cols 401 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-25 15:54:25] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7235006554617445522.kers
Total runtime 2 ms.
[2026-05-25 15:54:25] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 15:54:25] [INFO ] Invariant cache hit.
[2026-05-25 15:54:25] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-25 15:54:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/375 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 1/376 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30014 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/375 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 199/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 1/376 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 375 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30016 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Starting structural reductions in LTL mode, iteration 1 : 176/216 places, 200/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60365 ms. Remains : 176/216 places, 200/243 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(p1))) U X(p2)) U p3))'
Stuttering acceptance computed with spot in 227 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 2698 steps with 1070 reset in 5 ms.
FORMULA IBM703-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-10 finished in 60674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F((p1||G(p2)))))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 206 transition count 233
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 206 transition count 233
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 200 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 200 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 200 transition count 226
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 195 transition count 221
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 195 transition count 221
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 190 transition count 216
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 190 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 186 transition count 212
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 186 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 182 transition count 208
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 182 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 178 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 178 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 176 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 176 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 174 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 174 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 173 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 173 transition count 199
Applied a total of 87 rules in 21 ms. Remains 173 /216 variables (removed 43) and now considering 199/243 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7711709740622854927.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6333167185922885939.kers'
[2026-05-25 15:55:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7711709740622854927.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6333167185922885939.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 173 cols 400 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-25 15:55:26] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6333167185922885939.kers
Total runtime 1 ms.
[2026-05-25 15:55:26] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 15:55:26] [INFO ] Invariant cache hit.
[2026-05-25 15:55:26] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-25 15:55:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/371 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 1/372 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 0/372 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 173 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30007 ms.
Refiners :[State Equation: 173/173 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 199/371 variables, 172/172 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 198/370 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 1/372 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 371 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30012 ms.
Refiners :[State Equation: 173/173 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60029ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60030ms
Starting structural reductions in LTL mode, iteration 1 : 173/216 places, 199/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60216 ms. Remains : 173/216 places, 199/243 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F((p1||G(p2)))))))'
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-11 finished in 60488 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((G(p0)||(p1&&X(p2)))))'
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 205 transition count 232
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 205 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 205 transition count 231
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 199 transition count 225
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 199 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 199 transition count 224
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 195 transition count 220
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 195 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 192 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 192 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 189 transition count 214
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 189 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 186 transition count 211
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 186 transition count 211
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 183 transition count 208
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 183 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 181 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 181 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 179 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 179 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 178 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 177 transition count 202
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 177 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 176 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 176 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 176 transition count 200
Applied a total of 83 rules in 42 ms. Remains 176 /216 variables (removed 40) and now considering 200/243 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7770993278124004553.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10477883705726686783.kers'
[2026-05-25 15:56:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7770993278124004553.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10477883705726686783.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 176 cols 401 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-25 15:56:26] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10477883705726686783.kers
Total runtime 2 ms.
[2026-05-25 15:56:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 15:56:26] [INFO ] Invariant cache hit.
[2026-05-25 15:56:27] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-25 15:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/375 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (OVERLAPS) 1/376 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30009 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 200/375 variables, 175/175 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 199/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 1/376 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/376 variables, and 375 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60036ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60037ms
Starting structural reductions in LTL mode, iteration 1 : 176/216 places, 200/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60359 ms. Remains : 176/216 places, 200/243 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((G(p0)||(p1&&X(p2)))))'
Stuttering acceptance computed with spot in 166 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-13
Product exploration explored 100000 steps with 1823 reset in 272 ms.
Product exploration explored 100000 steps with 1865 reset in 224 ms.
Computed a total of 176 stabilizing places and 200 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 176 transition count 200
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 22 factoid took 69 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (737 resets) in 484 ms. (82 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (529 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
[2026-05-25 15:57:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/21 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/35 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 15/50 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 16/66 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/83 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/83 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 15/98 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/119 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/119 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 25/144 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/144 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 24/168 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 25/193 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/193 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 28/221 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 26/247 variables, 13/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/247 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 17/264 variables, 9/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/264 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 18/282 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/282 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 16/298 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/298 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 21/319 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/319 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 20/339 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/339 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 14/353 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/353 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 9/362 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/362 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 5/367 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/367 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 4/371 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/371 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 4/375 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/375 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/376 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 0/376 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/21 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/35 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/50 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 16/66 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/66 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 17/83 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 15/98 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/98 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 21/119 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/119 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 25/144 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/144 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 24/168 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 25/193 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/193 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 28/221 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 26/247 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/247 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 17/264 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/264 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 18/282 variables, 8/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/282 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 16/298 variables, 8/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/298 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 21/319 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/319 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 20/339 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/339 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 14/353 variables, 7/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/353 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 9/362 variables, 5/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/362 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 5/367 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/367 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 4/371 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/371 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 4/375 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/375 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Int declared 376/376 variables, and 177 constraints, problems are : Problem set: 1 solved, 0 unsolved in 367 ms.
Refiners :[State Equation: 176/176 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 760ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 23 factoid took 160 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Knowledge-based reduction took 1388 ms.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 200/200 transitions.
Graph (complete) has 201 edges and 176 vertex of which 79 are kept as prefixes of interest. Removing 97 places using SCC suffix rule.1 ms
Discarding 97 places :
Also discarding 108 output transitions
Drop transitions (Output transitions of discarded places.) removed 108 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 78 transition count 33
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 21 transition count 30
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 19 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 126 place count 17 transition count 27
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 126 place count 17 transition count 24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 132 place count 14 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 13 transition count 22
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 13 transition count 22
Performed 5 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 144 place count 8 transition count 16
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 148 place count 8 transition count 12
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 5 with 2 rules applied. Total rules applied 150 place count 7 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 152 place count 7 transition count 9
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 7 transition count 9
Applied a total of 153 rules in 15 ms. Remains 7 /176 variables (removed 169) and now considering 9/200 (removed 191) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4187877324034569757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-714379703171013592.kers'
[2026-05-25 15:57:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4187877324034569757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-714379703171013592.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 15 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 15:57:29] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-714379703171013592.kers
Total runtime 0 ms.
[2026-05-25 15:57:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 15:57:29] [INFO ] Invariant cache hit.
[2026-05-25 15:57:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-25 15:57:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 15:57:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 81 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 119 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 202ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/176 places, 9/200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 7/176 places, 9/200 transitions.
Computed a total of 7 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 16 factoid took 194 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (10007 resets) in 65 ms. (606 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (5710 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
[2026-05-25 15:57:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/14 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/14 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 16/16 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 17 factoid took 365 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Knowledge-based reduction took 852 ms.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 24966 reset in 95 ms.
Product exploration explored 100000 steps with 24873 reset in 104 ms.
Built C files in :
/tmp/ltsmin1189041447961973436
[2026-05-25 15:57:30] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2026-05-25 15:57:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 15:57:30] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2026-05-25 15:57:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 15:57:30] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2026-05-25 15:57:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 15:57:30] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1189041447961973436
Running compilation step : cd /tmp/ltsmin1189041447961973436;'/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 99 ms.
Running link step : cd /tmp/ltsmin1189041447961973436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1189041447961973436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10643273306671268422.hoa' '--buchi-type=spotba'
LTSmin run took 26 ms.
FORMULA IBM703-PT-none-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM703-PT-none-LTLFireability-13 finished in 64386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 243/243 transitions.
Graph (complete) has 244 edges and 216 vertex of which 59 are kept as prefixes of interest. Removing 157 places using SCC suffix rule.1 ms
Discarding 157 places :
Also discarding 172 output transitions
Drop transitions (Output transitions of discarded places.) removed 172 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 58 transition count 24
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 46 rules applied. Total rules applied 93 place count 14 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 13 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 94 place count 13 transition count 19
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 100 place count 10 transition count 19
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 9 transition count 17
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 9 transition count 17
Performed 5 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
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 112 place count 4 transition count 10
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 4 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 3 transition count 4
Applied a total of 119 rules in 5 ms. Remains 3 /216 variables (removed 213) and now considering 4/243 (removed 239) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14012818212727344091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12529537983145610089.kers'
[2026-05-25 15:57:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14012818212727344091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12529537983145610089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:57:31] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12529537983145610089.kers
Total runtime 0 ms.
[2026-05-25 15:57:31] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 15:57:31] [INFO ] Invariant cache hit.
[2026-05-25 15:57:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-25 15:57:31] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:57:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 42 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/216 places, 4/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 3/216 places, 4/243 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 44 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-14
Stuttering criterion allowed to conclude after 16 steps with 5 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-14 finished in 207 ms.
All properties solved by simple procedures.
Total runtime 561935 ms.
BK_STOP 1779724651700
--------------------
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="IBM703-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is IBM703-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;