About the Execution of ITS-Tools for IBM319-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 552.943 | 445191.00 | 491167.00 | 1328.70 | TFTTFFTFTFFFFFFT | 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-177961107700076.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 IBM319-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-177961107700076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 12K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K Mar 15 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K 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 184K 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 IBM319-PT-none-LTLFireability-00
FORMULA_NAME IBM319-PT-none-LTLFireability-01
FORMULA_NAME IBM319-PT-none-LTLFireability-02
FORMULA_NAME IBM319-PT-none-LTLFireability-03
FORMULA_NAME IBM319-PT-none-LTLFireability-04
FORMULA_NAME IBM319-PT-none-LTLFireability-05
FORMULA_NAME IBM319-PT-none-LTLFireability-06
FORMULA_NAME IBM319-PT-none-LTLFireability-07
FORMULA_NAME IBM319-PT-none-LTLFireability-08
FORMULA_NAME IBM319-PT-none-LTLFireability-09
FORMULA_NAME IBM319-PT-none-LTLFireability-10
FORMULA_NAME IBM319-PT-none-LTLFireability-11
FORMULA_NAME IBM319-PT-none-LTLFireability-12
FORMULA_NAME IBM319-PT-none-LTLFireability-13
FORMULA_NAME IBM319-PT-none-LTLFireability-14
FORMULA_NAME IBM319-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779722434971
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 15:20:36] [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:20:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:20:37] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-25 15:20:37] [INFO ] Transformed 253 places.
[2026-05-25 15:20:37] [INFO ] Transformed 178 transitions.
[2026-05-25 15:20:37] [INFO ] Found NUPN structural information;
[2026-05-25 15:20:37] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IBM319-PT-none-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM319-PT-none-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 66 places
Reduce places removed 74 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 178 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 87 place count 166 transition count 166
Iterating global reduction 1 with 12 rules applied. Total rules applied 99 place count 166 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 166 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 164 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 164 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 163 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 163 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 162 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 162 transition count 161
Applied a total of 108 rules in 96 ms. Remains 162 /253 variables (removed 91) and now considering 161/178 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1320742618037187306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9898718777281959603.kers'
[2026-05-25 15:20:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1320742618037187306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9898718777281959603.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 161 rows 152 cols 332 entries
Finished phase 1 with 147 SingleSign rule and 2 generalized
[2026-05-25 15:20:37] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9898718777281959603.kers
Total runtime 2 ms.
[2026-05-25 15:20:37] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-25 15:20:37] [INFO ] Invariant cache hit.
[2026-05-25 15:20:38] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2026-05-25 15:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 161/322 variables, 161/174 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/323 variables, 1/175 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/175 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/175 constraints. Problems are: Problem set: 8 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 175 constraints, problems are : Problem set: 8 solved, 152 unsolved in 20618 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 12/12 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 2/151 variables, 1/13 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 154/305 variables, 151/164 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 144/308 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/308 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 8/313 variables, 6/314 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 8/322 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/322 constraints. Problems are: Problem set: 8 solved, 152 unsolved
At refinement iteration 10 (OVERLAPS) 4/317 variables, 2/324 constraints. Problems are: Problem set: 8 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/323 variables, and 324 constraints, problems are : Problem set: 8 solved, 152 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/162 constraints, PredecessorRefiner: 152/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50754ms problems are : Problem set: 8 solved, 152 unsolved
Search for dead transitions found 8 dead transitions in 50775ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/253 places, 153/178 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 154 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 153 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 153 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 152 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 152 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 151 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 151 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 150 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 150 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 149 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 149 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 148 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 148 transition count 147
Applied a total of 20 rules in 21 ms. Remains 148 /162 variables (removed 14) and now considering 147/153 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18252784235024565290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12135399455076646724.kers'
[2026-05-25 15:21:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18252784235024565290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12135399455076646724.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 147 rows 138 cols 300 entries
Finished phase 1 with 133 SingleSign rule and 2 generalized
[2026-05-25 15:21:28] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12135399455076646724.kers
Total runtime 1 ms.
[2026-05-25 15:21:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 15:21:29] [INFO ] Invariant cache hit.
[2026-05-25 15:21:29] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 148/253 places, 147/178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51809 ms. Remains : 148/253 places, 147/178 transitions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 148 /148 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2026-05-25 15:21:29] [INFO ] Invariant cache hit.
[2026-05-25 15:21:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 15:21:29] [INFO ] Invariant cache hit.
[2026-05-25 15:21:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:21:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 2/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/292 variables, 145/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 3/295 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/295 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 161 constraints, problems are : Problem set: 0 solved, 146 unsolved in 15087 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 2/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/292 variables, 145/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 141/299 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 3/295 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/295 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 307 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45140ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 45148ms
Finished structural reductions in LTL mode , in 1 iterations and 45381 ms. Remains : 148/148 places, 147/147 transitions.
Support contains 42 out of 148 places after structural reductions.
[2026-05-25 15:22:14] [INFO ] Flatten gal took : 46 ms
[2026-05-25 15:22:14] [INFO ] Flatten gal took : 21 ms
[2026-05-25 15:22:14] [INFO ] Input system was already deterministic with 147 transitions.
RANDOM walk for 40000 steps (819 resets) in 1062 ms. (37 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40001 steps (530 resets) in 393 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (452 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
[2026-05-25 15:22:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 26/33 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/36 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 36/72 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/94 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 24/118 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 22/140 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 25/165 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/165 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/165 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 25/190 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/190 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/190 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 20/210 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/210 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/211 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/211 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 32/243 variables, 28/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/243 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/243 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 6/249 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 4/253 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/253 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 4/257 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/257 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 4/261 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/261 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 4/265 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/265 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 4/269 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/269 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 6/275 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/275 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/275 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (OVERLAPS) 4/279 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/279 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (OVERLAPS) 4/283 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/283 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 4/287 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/287 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (OVERLAPS) 5/292 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/292 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 295/295 variables, and 161 constraints, problems are : Problem set: 2 solved, 0 unsolved in 737 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 148/148 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 742ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 148 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 148 transition count 147
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Graph (complete) has 173 edges and 148 vertex of which 97 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.3 ms
Discarding 51 places :
Also discarding 50 output transitions
Drop transitions (Output transitions of discarded places.) removed 50 transitions
Ensure Unique test removed 6 places
Reduce places removed 7 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 90 transition count 33
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 27 transition count 24
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 21 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 142 place count 21 transition count 16
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 160 place count 11 transition count 16
Discarding 1 places :
Implicit places reduction removed 1 places
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 162 place count 10 transition count 15
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 165 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 166 place count 8 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 166 place count 8 transition count 12
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 168 place count 7 transition count 12
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 174 place count 4 transition count 7
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 176 place count 4 transition count 5
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 177 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 177 place count 4 transition count 3
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 179 place count 3 transition count 3
Applied a total of 179 rules in 43 ms. Remains 3 /148 variables (removed 145) and now considering 3/147 (removed 144) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10286212562674845330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13086027688159018358.kers'
[2026-05-25 15:22:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10286212562674845330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13086027688159018358.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 3 rows 2 cols 4 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-25 15:22:16] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13086027688159018358.kers
Total runtime 0 ms.
[2026-05-25 15:22:16] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 15:22:16] [INFO ] Invariant cache hit.
[2026-05-25 15:22:16] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2026-05-25 15:22:16] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-25 15:22:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/6 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/148 places, 3/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 3/148 places, 3/147 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 280 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-00
Product exploration explored 100000 steps with 40039 reset in 448 ms.
Product exploration explored 100000 steps with 39989 reset in 274 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
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 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 58 ms.
FORMULA IBM319-PT-none-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-00 finished in 1348 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&&((G(p0) U G((p1||X(p2)))) U !p2))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 134 transition count 147
Applied a total of 14 rules in 6 ms. Remains 134 /148 variables (removed 14) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5969817163669428949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10991809778340431392.kers'
[2026-05-25 15:22:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5969817163669428949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10991809778340431392.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:22:18] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10991809778340431392.kers
Total runtime 2 ms.
[2026-05-25 15:22:18] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 15:22:18] [INFO ] Invariant cache hit.
[2026-05-25 15:22:18] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:22:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 15807 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 25895 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41727ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 41728ms
Starting structural reductions in LTL mode, iteration 1 : 134/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42052 ms. Remains : 134/148 places, 147/147 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&&((G(p0) U G((p1||X(p2)))) U !p2))))'
Stuttering acceptance computed with spot in 400 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-01 finished in 42540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (X((X(p1) U (X((p2 U !p0))||p3)))||p1)))'
Support contains 6 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 135 transition count 147
Applied a total of 13 rules in 4 ms. Remains 135 /148 variables (removed 13) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2697164771862795937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15136479376720113013.kers'
[2026-05-25 15:23:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2697164771862795937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15136479376720113013.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:23:00] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15136479376720113013.kers
Total runtime 2 ms.
[2026-05-25 15:23:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 15:23:00] [INFO ] Invariant cache hit.
[2026-05-25 15:23:00] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:23:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 14317 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 25505 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39837ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 39838ms
Starting structural reductions in LTL mode, iteration 1 : 135/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40009 ms. Remains : 135/148 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(!p0 U (X((X(p1) U (X((p2 U !p0))||p3)))||p1)))'
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) p3 p1), true, (OR (NOT p0) p3), (NOT p0), (OR (AND (NOT p0) p1 (NOT p3)) (AND p0 p1 p3))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-02
Product exploration explored 100000 steps with 33333 reset in 117 ms.
Product exploration explored 100000 steps with 33333 reset in 94 ms.
Computed a total of 135 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 135 transition count 147
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 13 ms. Proved property starting from automaton with 5 states, 12 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 111 ms.
FORMULA IBM319-PT-none-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-02 finished in 40617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (X(F(X(!p1))) U p2))))'
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 135 transition count 147
Applied a total of 13 rules in 5 ms. Remains 135 /148 variables (removed 13) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13253780169153808986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17636802255801261911.kers'
[2026-05-25 15:23:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13253780169153808986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17636802255801261911.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:23:41] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17636802255801261911.kers
Total runtime 2 ms.
[2026-05-25 15:23:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 15:23:41] [INFO ] Invariant cache hit.
[2026-05-25 15:23:41] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 135/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 135/148 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (X(F(X(!p1))) U p2))))'
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (AND (NOT p0) p1), (OR (NOT p2) (AND (NOT p0) p1))]
Running random walk in product with property : IBM319-PT-none-LTLFireability-03
Product exploration explored 100000 steps with 5002 reset in 96 ms.
Product exploration explored 100000 steps with 4999 reset in 207 ms.
Computed a total of 135 stabilizing places and 147 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 135 transition count 147
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 13 factoid took 60 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 72 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge based reduction with 13 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p2), (NOT p2)]
[2026-05-25 15:23:42] [INFO ] Invariant cache hit.
[2026-05-25 15:23:42] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2026-05-25 15:23:42] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-25 15:23:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 15:23:42] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2026-05-25 15:23:42] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2026-05-25 15:23:42] [INFO ] Computed and/alt/rep : 146/163/146 causal constraints (skipped 0 transitions) in 14 ms.
[2026-05-25 15:23:42] [INFO ] Added : 15 causal constraints over 3 iterations in 107 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 838 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 147/147 transitions.
Graph (complete) has 151 edges and 135 vertex of which 115 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 114 transition count 51
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 80 rules applied. Total rules applied 152 place count 43 transition count 42
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 160 place count 37 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 162 place count 35 transition count 40
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 162 place count 35 transition count 27
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 190 place count 20 transition count 27
Discarding 1 places :
Implicit places reduction removed 1 places
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 192 place count 19 transition count 26
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 195 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 196 place count 17 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 196 place count 17 transition count 23
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 198 place count 16 transition count 23
Performed 7 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 212 place count 9 transition count 13
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 214 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 216 place count 8 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 217 place count 8 transition count 10
Applied a total of 217 rules in 18 ms. Remains 8 /135 variables (removed 127) and now considering 10/147 (removed 137) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11949264643233698074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5710450707983617878.kers'
[2026-05-25 15:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11949264643233698074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5710450707983617878.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 10 rows 7 cols 19 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 15:23:42] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5710450707983617878.kers
Total runtime 0 ms.
[2026-05-25 15:23:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 15:23:42] [INFO ] Invariant cache hit.
[2026-05-25 15:23:42] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-25 15:23:42] [INFO ] Redundant transitions in 15 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 15:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/17 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/17 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 323ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/135 places, 10/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 410 ms. Remains : 8/135 places, 10/147 transitions.
Computed a total of 8 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 10
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 4 factoid took 46 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 69 ms.
FORMULA IBM319-PT-none-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-03 finished in 2188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((F(p0) U X(p1))&&F(p2))) U (p0&&X(((F(p0) U X(p1))&&F(p2)))))))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 134 transition count 147
Applied a total of 14 rules in 2 ms. Remains 134 /148 variables (removed 14) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3326902653181305247.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17560099447080150763.kers'
[2026-05-25 15:23:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3326902653181305247.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17560099447080150763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:23:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17560099447080150763.kers
Total runtime 1 ms.
[2026-05-25 15:23:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 15:23:43] [INFO ] Invariant cache hit.
[2026-05-25 15:23:43] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:23:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 12658 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 24388 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37059ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 37060ms
Starting structural reductions in LTL mode, iteration 1 : 134/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37278 ms. Remains : 134/148 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(((F(p0) U X(p1))&&F(p2))) U (p0&&X(((F(p0) U X(p1))&&F(p2)))))))'
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-04
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-04 finished in 37592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(F(G(p0)) U p1)))'
Support contains 3 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 135 transition count 147
Applied a total of 13 rules in 2 ms. Remains 135 /148 variables (removed 13) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11966955246122890639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3106906865158034729.kers'
[2026-05-25 15:24:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11966955246122890639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3106906865158034729.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:24:20] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3106906865158034729.kers
Total runtime 1 ms.
[2026-05-25 15:24:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 15:24:20] [INFO ] Invariant cache hit.
[2026-05-25 15:24:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 14471 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 26987 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41472ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 41473ms
Starting structural reductions in LTL mode, iteration 1 : 135/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41731 ms. Remains : 135/148 places, 147/147 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))&&(F(G(p0)) U p1)))'
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-05 finished in 41895 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 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Graph (complete) has 173 edges and 148 vertex of which 102 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.1 ms
Discarding 46 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 94 transition count 34
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 76 rules applied. Total rules applied 145 place count 27 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 151 place count 21 transition count 25
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 151 place count 21 transition count 17
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 169 place count 11 transition count 17
Discarding 1 places :
Implicit places reduction removed 1 places
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 171 place count 10 transition count 16
Reduce places removed 1 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 4 with 3 rules applied. Total rules applied 174 place count 9 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 175 place count 8 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 175 place count 8 transition count 13
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 177 place count 7 transition count 13
Performed 4 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 185 place count 3 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 187 place count 3 transition count 4
Applied a total of 187 rules in 8 ms. Remains 3 /148 variables (removed 145) and now considering 4/147 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17832103617391069563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1400830994658218976.kers'
[2026-05-25 15:25:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17832103617391069563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1400830994658218976.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:25:02] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1400830994658218976.kers
Total runtime 1 ms.
[2026-05-25 15:25:02] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 15:25:02] [INFO ] Invariant cache hit.
[2026-05-25 15:25:02] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-25 15:25:02] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:25:02] [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 35 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 40 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 76ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/148 places, 4/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 3/148 places, 4/147 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 34 ms :[(NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-08
Product exploration explored 100000 steps with 33312 reset in 48 ms.
Product exploration explored 100000 steps with 33343 reset in 258 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 12 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 38 ms.
FORMULA IBM319-PT-none-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM319-PT-none-LTLFireability-08 finished in 536 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 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Graph (complete) has 173 edges and 148 vertex of which 97 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 50 output transitions
Drop transitions (Output transitions of discarded places.) removed 50 transitions
Ensure Unique test removed 5 places
Reduce places removed 6 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 91 transition count 35
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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 67 rules applied. Total rules applied 129 place count 30 transition count 29
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 26 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 25 transition count 28
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 135 place count 25 transition count 19
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 154 place count 15 transition count 19
Discarding 1 places :
Implicit places reduction removed 1 places
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 156 place count 14 transition count 18
Reduce places removed 1 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 5 with 3 rules applied. Total rules applied 159 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 160 place count 12 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 160 place count 12 transition count 15
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 162 place count 11 transition count 15
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 164 place count 10 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 166 place count 10 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 8 with 2 rules applied. Total rules applied 168 place count 9 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 169 place count 9 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 170 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 170 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 172 place count 8 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 173 place count 8 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 174 place count 8 transition count 7
Applied a total of 174 rules in 9 ms. Remains 8 /148 variables (removed 140) and now considering 7/147 (removed 140) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2966912905134536057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1419910500500942080.kers'
[2026-05-25 15:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2966912905134536057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1419910500500942080.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 16 entries
Finished phase 1 with 4 SingleSign rule and 1 generalized
[2026-05-25 15:25:03] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1419910500500942080.kers
Total runtime 1 ms.
[2026-05-25 15:25:03] [INFO ] Implicit Places using invariants in 27 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/148 places, 7/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 7/148 places, 7/147 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 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-10 finished in 183 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&&X(F((F(p1)&&G(p2)))))||G((F(p1)&&F(G(p2)))))))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 8 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 136 transition count 147
Applied a total of 12 rules in 3 ms. Remains 136 /148 variables (removed 12) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5817494316179021915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10982422694012161680.kers'
[2026-05-25 15:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5817494316179021915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10982422694012161680.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:25:03] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10982422694012161680.kers
Total runtime 1 ms.
[2026-05-25 15:25:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 15:25:03] [INFO ] Invariant cache hit.
[2026-05-25 15:25:03] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:25:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/282 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 140 constraints, problems are : Problem set: 0 solved, 146 unsolved in 16274 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/282 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 146/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 286 constraints, problems are : Problem set: 0 solved, 146 unsolved in 26999 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43286ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 43287ms
Starting structural reductions in LTL mode, iteration 1 : 136/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43555 ms. Remains : 136/148 places, 147/147 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((F(p0)&&F(G(p1))))||(X(F((F(p0)&&G(p1))))&&p2))))'
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA IBM319-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-11 finished in 43813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(p0)) U (F(p1) U p2)))))'
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 9 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 135 transition count 147
Applied a total of 13 rules in 3 ms. Remains 135 /148 variables (removed 13) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8713189010738371068.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8958013363621720431.kers'
[2026-05-25 15:25:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8713189010738371068.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8958013363621720431.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:25:47] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8958013363621720431.kers
Total runtime 1 ms.
[2026-05-25 15:25:47] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 15:25:47] [INFO ] Invariant cache hit.
[2026-05-25 15:25:47] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:25:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/282 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 138 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11977 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/281 variables, 134/137 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 146/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/282 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 284 constraints, problems are : Problem set: 0 solved, 146 unsolved in 25269 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37253ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 37254ms
Starting structural reductions in LTL mode, iteration 1 : 135/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37540 ms. Remains : 135/148 places, 147/147 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((X(X(p0)) U (F(p1) U p2)))))'
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p2 (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-12
Stuttering criterion allowed to conclude after 123 steps with 9 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-12 finished in 37904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1)) U p2)))'
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 8 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 136 transition count 147
Applied a total of 12 rules in 2 ms. Remains 136 /148 variables (removed 12) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-970622501770907365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14685340749086034700.kers'
[2026-05-25 15:26:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-970622501770907365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14685340749086034700.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:26:25] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14685340749086034700.kers
Total runtime 1 ms.
[2026-05-25 15:26:25] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 15:26:25] [INFO ] Invariant cache hit.
[2026-05-25 15:26:25] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:26:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/282 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 140 constraints, problems are : Problem set: 0 solved, 146 unsolved in 16814 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/282 variables, 135/139 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 146/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/283 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 286 constraints, problems are : Problem set: 0 solved, 146 unsolved in 29647 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46469ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 46470ms
Starting structural reductions in LTL mode, iteration 1 : 136/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46693 ms. Remains : 136/148 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(p1)) U p2)))'
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (NOT p2), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-13
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-13 finished in 46927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 147/147 transitions.
Ensure Unique test removed 10 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 134 transition count 147
Applied a total of 14 rules in 2 ms. Remains 134 /148 variables (removed 14) and now considering 147/147 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16373694441188373707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12613988729393784089.kers'
[2026-05-25 15:27:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16373694441188373707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12613988729393784089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 147 rows 134 cols 296 entries
Finished phase 1 with 131 SingleSign rule and 1 generalized
[2026-05-25 15:27:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12613988729393784089.kers
Total runtime 1 ms.
[2026-05-25 15:27:12] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 15:27:12] [INFO ] Invariant cache hit.
[2026-05-25 15:27:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-25 15:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 1/281 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 136 constraints, problems are : Problem set: 0 solved, 146 unsolved in 19501 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 147/280 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/281 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 282 constraints, problems are : Problem set: 0 solved, 146 unsolved in 27766 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47275ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 47275ms
Starting structural reductions in LTL mode, iteration 1 : 134/148 places, 147/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47491 ms. Remains : 134/148 places, 147/147 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM319-PT-none-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM319-PT-none-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM319-PT-none-LTLFireability-14 finished in 47642 ms.
All properties solved by simple procedures.
Total runtime 443009 ms.
BK_STOP 1779722880162
--------------------
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="IBM319-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 IBM319-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-177961107700076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-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 ;