Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000316.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 FlexibleBarrier-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 7 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 05:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 69K 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 FlexibleBarrier-PT-04b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779868298197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-27 07:51:40] [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-27 07:51:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 07:51:41] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2026-05-27 07:51:41] [INFO ] Transformed 268 places.
[2026-05-27 07:51:41] [INFO ] Transformed 305 transitions.
[2026-05-27 07:51:41] [INFO ] Found NUPN structural information;
[2026-05-27 07:51:41] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 196 transition count 233
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 196 transition count 233
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 167 place count 173 transition count 210
Iterating global reduction 0 with 23 rules applied. Total rules applied 190 place count 173 transition count 210
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 202 place count 161 transition count 198
Iterating global reduction 0 with 12 rules applied. Total rules applied 214 place count 161 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 218 place count 161 transition count 194
Applied a total of 218 rules in 130 ms. Remains 161 /268 variables (removed 107) and now considering 194/305 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5043532424602131302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11543713992692070319.kers'
[2026-05-27 07:51:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5043532424602131302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11543713992692070319.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 194 rows 161 cols 505 entries
Finished phase 1 with 155 SingleSign rule and 0 generalized
[2026-05-27 07:51:41] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11543713992692070319.kers
Total runtime 3 ms.
[2026-05-27 07:51:42] [INFO ] Implicit Places using invariants in 436 ms returned []
[2026-05-27 07:51:42] [INFO ] Invariant cache hit.
[2026-05-27 07:51:42] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2026-05-27 07:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/355 variables, 161/173 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 0/355 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/355 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 174 constraints, problems are : Problem set: 0 solved, 193 unsolved in 26673 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/355 variables, 161/174 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 193/367 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 6/373 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 376 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 56840ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 56864ms
Starting structural reductions in LTL mode, iteration 1 : 161/268 places, 194/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57950 ms. Remains : 161/268 places, 194/305 transitions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Applied a total of 0 rules in 7 ms. Remains 161 /161 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-27 07:52:39] [INFO ] Invariant cache hit.
[2026-05-27 07:52:39] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-27 07:52:39] [INFO ] Invariant cache hit.
[2026-05-27 07:52:39] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 487 ms. Remains : 161/161 places, 194/194 transitions.
Support contains 32 out of 161 places after structural reductions.
[2026-05-27 07:52:40] [INFO ] Flatten gal took : 59 ms
[2026-05-27 07:52:40] [INFO ] Flatten gal took : 25 ms
[2026-05-27 07:52:40] [INFO ] Input system was already deterministic with 194 transitions.
RANDOM walk for 40000 steps (914 resets) in 2581 ms. (15 steps per ms) remains 4/31 properties
BEST_FIRST walk for 40004 steps (172 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (163 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (173 resets) in 59 ms. (666 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (170 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
[2026-05-27 07:52:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 119/161 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 194/355 variables, 161/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/355 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 119/161 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 194/355 variables, 161/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/355 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 355/355 variables, and 171 constraints, problems are : Problem set: 0 solved, 3 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 934ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Parikh walk visited 3 properties in 89 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&((p2&&F(p3)) U X(X(G(p2))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 148 transition count 181
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 148 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 143 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 143 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 143 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 139 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 139 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 139 transition count 168
Applied a total of 48 rules in 22 ms. Remains 139 /161 variables (removed 22) and now considering 168/194 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3052567459348767297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17557805810858566965.kers'
[2026-05-27 07:52:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3052567459348767297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17557805810858566965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 139 cols 437 entries
Finished phase 1 with 133 SingleSign rule and 0 generalized
[2026-05-27 07:52:43] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17557805810858566965.kers
Total runtime 4 ms.
[2026-05-27 07:52:43] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-27 07:52:43] [INFO ] Invariant cache hit.
[2026-05-27 07:52:43] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-27 07:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 0/307 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 145 constraints, problems are : Problem set: 0 solved, 167 unsolved in 12625 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 168/307 variables, 139/145 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 7/319 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 327 constraints, problems are : Problem set: 0 solved, 167 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42695ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 42698ms
Starting structural reductions in LTL mode, iteration 1 : 139/161 places, 168/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43171 ms. Remains : 139/161 places, 168/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))&&((p2&&F(p3)) U X(X(G(p2))))))'
Stuttering acceptance computed with spot in 661 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p3) (NOT p2)), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 4 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-00 finished in 44036 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)||X(X(X(X(F(p1))))))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Graph (trivial) has 144 edges and 161 vertex of which 26 / 161 are part of one of the 4 SCC in 4 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 138 transition count 146
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 114 transition count 146
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 49 place count 114 transition count 135
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 71 place count 103 transition count 135
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 88 place count 86 transition count 118
Iterating global reduction 2 with 17 rules applied. Total rules applied 105 place count 86 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 86 transition count 117
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 85 transition count 117
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 80 transition count 112
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 80 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 80 transition count 107
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 170 place count 56 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 56 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 176 place count 54 transition count 77
Applied a total of 176 rules in 78 ms. Remains 54 /161 variables (removed 107) and now considering 77/194 (removed 117) transitions.
[2026-05-27 07:53:27] [INFO ] Flow matrix only has 70 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-83025430831949356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15510018234103952628.kers'
[2026-05-27 07:53:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-83025430831949356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15510018234103952628.kers]
Normalized transition count is 69 out of 70 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 54 cols 198 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-27 07:53:27] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15510018234103952628.kers
Total runtime 1 ms.
[2026-05-27 07:53:27] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-27 07:53:27] [INFO ] Flow matrix only has 70 transitions (discarded 7 similar events)
[2026-05-27 07:53:27] [INFO ] Invariant cache hit.
[2026-05-27 07:53:27] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2026-05-27 07:53:27] [INFO ] Redundant transitions in 3 ms returned []
Running 47 sub problems to find dead transitions.
[2026-05-27 07:53:27] [INFO ] Flow matrix only has 70 transitions (discarded 7 similar events)
[2026-05-27 07:53:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 4/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 69/123 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/124 variables, and 61 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1820 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 69/123 variables, 54/61 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 47/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/124 variables, and 108 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2134 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3972ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3977ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/161 places, 77/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4284 ms. Remains : 54/161 places, 77/194 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)||X(X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 8698 reset in 567 ms.
Stuttering criterion allowed to conclude after 3501 steps with 301 reset in 17 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-01 finished in 5203 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||(F(p1)&&X(p2)))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 147 transition count 180
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 147 transition count 180
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 142 transition count 175
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 142 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 142 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 138 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 138 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 138 transition count 167
Applied a total of 50 rules in 19 ms. Remains 138 /161 variables (removed 23) and now considering 167/194 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8046539038912403081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8316950578722876605.kers'
[2026-05-27 07:53:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8046539038912403081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8316950578722876605.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 138 cols 435 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-27 07:53:32] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8316950578722876605.kers
Total runtime 2 ms.
[2026-05-27 07:53:32] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-27 07:53:32] [INFO ] Invariant cache hit.
[2026-05-27 07:53:32] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-27 07:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 167/305 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/305 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 144 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11616 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 167/305 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 166/310 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 6/316 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/305 variables, and 323 constraints, problems are : Problem set: 0 solved, 166 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41671ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 41674ms
Starting structural reductions in LTL mode, iteration 1 : 138/161 places, 167/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42050 ms. Remains : 138/161 places, 167/194 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||(F(p1)&&X(p2)))))'
Stuttering acceptance computed with spot in 258 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), true]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-02 finished in 42366 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 (p1&&G(p0)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 148 transition count 181
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 148 transition count 181
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 143 transition count 176
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 143 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 143 transition count 174
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 140 transition count 171
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 140 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 140 transition count 169
Applied a total of 46 rules in 12 ms. Remains 140 /161 variables (removed 21) and now considering 169/194 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7147319190114291616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10730999639839417366.kers'
[2026-05-27 07:54:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7147319190114291616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10730999639839417366.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 169 rows 140 cols 439 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-05-27 07:54:14] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10730999639839417366.kers
Total runtime 2 ms.
[2026-05-27 07:54:14] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-27 07:54:14] [INFO ] Invariant cache hit.
[2026-05-27 07:54:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-27 07:54:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/309 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 0/309 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 146 constraints, problems are : Problem set: 0 solved, 168 unsolved in 12170 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 169/309 variables, 140/146 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 168/314 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/321 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 4/325 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 309/309 variables, and 328 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42221ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 42222ms
Starting structural reductions in LTL mode, iteration 1 : 140/161 places, 169/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42594 ms. Remains : 140/161 places, 169/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-03
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-03 finished in 42804 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(G(p0))&&F(p1))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Graph (trivial) has 142 edges and 161 vertex of which 20 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 143 transition count 153
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 121 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 120 transition count 152
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 47 place count 120 transition count 139
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 73 place count 107 transition count 139
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 88 place count 92 transition count 124
Iterating global reduction 3 with 15 rules applied. Total rules applied 103 place count 92 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 103 place count 92 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 123
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 87 transition count 119
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 87 transition count 119
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 117 place count 87 transition count 115
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 173 place count 59 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 58 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 178 place count 58 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 57 transition count 87
Applied a total of 179 rules in 46 ms. Remains 57 /161 variables (removed 104) and now considering 87/194 (removed 107) transitions.
[2026-05-27 07:54:57] [INFO ] Flow matrix only has 81 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15575860916677811317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12254371959473922689.kers'
[2026-05-27 07:54:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15575860916677811317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12254371959473922689.kers]
Normalized transition count is 80 out of 81 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 56 cols 221 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-27 07:54:57] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12254371959473922689.kers
Total runtime 2 ms.
[2026-05-27 07:54:57] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-27 07:54:57] [INFO ] Flow matrix only has 81 transitions (discarded 6 similar events)
[2026-05-27 07:54:57] [INFO ] Invariant cache hit.
[2026-05-27 07:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-27 07:54:57] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2026-05-27 07:54:57] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2026-05-27 07:54:57] [INFO ] Flow matrix only has 81 transitions (discarded 6 similar events)
[2026-05-27 07:54:57] [INFO ] Invariant cache hit.
[2026-05-27 07:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 80/137 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 64 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2707 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 80/137 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 75/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 1/138 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 0/138 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 139 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4337 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7058ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 7059ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/161 places, 87/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7300 ms. Remains : 57/161 places, 87/194 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-04
Stuttering criterion allowed to conclude after 131 steps with 11 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-04 finished in 7486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Graph (trivial) has 145 edges and 161 vertex of which 26 / 161 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 138 transition count 147
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 115 transition count 147
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 47 place count 115 transition count 136
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 69 place count 104 transition count 136
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 87 place count 86 transition count 118
Iterating global reduction 2 with 18 rules applied. Total rules applied 105 place count 86 transition count 118
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 86 transition count 117
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 85 transition count 117
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 80 transition count 112
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 80 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 122 place count 80 transition count 107
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 172 place count 55 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 55 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 53 transition count 76
Applied a total of 178 rules in 29 ms. Remains 53 /161 variables (removed 108) and now considering 76/194 (removed 118) transitions.
[2026-05-27 07:55:05] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11122853869180757590.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10815747494695664923.kers'
[2026-05-27 07:55:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11122853869180757590.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10815747494695664923.kers]
Normalized transition count is 68 out of 69 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 68 rows 52 cols 179 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-27 07:55:05] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10815747494695664923.kers
Total runtime 2 ms.
[2026-05-27 07:55:05] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-27 07:55:05] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2026-05-27 07:55:05] [INFO ] Invariant cache hit.
[2026-05-27 07:55:05] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2026-05-27 07:55:05] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-27 07:55:05] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2026-05-27 07:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 4/53 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 68/121 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 0/121 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/122 variables, and 59 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 4/53 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 68/121 variables, 53/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 46/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/121 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/122 variables, and 105 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1671 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3355ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3355ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/161 places, 76/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3595 ms. Remains : 53/161 places, 76/194 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 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-05 finished in 3722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F(G(p1))))))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 148 transition count 181
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 148 transition count 181
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 142 transition count 175
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 142 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 142 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 138 transition count 169
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 138 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 138 transition count 166
Applied a total of 51 rules in 7 ms. Remains 138 /161 variables (removed 23) and now considering 166/194 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-380686987109010105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6977081715970235946.kers'
[2026-05-27 07:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-380686987109010105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6977081715970235946.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 138 cols 429 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-27 07:55:08] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6977081715970235946.kers
Total runtime 1 ms.
[2026-05-27 07:55:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-27 07:55:08] [INFO ] Invariant cache hit.
[2026-05-27 07:55:09] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2026-05-27 07:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 144 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10476 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 165/309 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 323 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40518ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40519ms
Starting structural reductions in LTL mode, iteration 1 : 138/161 places, 166/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40835 ms. Remains : 138/161 places, 166/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F(G(p1))))))))'
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-06
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-06 finished in 41237 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&&X((X(X(X(F(p1))))||G(p0)))))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Graph (trivial) has 143 edges and 161 vertex of which 26 / 161 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 138 transition count 149
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 117 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 43 place count 117 transition count 138
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 65 place count 106 transition count 138
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 81 place count 90 transition count 122
Iterating global reduction 2 with 16 rules applied. Total rules applied 97 place count 90 transition count 122
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 85 transition count 117
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 85 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 85 transition count 113
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 163 place count 59 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 167 place count 59 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 57 transition count 81
Applied a total of 169 rules in 40 ms. Remains 57 /161 variables (removed 104) and now considering 81/194 (removed 113) transitions.
[2026-05-27 07:55:50] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10167653353117036393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5991997758311347763.kers'
[2026-05-27 07:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10167653353117036393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5991997758311347763.kers]
Normalized transition count is 73 out of 74 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 73 rows 56 cols 193 entries
Finished phase 1 with 51 SingleSign rule and 0 generalized
[2026-05-27 07:55:50] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5991997758311347763.kers
Total runtime 1 ms.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-27 07:55:50] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
[2026-05-27 07:55:50] [INFO ] Invariant cache hit.
[2026-05-27 07:55:50] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2026-05-27 07:55:50] [INFO ] Redundant transitions in 2 ms returned []
Running 50 sub problems to find dead transitions.
[2026-05-27 07:55:50] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
[2026-05-27 07:55:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 73/130 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/131 variables, and 63 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 4/57 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (OVERLAPS) 73/130 variables, 57/63 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/131 variables, and 113 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4436ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 4436ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/161 places, 81/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4762 ms. Remains : 57/161 places, 81/194 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&&X((X(X(X(F(p1))))||G(p0)))))))'
Stuttering acceptance computed with spot in 396 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-09
Product exploration explored 100000 steps with 16843 reset in 565 ms.
Product exploration explored 100000 steps with 16860 reset in 405 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3843 resets) in 393 ms. (101 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (377 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2026-05-27 07:55:56] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
[2026-05-27 07:55:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/59 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/100 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/118 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/130 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/131 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/59 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/100 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/118 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/130 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/131 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 932 ms.
Stuttering acceptance computed with spot in 368 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2026-05-27 07:55:57] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
[2026-05-27 07:55:57] [INFO ] Invariant cache hit.
[2026-05-27 07:55:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-27 07:55:57] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
[2026-05-27 07:55:57] [INFO ] Invariant cache hit.
[2026-05-27 07:55:57] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2026-05-27 07:55:57] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 57/57 places, 81/81 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3880 resets) in 273 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (376 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2026-05-27 07:55:57] [INFO ] Flow matrix only has 74 transitions (discarded 7 similar events)
[2026-05-27 07:55:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/59 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/100 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/118 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/130 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/131 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/59 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/100 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 18/118 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/130 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/131 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 309ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 375 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1060 ms.
Stuttering acceptance computed with spot in 362 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 16900 reset in 298 ms.
Product exploration explored 100000 steps with 16856 reset in 319 ms.
Built C files in :
/tmp/ltsmin12506970568450912190
[2026-05-27 07:56:00] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2026-05-27 07:56:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 07:56:00] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2026-05-27 07:56:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 07:56:00] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2026-05-27 07:56:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-27 07:56:00] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12506970568450912190
Running compilation step : cd /tmp/ltsmin12506970568450912190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 667 ms.
Running link step : cd /tmp/ltsmin12506970568450912190;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin12506970568450912190;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17013423235644487066.hoa' '--buchi-type=spotba'
LTSmin run took 1841 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-09 finished in 12894 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(!p0)&&F(p1))||X(G(!p0)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 149 transition count 182
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 149 transition count 182
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 143 transition count 176
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 143 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 143 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 141 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 141 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 141 transition count 171
Applied a total of 43 rules in 6 ms. Remains 141 /161 variables (removed 20) and now considering 171/194 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13251372345336892548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15855808993169073934.kers'
[2026-05-27 07:56:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13251372345336892548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15855808993169073934.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 171 rows 141 cols 447 entries
Finished phase 1 with 135 SingleSign rule and 0 generalized
[2026-05-27 07:56:02] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15855808993169073934.kers
Total runtime 2 ms.
[2026-05-27 07:56:03] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-27 07:56:03] [INFO ] Invariant cache hit.
[2026-05-27 07:56:03] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2026-05-27 07:56:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 171/312 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 0/312 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 312/312 variables, and 147 constraints, problems are : Problem set: 0 solved, 170 unsolved in 12121 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 171/312 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 170/317 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 5/322 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 312/312 variables, and 331 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42164ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 42167ms
Starting structural reductions in LTL mode, iteration 1 : 141/161 places, 171/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42554 ms. Remains : 141/161 places, 171/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(G(!p0))||(X(!p0)&&F(p1)))))'
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p0), p0, (AND (NOT p1) p0), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-11
Stuttering criterion allowed to conclude after 59 steps with 2 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-11 finished in 42832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&(p1 U (G(p1)||(p1&&((p2&&X(G((p2||G(!p1))))) U (G((p2&&X(G((p2||G(!p1))))))||(X(G((p2||G(!p1))))&&p3)))))))||X(G(p0))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 149 transition count 182
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 149 transition count 182
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 144 transition count 177
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 144 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 144 transition count 175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 141 transition count 172
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 141 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 141 transition count 170
Applied a total of 44 rules in 12 ms. Remains 141 /161 variables (removed 20) and now considering 170/194 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12288580065829009350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13895938471411084360.kers'
[2026-05-27 07:56:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12288580065829009350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13895938471411084360.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 141 cols 441 entries
Finished phase 1 with 135 SingleSign rule and 0 generalized
[2026-05-27 07:56:45] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13895938471411084360.kers
Total runtime 2 ms.
[2026-05-27 07:56:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-27 07:56:45] [INFO ] Invariant cache hit.
[2026-05-27 07:56:46] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2026-05-27 07:56:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 170/311 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 0/311 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 147 constraints, problems are : Problem set: 0 solved, 169 unsolved in 12104 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (OVERLAPS) 170/311 variables, 141/147 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 169/316 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 6/322 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 42150ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 42151ms
Starting structural reductions in LTL mode, iteration 1 : 141/161 places, 170/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42584 ms. Remains : 141/161 places, 170/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(X(p0)&&(p1 U (G(p1)||(p1&&((p2&&X(G((p2||G(!p1))))) U (G((p2&&X(G((p2||G(!p1))))))||(X(G((p2||G(!p1))))&&p3)))))))))))'
Stuttering acceptance computed with spot in 1299 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) p1), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2)), p1, (NOT p0), (NOT p0), false, false, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) p1 (NOT p2))), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-12
Product exploration explored 100000 steps with 2230 reset in 521 ms.
Product exploration explored 100000 steps with 2245 reset in 450 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge based reduction with 22 factoid took 250 ms. Reduced automaton from 21 states, 127 edges and 4 AP (stutter sensitive) to 21 states, 124 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 49 to 43
RANDOM walk for 40000 steps (888 resets) in 509 ms. (78 steps per ms) remains 16/43 properties
BEST_FIRST walk for 4003 steps (15 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (16 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (16 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (15 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (19 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (11 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 54 ms. (72 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (17 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
[2026-05-27 07:57:31] [INFO ] Invariant cache hit.
Problem apf12 is UNSAT
Problem apf19 is UNSAT
Problem apf25 is UNSAT
Problem apf35 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf36 is UNSAT
At refinement iteration 1 (OVERLAPS) 88/92 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 49/141 variables, 3/6 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 170/311 variables, 141/148 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/148 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/148 constraints. Problems are: Problem set: 7 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 148 constraints, problems are : Problem set: 7 solved, 9 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 49/141 variables, 3/6 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 170/311 variables, 141/150 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 9/159 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/159 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/159 constraints. Problems are: Problem set: 7 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 159 constraints, problems are : Problem set: 7 solved, 9 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 9/16 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1861ms problems are : Problem set: 7 solved, 9 unsolved
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 4 properties in 1155 ms.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 170/170 transitions.
Graph (trivial) has 121 edges and 141 vertex of which 25 / 141 are part of one of the 4 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 120 transition count 128
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 104 transition count 128
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 104 transition count 118
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 94 transition count 118
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 88 transition count 112
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 87 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 87 transition count 111
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 121 place count 60 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 129 place count 60 transition count 76
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 56 transition count 72
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 56 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 55 transition count 83
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 163 place count 55 transition count 59
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 193 place count 31 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 31 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 30 transition count 49
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 30 edges and 28 vertex of which 20 / 28 are part of one of the 4 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 200 place count 12 transition count 49
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 31 rules applied. Total rules applied 231 place count 9 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 237 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 9 transition count 11
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 7 with 1 rules applied. Total rules applied 242 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 243 place count 8 transition count 10
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 246 place count 8 transition count 7
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 250 place count 5 transition count 6
Applied a total of 250 rules in 22 ms. Remains 5 /141 variables (removed 136) and now considering 6/170 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 5/141 places, 6/170 transitions.
RANDOM walk for 17 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/5 properties
Found 9 invariant AP formulas.
Knowledge based reduction with 31 factoid took 1147 ms. Reduced automaton from 21 states, 124 edges and 4 AP (stutter sensitive) to 21 states, 102 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1224 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p0), (NOT p0), false, false, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 6023 ms.
Stuttering acceptance computed with spot in 1287 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p0), (NOT p0), false, false, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 170/170 transitions.
Applied a total of 0 rules in 2 ms. Remains 141 /141 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2026-05-27 07:57:38] [INFO ] Invariant cache hit.
[2026-05-27 07:57:38] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-27 07:57:38] [INFO ] Invariant cache hit.
[2026-05-27 07:57:38] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 141/141 places, 170/170 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge based reduction with 8 factoid took 204 ms. Reduced automaton from 21 states, 102 edges and 4 AP (stutter sensitive) to 21 states, 102 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (891 resets) in 237 ms. (168 steps per ms) remains 10/31 properties
BEST_FIRST walk for 40004 steps (172 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (169 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (143 resets) in 99 ms. (400 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (174 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (169 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (171 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (175 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (139 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (171 resets) in 57 ms. (689 steps per ms) remains 6/8 properties
[2026-05-27 07:57:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 49/141 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 170/311 variables, 141/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 148 constraints, problems are : Problem set: 0 solved, 6 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 88/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 49/141 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 170/311 variables, 141/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 154 constraints, problems are : Problem set: 0 solved, 6 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 712 ms.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 170/170 transitions.
Graph (trivial) has 121 edges and 141 vertex of which 25 / 141 are part of one of the 4 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 120 transition count 128
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 104 transition count 128
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 104 transition count 118
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 94 transition count 118
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 88 transition count 112
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 88 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 87 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 87 transition count 111
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 121 place count 60 transition count 84
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 129 place count 60 transition count 76
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 56 transition count 72
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 56 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 55 transition count 83
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 163 place count 55 transition count 59
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 193 place count 31 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 196 place count 31 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 197 place count 30 transition count 49
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 30 edges and 28 vertex of which 20 / 28 are part of one of the 4 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 4 with 3 rules applied. Total rules applied 200 place count 12 transition count 49
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 28 transitions.
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 31 rules applied. Total rules applied 231 place count 9 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 237 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 9 transition count 11
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 7 with 1 rules applied. Total rules applied 242 place count 9 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 243 place count 8 transition count 10
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 246 place count 8 transition count 7
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 250 place count 5 transition count 6
Applied a total of 250 rules in 30 ms. Remains 5 /141 variables (removed 136) and now considering 6/170 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 5/141 places, 6/170 transitions.
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/5 properties
Knowledge based reduction with 8 factoid took 771 ms. Reduced automaton from 21 states, 102 edges and 4 AP (stutter sensitive) to 21 states, 102 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1307 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p0), (NOT p0), false, false, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 4566 ms.
Stuttering acceptance computed with spot in 1212 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p0), (NOT p0), false, false, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 1137 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), p1, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p2), (NOT p0), (NOT p0), false, false, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2221 reset in 290 ms.
Product exploration explored 100000 steps with 2254 reset in 561 ms.
Spot run failed in 101 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin5870297781406496553
[2026-05-27 07:57:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5870297781406496553
Running compilation step : cd /tmp/ltsmin5870297781406496553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin5870297781406496553;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5870297781406496553;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3863476415268731844.hoa' '--buchi-type=spotba'
LTSmin run took 2178 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-12 finished in 63450 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(p1)))'
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 148 transition count 181
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 148 transition count 181
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 142 transition count 175
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 142 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 142 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 138 transition count 169
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 138 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 138 transition count 166
Applied a total of 51 rules in 8 ms. Remains 138 /161 variables (removed 23) and now considering 166/194 (removed 28) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9439426619827716570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10781002905434408788.kers'
[2026-05-27 07:57:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9439426619827716570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10781002905434408788.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 166 rows 138 cols 429 entries
Finished phase 1 with 132 SingleSign rule and 0 generalized
[2026-05-27 07:57:49] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10781002905434408788.kers
Total runtime 1 ms.
[2026-05-27 07:57:49] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-27 07:57:49] [INFO ] Invariant cache hit.
[2026-05-27 07:57:49] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2026-05-27 07:57:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 0/304 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 144 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11707 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 166/304 variables, 138/144 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 165/309 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 324 constraints, problems are : Problem set: 0 solved, 165 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 41748ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 41749ms
Starting structural reductions in LTL mode, iteration 1 : 138/161 places, 166/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42073 ms. Remains : 138/161 places, 166/194 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(p1)))'
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 121 steps with 2 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-13 finished in 42362 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) U ((p1 U p2)&&(p0||X(X(p3))))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 147 transition count 180
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 147 transition count 180
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 141 transition count 174
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 141 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 141 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 137 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 137 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 137 transition count 165
Applied a total of 53 rules in 7 ms. Remains 137 /161 variables (removed 24) and now considering 165/194 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6700826690824380032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1775579272644353199.kers'
[2026-05-27 07:58:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6700826690824380032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1775579272644353199.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 165 rows 137 cols 427 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-27 07:58:31] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1775579272644353199.kers
Total runtime 2 ms.
[2026-05-27 07:58:31] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-27 07:58:31] [INFO ] Invariant cache hit.
[2026-05-27 07:58:31] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2026-05-27 07:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/302 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 0/302 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 143 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11395 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 165/302 variables, 137/143 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 164/307 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 5/312 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 318 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 41425ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 41425ms
Starting structural reductions in LTL mode, iteration 1 : 137/161 places, 165/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41814 ms. Remains : 137/161 places, 165/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1 U p2)&&(p0||X(X(p3))))))'
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-14
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-14 finished in 42337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 194/194 transitions.
Graph (trivial) has 139 edges and 161 vertex of which 18 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 145 transition count 153
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 120 transition count 153
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 51 place count 120 transition count 142
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 73 place count 109 transition count 142
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 90 place count 92 transition count 125
Iterating global reduction 2 with 17 rules applied. Total rules applied 107 place count 92 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 92 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 108 place count 92 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 90 transition count 122
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 117 place count 85 transition count 117
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 85 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 127 place count 85 transition count 112
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 181 place count 58 transition count 85
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 4 with 2 rules applied. Total rules applied 183 place count 57 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 188 place count 57 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 55 transition count 78
Applied a total of 190 rules in 27 ms. Remains 55 /161 variables (removed 106) and now considering 78/194 (removed 116) transitions.
[2026-05-27 07:59:13] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3965933105668810729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8644549877295245985.kers'
[2026-05-27 07:59:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3965933105668810729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8644549877295245985.kers]
Normalized transition count is 71 out of 72 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 71 rows 54 cols 185 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-27 07:59:13] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8644549877295245985.kers
Total runtime 1 ms.
[2026-05-27 07:59:13] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-27 07:59:13] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
[2026-05-27 07:59:13] [INFO ] Invariant cache hit.
[2026-05-27 07:59:14] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2026-05-27 07:59:14] [INFO ] Redundant transitions in 2 ms returned []
Running 52 sub problems to find dead transitions.
[2026-05-27 07:59:14] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
[2026-05-27 07:59:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 71/126 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/126 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/127 variables, and 61 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 4/55 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 71/126 variables, 55/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 52/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/127 variables, and 113 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4386ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4386ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/161 places, 78/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4661 ms. Remains : 55/161 places, 78/194 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p1)))'
Stuttering acceptance computed with spot in 118 ms :[p1, true, p1]
Running random walk in product with property : FlexibleBarrier-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04b-LTLFireability-15 finished in 4816 ms.
All properties solved by simple procedures.
Total runtime 457918 ms.

BK_STOP 1779868758712

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-04b.tgz
mv FlexibleBarrier-PT-04b 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;