fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r034-tall-177946841900276
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16207.867 3600000.00 6128686.00 69163.40 ?FFFFFFT??FFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841900276.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 BridgeAndVehicles-PT-V80P20N10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 23K Mar 5 08:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 5 08:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 348K Mar 5 08:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Mar 5 08:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Mar 15 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 15 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Mar 15 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Mar 15 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Mar 5 08:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 267K Mar 5 08:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 757K Mar 5 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.9M Mar 5 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.3K Mar 15 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779561802979

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 18:43:24] [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-23 18:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 18:43:24] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2026-05-23 18:43:24] [INFO ] Transformed 188 places.
[2026-05-23 18:43:24] [INFO ] Transformed 2108 transitions.
[2026-05-23 18:43:24] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 48 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2026-05-23 18:43:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11518096416854367339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15196724296294218424.kers'
[2026-05-23 18:43:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11518096416854367339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15196724296294218424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 18:43:24] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15196724296294218424.kers
Total runtime 3 ms.
[2026-05-23 18:43:24] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20085 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42136ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 42175ms
[2026-05-23 18:44:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:44:07] [INFO ] Invariant cache hit.
[2026-05-23 18:44:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-23 18:44:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:44:07] [INFO ] Invariant cache hit.
[2026-05-23 18:44:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:44:07] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42474 ms. Remains : 186/188 places, 2108/2108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 23 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 18:44:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:44:07] [INFO ] Invariant cache hit.
[2026-05-23 18:44:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 18:44:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:44:07] [INFO ] Invariant cache hit.
[2026-05-23 18:44:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:44:07] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 186/186 places, 2108/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2026-05-23 18:44:08] [INFO ] Flatten gal took : 264 ms
[2026-05-23 18:44:08] [INFO ] Flatten gal took : 149 ms
[2026-05-23 18:44:08] [INFO ] Input system was already deterministic with 2108 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40001 steps (56 resets) in 4586 ms. (8 steps per ms) remains 8/31 properties
BEST_FIRST walk for 40003 steps (20 resets) in 301 ms. (132 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (20 resets) in 241 ms. (165 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (20 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (20 resets) in 288 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (20 resets) in 233 ms. (170 steps per ms) remains 3/5 properties
[2026-05-23 18:44:10] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:44:10] [INFO ] Invariant cache hit.
[2026-05-23 18:44:10] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 368/547 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 22/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/556 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/0 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 368/547 variables, 179/183 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 22/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/556 variables, 7/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 214 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1131 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2113ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 771 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 430 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 181/186 places, 2104/2108 transitions.
RANDOM walk for 40000 steps (80 resets) in 1798 ms. (22 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 222354 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 3
Probabilistic random walk after 222354 steps, saw 75869 distinct states, run finished after 3008 ms. (steps per millisecond=73 ) properties seen :0
[2026-05-23 18:44:17] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17539823204154490127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8337269115651846135.kers'
[2026-05-23 18:44:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17539823204154490127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8337269115651846135.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 181 cols 1620 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-23 18:44:17] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8337269115651846135.kers
Total runtime 5 ms.
[2026-05-23 18:44:17] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/0 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/547 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1347ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 662 ms.
Support contains 9 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2104/2104 transitions.
Applied a total of 0 rules in 194 ms. Remains 181 /181 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 181/181 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2104/2104 transitions.
Applied a total of 0 rules in 173 ms. Remains 181 /181 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 18:44:19] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:44:19] [INFO ] Invariant cache hit.
[2026-05-23 18:44:20] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-23 18:44:20] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:44:20] [INFO ] Invariant cache hit.
[2026-05-23 18:44:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:44:21] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1913 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/181 places, 2104/2104 transitions.
Applied a total of 0 rules in 134 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2221 ms. Remains : 179/181 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (80 resets) in 439 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (40 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 243992 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 3
Probabilistic random walk after 243992 steps, saw 80205 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2026-05-23 18:44:25] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18164828806737207895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11399744685832813846.kers'
[2026-05-23 18:44:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18164828806737207895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11399744685832813846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 179 cols 1298 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:44:25] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11399744685832813846.kers
Total runtime 3 ms.
[2026-05-23 18:44:25] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/545 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/0 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/543 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/543 variables, 22/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/545 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 3 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1417ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 805 ms.
Support contains 9 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 130 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 179/179 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 155 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 18:44:27] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:44:27] [INFO ] Invariant cache hit.
[2026-05-23 18:44:28] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-23 18:44:28] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:44:28] [INFO ] Invariant cache hit.
[2026-05-23 18:44:28] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:44:28] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2026-05-23 18:44:28] [INFO ] Redundant transitions in 117 ms returned []
Running 2101 sub problems to find dead transitions.
[2026-05-23 18:44:29] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:44:29] [INFO ] Invariant cache hit.
[2026-05-23 18:44:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1312 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/545 variables, and 5 constraints, problems are : Problem set: 89 solved, 2012 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2101/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 89 solved, 2012 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 89 solved, 2012 unsolved
Problem TDEAD1323 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2093 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 160 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/545 variables, and 5 constraints, problems are : Problem set: 160 solved, 1941 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1852/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61700ms problems are : Problem set: 160 solved, 1941 unsolved
Search for dead transitions found 160 dead transitions in 61706ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/179 places, 1944/2104 transitions.
Applied a total of 0 rules in 113 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:45:30] [INFO ] Redundant transitions in 89 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63328 ms. Remains : 179/179 places, 1944/2104 transitions.
RANDOM walk for 40000 steps (80 resets) in 437 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (40 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (40 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (40 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 278341 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 3
Probabilistic random walk after 278341 steps, saw 90153 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2026-05-23 18:45:34] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16520142166477271316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14338818265428597973.kers'
[2026-05-23 18:45:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16520142166477271316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14338818265428597973.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 179 cols 1294 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:45:34] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14338818265428597973.kers
Total runtime 3 ms.
[2026-05-23 18:45:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 364/541 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/543 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/0 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 168/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 364/541 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/541 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/541 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/543 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 3 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1267ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 198 ms.
Support contains 9 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 106 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 179/179 places, 1944/1944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 107 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:45:35] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:45:35] [INFO ] Invariant cache hit.
[2026-05-23 18:45:36] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-23 18:45:36] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:45:36] [INFO ] Invariant cache hit.
[2026-05-23 18:45:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:45:37] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2026-05-23 18:45:37] [INFO ] Redundant transitions in 41 ms returned []
Running 1941 sub problems to find dead transitions.
[2026-05-23 18:45:37] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:45:37] [INFO ] Invariant cache hit.
[2026-05-23 18:45:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/543 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1941/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/543 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1781/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61538ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 61543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63546 ms. Remains : 179/179 places, 1944/1944 transitions.
Computed a total of 169 stabilizing places and 324 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))'
Support contains 82 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 316 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2026-05-23 18:46:40] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14690650382773192775.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5003649089072022509.kers'
[2026-05-23 18:46:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14690650382773192775.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5003649089072022509.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 181 cols 1620 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-23 18:46:40] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5003649089072022509.kers
Total runtime 3 ms.
[2026-05-23 18:46:40] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-23 18:46:40] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:46:40] [INFO ] Invariant cache hit.
[2026-05-23 18:46:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:46:41] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1556 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 137 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2010 ms. Remains : 179/186 places, 2104/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-00
Product exploration explored 100000 steps with 423 reset in 744 ms.
Product exploration explored 100000 steps with 423 reset in 644 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/179 stabilizing places and 322/2104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 53 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 899 steps (0 resets) in 12 ms. (69 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 47 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2026-05-23 18:46:43] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-881586148447559359.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11045193687483089393.kers'
[2026-05-23 18:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-881586148447559359.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11045193687483089393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 179 cols 1298 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:46:43] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11045193687483089393.kers
Total runtime 2 ms.
[2026-05-23 18:46:45] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2026-05-23 18:46:45] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2026-05-23 18:46:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:46:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2026-05-23 18:46:47] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2026-05-23 18:46:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:46:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 204 ms returned sat
[2026-05-23 18:46:47] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 193 transitions) in 72 ms.
[2026-05-23 18:46:47] [INFO ] Added : 12 causal constraints over 3 iterations in 271 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 4326 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 82 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 235 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 18:46:48] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:46:48] [INFO ] Invariant cache hit.
[2026-05-23 18:46:48] [INFO ] Implicit Places using invariants in 258 ms returned []
[2026-05-23 18:46:48] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:46:48] [INFO ] Invariant cache hit.
[2026-05-23 18:46:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:46:49] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2026-05-23 18:46:49] [INFO ] Redundant transitions in 49 ms returned []
Running 2101 sub problems to find dead transitions.
[2026-05-23 18:46:49] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:46:49] [INFO ] Invariant cache hit.
[2026-05-23 18:46:49] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1334 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/545 variables, and 5 constraints, problems are : Problem set: 91 solved, 2010 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2101/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 91 solved, 2010 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 91 solved, 2010 unsolved
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2093 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 160 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/545 variables, and 5 constraints, problems are : Problem set: 160 solved, 1941 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1850/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61757ms problems are : Problem set: 160 solved, 1941 unsolved
Search for dead transitions found 160 dead transitions in 61764ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/179 places, 1944/2104 transitions.
Applied a total of 0 rules in 107 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:47:51] [INFO ] Redundant transitions in 42 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63194 ms. Remains : 179/179 places, 1944/2104 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/179 stabilizing places and 322/1944 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 38 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 950 steps (0 resets) in 14 ms. (63 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 65 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2026-05-23 18:47:51] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16254295993483554328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-239228061310731096.kers'
[2026-05-23 18:47:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16254295993483554328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-239228061310731096.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 179 cols 1294 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:47:51] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-239228061310731096.kers
Total runtime 2 ms.
[2026-05-23 18:47:52] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2026-05-23 18:47:53] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2026-05-23 18:47:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 18:47:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2026-05-23 18:47:55] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-23 18:47:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:47:55] [INFO ] [Nat]Added 20 Read/Feed constraints in 152 ms returned sat
[2026-05-23 18:47:55] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 191 transitions) in 27 ms.
[2026-05-23 18:47:55] [INFO ] Added : 12 causal constraints over 3 iterations in 233 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 4455 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 424 reset in 568 ms.
Product exploration explored 100000 steps with 421 reset in 577 ms.
Built C files in :
/tmp/ltsmin588821781574975970
[2026-05-23 18:47:56] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:47:56] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin588821781574975970
Running compilation step : cd /tmp/ltsmin588821781574975970;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin588821781574975970;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin588821781574975970;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 82 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 113 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:48:00] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:48:00] [INFO ] Invariant cache hit.
[2026-05-23 18:48:00] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-23 18:48:00] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:48:00] [INFO ] Invariant cache hit.
[2026-05-23 18:48:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:48:01] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2026-05-23 18:48:01] [INFO ] Redundant transitions in 36 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1366 ms. Remains : 179/179 places, 1944/1944 transitions.
Built C files in :
/tmp/ltsmin15664299869384311071
[2026-05-23 18:48:01] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:48:01] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15664299869384311071
Running compilation step : cd /tmp/ltsmin15664299869384311071;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15664299869384311071;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15664299869384311071;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 18:48:04] [INFO ] Flatten gal took : 50 ms
[2026-05-23 18:48:04] [INFO ] Flatten gal took : 43 ms
[2026-05-23 18:48:04] [INFO ] Time to serialize gal into /tmp/LTL1462317950380227723.gal : 26 ms
[2026-05-23 18:48:04] [INFO ] Time to serialize properties into /tmp/LTL12279825317235419166.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1462317950380227723.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10374962021220401074.hoa' '-atoms' '/tmp/LTL12279825317235419166.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12279825317235419166.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10374962021220401074.hoa
Detected timeout of ITS tools.
[2026-05-23 18:48:19] [INFO ] Flatten gal took : 40 ms
[2026-05-23 18:48:19] [INFO ] Flatten gal took : 39 ms
[2026-05-23 18:48:19] [INFO ] Time to serialize gal into /tmp/LTL3064961237435444816.gal : 12 ms
[2026-05-23 18:48:19] [INFO ] Time to serialize properties into /tmp/LTL796475765424709932.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3064961237435444816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL796475765424709932.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((NB_ATTENTE_B_75<1)||(ROUTE_B<1))&&((NB_ATTENTE_B_56<1)||(ROUTE_B<1)))&&(((NB_ATTENTE_B_17<1)||(ROUTE_B<1))&&((NB_ATTENT...3095
Formula 0 simplified : G!"(((((((((NB_ATTENTE_B_75<1)||(ROUTE_B<1))&&((NB_ATTENTE_B_56<1)||(ROUTE_B<1)))&&(((NB_ATTENTE_B_17<1)||(ROUTE_B<1))&&((NB_ATTENTE...3091
Detected timeout of ITS tools.
[2026-05-23 18:48:35] [INFO ] Flatten gal took : 32 ms
[2026-05-23 18:48:35] [INFO ] Applying decomposition
[2026-05-23 18:48:35] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6507906499271544090.txt' '-o' '/tmp/graph6507906499271544090.bin' '-w' '/tmp/graph6507906499271544090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6507906499271544090.bin' '-l' '-1' '-v' '-w' '/tmp/graph6507906499271544090.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:48:35] [INFO ] Decomposing Gal with order
[2026-05-23 18:48:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:48:35] [INFO ] Removed a total of 3270 redundant transitions.
[2026-05-23 18:48:36] [INFO ] Flatten gal took : 669 ms
[2026-05-23 18:48:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 496 labels/synchronizations in 40 ms.
[2026-05-23 18:48:36] [INFO ] Time to serialize gal into /tmp/LTL10108549911053661824.gal : 4 ms
[2026-05-23 18:48:36] [INFO ] Time to serialize properties into /tmp/LTL14077085891481849222.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10108549911053661824.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14077085891481849222.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F("(((((((((i0.u2.NB_ATTENTE_B_75<1)||(i0.u2.ROUTE_B<1))&&((i0.u2.NB_ATTENTE_B_56<1)||(i0.u2.ROUTE_B<1)))&&(((i0.u2.NB_ATTENTE_B_17...4064
Formula 0 simplified : G!"(((((((((i0.u2.NB_ATTENTE_B_75<1)||(i0.u2.ROUTE_B<1))&&((i0.u2.NB_ATTENTE_B_56<1)||(i0.u2.ROUTE_B<1)))&&(((i0.u2.NB_ATTENTE_B_17<...4060
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-00 finished in 131251 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((X((p1&&X(p2)))||p0)) U X(X(G(!p1)))))'
Support contains 96 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 17 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2026-05-23 18:48:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6197764837514865486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16111864126965787526.kers'
[2026-05-23 18:48:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6197764837514865486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16111864126965787526.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 369 rows 184 cols 1785 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-23 18:48:51] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16111864126965787526.kers
Total runtime 2 ms.
[2026-05-23 18:48:51] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41712ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 41718ms
[2026-05-23 18:49:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 18:49:32] [INFO ] Invariant cache hit.
[2026-05-23 18:49:33] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-23 18:49:33] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 18:49:33] [INFO ] Invariant cache hit.
[2026-05-23 18:49:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:49:33] [INFO ] Implicit Places using invariants and state equation in 768 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 995 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42753 ms. Remains : 184/186 places, 2107/2108 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((X((p1&&X(p2)))||p0)) U X(X(G(!p1)))))'
Stuttering acceptance computed with spot in 384 ms :[(AND p1 (NOT p2)), false, p1, (AND p1 (NOT p2)), true, false, false, p1, (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-01 finished in 43200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0)||F(p1)) U X(X(X(p2))))))'
Support contains 177 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 16 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 18:49:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 18:49:34] [INFO ] Invariant cache hit.
[2026-05-23 18:49:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-23 18:49:34] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 18:49:34] [INFO ] Invariant cache hit.
[2026-05-23 18:49:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:49:35] [INFO ] Implicit Places using invariants and state equation in 660 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 730 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 759 ms. Remains : 183/186 places, 2107/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0)||F(p1)) U X(X(X(p2))))))'
Stuttering acceptance computed with spot in 652 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-02
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 31 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-02 finished in 1534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 164 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 222 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2026-05-23 18:49:36] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1438453267784786881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4555304439667236080.kers'
[2026-05-23 18:49:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1438453267784786881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4555304439667236080.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 181 cols 1620 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-23 18:49:36] [INFO ] Computed 4 invariants in 5 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4555304439667236080.kers
Total runtime 6 ms.
[2026-05-23 18:49:36] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-23 18:49:36] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:49:36] [INFO ] Invariant cache hit.
[2026-05-23 18:49:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:49:37] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1322 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 135 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1679 ms. Remains : 179/186 places, 2104/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-03
Stuttering criterion allowed to conclude after 499 steps with 0 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-03 finished in 1838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 24 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2026-05-23 18:49:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14485309970501262360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12568660287099790179.kers'
[2026-05-23 18:49:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14485309970501262360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12568660287099790179.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 18:49:37] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12568660287099790179.kers
Total runtime 3 ms.
[2026-05-23 18:49:37] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41592ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 41597ms
[2026-05-23 18:50:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:50:19] [INFO ] Invariant cache hit.
[2026-05-23 18:50:19] [INFO ] Implicit Places using invariants in 387 ms returned []
[2026-05-23 18:50:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:50:19] [INFO ] Invariant cache hit.
[2026-05-23 18:50:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:50:20] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1628 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43271 ms. Remains : 184/186 places, 2108/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||p1))))'
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-05 finished in 43400 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(p1)&&p0)))'
Support contains 83 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 18:50:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:50:21] [INFO ] Invariant cache hit.
[2026-05-23 18:50:21] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-23 18:50:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:50:21] [INFO ] Invariant cache hit.
[2026-05-23 18:50:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:50:23] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1980 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 12 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2005 ms. Remains : 184/186 places, 2108/2108 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(p1)&&p0)))'
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-06 finished in 2164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p0||((p1 U p2) U p3)))))'
Support contains 177 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 10 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 18:50:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:50:23] [INFO ] Invariant cache hit.
[2026-05-23 18:50:23] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-23 18:50:23] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:50:23] [INFO ] Invariant cache hit.
[2026-05-23 18:50:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:50:24] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1566 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1593 ms. Remains : 184/186 places, 2108/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((!p0||((p1 U p2) U p3)))))'
Stuttering acceptance computed with spot in 205 ms :[(AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND p0 (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-07
Product exploration timeout after 68290 steps with 34145 reset in 10002 ms.
Product exploration timeout after 75370 steps with 37685 reset in 10002 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 22 ms. Proved property starting from automaton with 6 states, 12 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 77 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-07 finished in 21953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 195 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2026-05-23 18:50:45] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17419645072292093429.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-29606865012266839.kers'
[2026-05-23 18:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17419645072292093429.kers, --Pflows, --basisKERS=/tmp/petrispot-output-29606865012266839.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 181 cols 1620 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-23 18:50:45] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-29606865012266839.kers
Total runtime 5 ms.
[2026-05-23 18:50:45] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-23 18:50:45] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:50:45] [INFO ] Invariant cache hit.
[2026-05-23 18:50:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:50:48] [INFO ] Implicit Places using invariants and state equation in 2540 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2862 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 158 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3217 ms. Remains : 179/186 places, 2104/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p1)))'
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-08
Product exploration explored 100000 steps with 1654 reset in 524 ms.
Product exploration explored 100000 steps with 1633 reset in 511 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/179 stabilizing places and 322/2104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 43 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (80 resets) in 618 ms. (64 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (40 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 295 ms. (135 steps per ms) remains 2/2 properties
[2026-05-23 18:50:50] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2919319894995163460.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-50954240059014561.kers'
[2026-05-23 18:50:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2919319894995163460.kers, --Pflows, --basisKERS=/tmp/petrispot-output-50954240059014561.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 179 cols 1298 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:50:50] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-50954240059014561.kers
Total runtime 2 ms.
[2026-05-23 18:50:50] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/545 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/545 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1401ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 90 ms.
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 124 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 179/179 places, 2104/2104 transitions.
RANDOM walk for 40000 steps (80 resets) in 371 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (40 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 274485 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 274485 steps, saw 88844 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2026-05-23 18:50:54] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:50:54] [INFO ] Invariant cache hit.
[2026-05-23 18:50:54] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/545 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 366/544 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/544 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/545 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/545 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3178 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3464ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 128 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 179/179 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 125 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 18:50:58] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:50:58] [INFO ] Invariant cache hit.
[2026-05-23 18:50:59] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-23 18:50:59] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:50:59] [INFO ] Invariant cache hit.
[2026-05-23 18:50:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:51:00] [INFO ] Implicit Places using invariants and state equation in 1684 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
[2026-05-23 18:51:00] [INFO ] Redundant transitions in 49 ms returned []
Running 2101 sub problems to find dead transitions.
[2026-05-23 18:51:00] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:51:00] [INFO ] Invariant cache hit.
[2026-05-23 18:51:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1323 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/545 variables, and 5 constraints, problems are : Problem set: 90 solved, 2011 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2101/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 2011 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 90 solved, 2011 unsolved
Problem TDEAD1334 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2093 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 160 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/545 variables, and 5 constraints, problems are : Problem set: 160 solved, 1941 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1851/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61794ms problems are : Problem set: 160 solved, 1941 unsolved
Search for dead transitions found 160 dead transitions in 61799ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/179 places, 1944/2104 transitions.
Applied a total of 0 rules in 100 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:52:02] [INFO ] Redundant transitions in 39 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64137 ms. Remains : 179/179 places, 1944/2104 transitions.
RANDOM walk for 40000 steps (80 resets) in 351 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (39 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 299752 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 299752 steps, saw 96014 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-23 18:52:05] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5824464537693458388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10189682598158194596.kers'
[2026-05-23 18:52:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5824464537693458388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10189682598158194596.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 179 cols 1294 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:52:05] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10189682598158194596.kers
Total runtime 3 ms.
[2026-05-23 18:52:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/543 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/543 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8242 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8534ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 100 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 179/179 places, 1944/1944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 99 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:52:14] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:52:14] [INFO ] Invariant cache hit.
[2026-05-23 18:52:15] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-23 18:52:15] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:52:15] [INFO ] Invariant cache hit.
[2026-05-23 18:52:15] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:52:16] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2026-05-23 18:52:16] [INFO ] Redundant transitions in 41 ms returned []
Running 1941 sub problems to find dead transitions.
[2026-05-23 18:52:16] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:52:16] [INFO ] Invariant cache hit.
[2026-05-23 18:52:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/543 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1941/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1941 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1941 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/543 variables, and 4 constraints, problems are : Problem set: 0 solved, 1941 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1781/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61542ms problems are : Problem set: 0 solved, 1941 unsolved
Search for dead transitions found 0 dead transitions in 61546ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63005 ms. Remains : 179/179 places, 1944/1944 transitions.
Knowledge based reduction with 10 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 148235 ms.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 148 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 18:53:18] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6620425669969811044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8174248373770528720.kers'
[2026-05-23 18:53:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6620425669969811044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8174248373770528720.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 179 cols 1298 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:53:18] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8174248373770528720.kers
Total runtime 3 ms.
[2026-05-23 18:53:18] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-23 18:53:18] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:53:18] [INFO ] Invariant cache hit.
[2026-05-23 18:53:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:53:19] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 1965 ms to find 0 implicit places.
[2026-05-23 18:53:20] [INFO ] Redundant transitions in 45 ms returned []
Running 2101 sub problems to find dead transitions.
[2026-05-23 18:53:20] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:53:20] [INFO ] Invariant cache hit.
[2026-05-23 18:53:20] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1323 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/545 variables, and 5 constraints, problems are : Problem set: 90 solved, 2011 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2101/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 2011 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 90 solved, 2011 unsolved
Problem TDEAD1334 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2093 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 160 solved, 1941 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/545 variables, and 5 constraints, problems are : Problem set: 160 solved, 1941 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1851/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61670ms problems are : Problem set: 160 solved, 1941 unsolved
Search for dead transitions found 160 dead transitions in 61674ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/179 places, 1944/2104 transitions.
Applied a total of 0 rules in 116 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:54:21] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 64007 ms. Remains : 179/179 places, 1944/2104 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/179 stabilizing places and 322/1944 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (80 resets) in 467 ms. (85 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (40 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
[2026-05-23 18:54:22] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14906367610555882597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5554462176840013519.kers'
[2026-05-23 18:54:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14906367610555882597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5554462176840013519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 179 cols 1294 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:54:22] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5554462176840013519.kers
Total runtime 2 ms.
[2026-05-23 18:54:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/543 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/543 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1226 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1522ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 78 ms.
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 100 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 179/179 places, 1944/1944 transitions.
RANDOM walk for 40000 steps (80 resets) in 399 ms. (100 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (40 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (40 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 298592 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 2
Probabilistic random walk after 298592 steps, saw 95733 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-23 18:54:27] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:54:27] [INFO ] Invariant cache hit.
[2026-05-23 18:54:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/543 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 172/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 364/542 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/543 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/543 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 203 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4955 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5252ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 101 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 179/179 places, 1944/1944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 101 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:54:32] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:54:32] [INFO ] Invariant cache hit.
[2026-05-23 18:54:33] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-23 18:54:33] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:54:33] [INFO ] Invariant cache hit.
[2026-05-23 18:54:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:54:34] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2026-05-23 18:54:34] [INFO ] Redundant transitions in 41 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1440 ms. Remains : 179/179 places, 1944/1944 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1580 transitions
Reduce isomorphic transitions removed 1580 transitions.
Iterating post reduction 0 with 1580 rules applied. Total rules applied 1580 place count 179 transition count 364
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1581 place count 179 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1582 place count 178 transition count 363
Applied a total of 1582 rules in 17 ms. Remains 178 /179 variables (removed 1) and now considering 363/1944 (removed 1581) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9873857983825204321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18312018544577864097.kers'
[2026-05-23 18:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9873857983825204321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18312018544577864097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 363 rows 178 cols 1290 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-23 18:54:34] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18312018544577864097.kers
Total runtime 2 ms.
[2026-05-23 18:54:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 18:54:34] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 18:54:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-23 18:54:34] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 18:54:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 18:54:34] [INFO ] After 246ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 18:54:34] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 18:54:35] [INFO ] After 886ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1091 ms.
Knowledge based reduction with 10 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 13410 ms.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1630 reset in 458 ms.
Product exploration explored 100000 steps with 1674 reset in 461 ms.
Built C files in :
/tmp/ltsmin3269494513529467374
[2026-05-23 18:54:36] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:54:36] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3269494513529467374
Running compilation step : cd /tmp/ltsmin3269494513529467374;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3269494513529467374;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3269494513529467374;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 123 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:54:39] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-681818837637497509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14604516390024713070.kers'
[2026-05-23 18:54:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-681818837637497509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14604516390024713070.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 179 cols 1294 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:54:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14604516390024713070.kers
Total runtime 2 ms.
[2026-05-23 18:54:39] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-23 18:54:39] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:54:39] [INFO ] Invariant cache hit.
[2026-05-23 18:54:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:54:40] [INFO ] Implicit Places using invariants and state equation in 983 ms returned []
Implicit Place search using SMT with State Equation took 1275 ms to find 0 implicit places.
[2026-05-23 18:54:40] [INFO ] Redundant transitions in 44 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1445 ms. Remains : 179/179 places, 1944/1944 transitions.
Built C files in :
/tmp/ltsmin11742716084654079572
[2026-05-23 18:54:40] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:54:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11742716084654079572
Running compilation step : cd /tmp/ltsmin11742716084654079572;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11742716084654079572;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11742716084654079572;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 18:54:43] [INFO ] Flatten gal took : 46 ms
[2026-05-23 18:54:44] [INFO ] Flatten gal took : 32 ms
[2026-05-23 18:54:44] [INFO ] Time to serialize gal into /tmp/LTL6582852370475112985.gal : 10 ms
[2026-05-23 18:54:44] [INFO ] Time to serialize properties into /tmp/LTL10102735399602582570.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6582852370475112985.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6120688327354106136.hoa' '-atoms' '/tmp/LTL10102735399602582570.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10102735399602582570.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6120688327354106136.hoa
Detected timeout of ITS tools.
[2026-05-23 18:54:59] [INFO ] Flatten gal took : 29 ms
[2026-05-23 18:54:59] [INFO ] Flatten gal took : 30 ms
[2026-05-23 18:54:59] [INFO ] Time to serialize gal into /tmp/LTL12959642296856990623.gal : 9 ms
[2026-05-23 18:54:59] [INFO ] Time to serialize properties into /tmp/LTL15005219856462039869.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12959642296856990623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15005219856462039869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_41<1)||(COMPTEUR_8<1)))"))||("((NB_ATTENTE_B_17>=1)&&(ROUTE_B>=1))"))...157
Formula 0 simplified : G(!"((NB_ATTENTE_B_17>=1)&&(ROUTE_B>=1))" & F!"(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_41<1)||(COMPTEUR_8<1)))")
Detected timeout of ITS tools.
[2026-05-23 18:55:14] [INFO ] Flatten gal took : 35 ms
[2026-05-23 18:55:14] [INFO ] Applying decomposition
[2026-05-23 18:55:14] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6326632539444079252.txt' '-o' '/tmp/graph6326632539444079252.bin' '-w' '/tmp/graph6326632539444079252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6326632539444079252.bin' '-l' '-1' '-v' '-w' '/tmp/graph6326632539444079252.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:55:14] [INFO ] Decomposing Gal with order
[2026-05-23 18:55:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:55:14] [INFO ] Removed a total of 4732 redundant transitions.
[2026-05-23 18:55:14] [INFO ] Flatten gal took : 205 ms
[2026-05-23 18:55:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 682 labels/synchronizations in 34 ms.
[2026-05-23 18:55:14] [INFO ] Time to serialize gal into /tmp/LTL188509150960418456.gal : 2 ms
[2026-05-23 18:55:14] [INFO ] Time to serialize properties into /tmp/LTL3675624415439101647.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL188509150960418456.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3675624415439101647.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i2.u0.NB_ATTENTE_A_0<1)||(i2.u0.CONTROLEUR_1<1))||((i2.u12.NB_ATTENTE_B_41<1)||(i1.u10.COMPTEUR_8<1)))"))||("((i2.u12.NB_A...197
Formula 0 simplified : G(!"((i2.u12.NB_ATTENTE_B_17>=1)&&(i2.u12.ROUTE_B>=1))" & F!"(((i2.u0.NB_ATTENTE_A_0<1)||(i2.u0.CONTROLEUR_1<1))||((i2.u12.NB_ATTENT...191
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-08 finished in 284579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2104
Applied a total of 9 rules in 205 ms. Remains 181 /186 variables (removed 5) and now considering 2104/2108 (removed 4) transitions.
[2026-05-23 18:55:30] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4136414819475316284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5476076344755854300.kers'
[2026-05-23 18:55:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4136414819475316284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5476076344755854300.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 181 cols 1620 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-23 18:55:30] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5476076344755854300.kers
Total runtime 2 ms.
[2026-05-23 18:55:30] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-23 18:55:30] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:55:30] [INFO ] Invariant cache hit.
[2026-05-23 18:55:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:55:32] [INFO ] Implicit Places using invariants and state equation in 1839 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2178 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/186 places, 2104/2108 transitions.
Applied a total of 0 rules in 153 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2538 ms. Remains : 179/186 places, 2104/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-09
Product exploration explored 100000 steps with 200 reset in 740 ms.
Product exploration explored 100000 steps with 200 reset in 665 ms.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/179 stabilizing places and 322/2104 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 42 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (80 resets) in 440 ms. (90 steps per ms) remains 2/4 properties
BEST_FIRST walk for 11512 steps (11 resets) in 57 ms. (198 steps per ms) remains 0/2 properties
Knowledge based reduction with 10 factoid took 98 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 433 ms.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 2104/2104 transitions.
Applied a total of 0 rules in 159 ms. Remains 179 /179 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2026-05-23 18:55:34] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14922740038847768040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15409653788712065005.kers'
[2026-05-23 18:55:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14922740038847768040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15409653788712065005.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 179 cols 1298 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:55:34] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15409653788712065005.kers
Total runtime 1 ms.
[2026-05-23 18:55:34] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-23 18:55:34] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:55:34] [INFO ] Invariant cache hit.
[2026-05-23 18:55:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:55:35] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2026-05-23 18:55:35] [INFO ] Redundant transitions in 48 ms returned []
Running 2101 sub problems to find dead transitions.
[2026-05-23 18:55:35] [INFO ] Flow matrix only has 366 transitions (discarded 1738 similar events)
[2026-05-23 18:55:35] [INFO ] Invariant cache hit.
[2026-05-23 18:55:35] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2101 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1345 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/545 variables, and 5 constraints, problems are : Problem set: 92 solved, 2009 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2101/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 92 solved, 2009 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 4/4 constraints. Problems are: Problem set: 92 solved, 2009 unsolved
Problem TDEAD1356 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1477 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2093 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 1/5 constraints. Problems are: Problem set: 160 solved, 1941 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 179/545 variables, and 5 constraints, problems are : Problem set: 160 solved, 1941 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/179 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1849/160 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61678ms problems are : Problem set: 160 solved, 1941 unsolved
Search for dead transitions found 160 dead transitions in 61682ms
Found 160 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 160 transitions
Dead transitions reduction (with SMT) removed 160 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 179/179 places, 1944/2104 transitions.
Applied a total of 0 rules in 116 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:56:37] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63145 ms. Remains : 179/179 places, 1944/2104 transitions.
Computed a total of 164 stabilizing places and 322 stable transitions
Computed a total of 164 stabilizing places and 322 stable transitions
Detected a total of 164/179 stabilizing places and 322/1944 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 48 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (80 resets) in 419 ms. (95 steps per ms) remains 2/4 properties
BEST_FIRST walk for 26183 steps (26 resets) in 180 ms. (144 steps per ms) remains 0/2 properties
Knowledge based reduction with 10 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 485 ms.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 200 reset in 609 ms.
Product exploration explored 100000 steps with 200 reset in 620 ms.
Built C files in :
/tmp/ltsmin9388787065207137748
[2026-05-23 18:56:39] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:56:39] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9388787065207137748
Running compilation step : cd /tmp/ltsmin9388787065207137748;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9388787065207137748;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9388787065207137748;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 1944/1944 transitions.
Applied a total of 0 rules in 116 ms. Remains 179 /179 variables (removed 0) and now considering 1944/1944 (removed 0) transitions.
[2026-05-23 18:56:42] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5811652223149427263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11728952188111491417.kers'
[2026-05-23 18:56:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5811652223149427263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11728952188111491417.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 179 cols 1294 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-23 18:56:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11728952188111491417.kers
Total runtime 3 ms.
[2026-05-23 18:56:42] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-23 18:56:42] [INFO ] Flow matrix only has 364 transitions (discarded 1580 similar events)
[2026-05-23 18:56:42] [INFO ] Invariant cache hit.
[2026-05-23 18:56:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 18:56:43] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2026-05-23 18:56:43] [INFO ] Redundant transitions in 40 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1323 ms. Remains : 179/179 places, 1944/1944 transitions.
Built C files in :
/tmp/ltsmin11595991189797578785
[2026-05-23 18:56:43] [INFO ] Too many transitions (1944) to apply POR reductions. Disabling POR matrices.
[2026-05-23 18:56:43] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11595991189797578785
Running compilation step : cd /tmp/ltsmin11595991189797578785;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11595991189797578785;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11595991189797578785;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 18:56:46] [INFO ] Flatten gal took : 35 ms
[2026-05-23 18:56:46] [INFO ] Flatten gal took : 35 ms
[2026-05-23 18:56:46] [INFO ] Time to serialize gal into /tmp/LTL4839719804769212951.gal : 9 ms
[2026-05-23 18:56:46] [INFO ] Time to serialize properties into /tmp/LTL5944178354136143407.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4839719804769212951.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10605189585234724552.hoa' '-atoms' '/tmp/LTL5944178354136143407.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5944178354136143407.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10605189585234724552.hoa
Detected timeout of ITS tools.
[2026-05-23 18:57:02] [INFO ] Flatten gal took : 31 ms
[2026-05-23 18:57:02] [INFO ] Flatten gal took : 31 ms
[2026-05-23 18:57:02] [INFO ] Time to serialize gal into /tmp/LTL2905467334772180614.gal : 10 ms
[2026-05-23 18:57:02] [INFO ] Time to serialize properties into /tmp/LTL10574139687170896039.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2905467334772180614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10574139687170896039.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_56<1)||(COMPTEUR_2<1)))"))||(G(F("((ROUTE_A>=1)&&(NB_ATTENTE_A_53>=1)...163
Formula 0 simplified : G(F!"(((NB_ATTENTE_A_0<1)||(CONTROLEUR_1<1))||((NB_ATTENTE_B_56<1)||(COMPTEUR_2<1)))" & FG!"((ROUTE_A>=1)&&(NB_ATTENTE_A_53>=1))")
Detected timeout of ITS tools.
[2026-05-23 18:57:17] [INFO ] Flatten gal took : 30 ms
[2026-05-23 18:57:17] [INFO ] Applying decomposition
[2026-05-23 18:57:17] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13876100759263712667.txt' '-o' '/tmp/graph13876100759263712667.bin' '-w' '/tmp/graph13876100759263712667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13876100759263712667.bin' '-l' '-1' '-v' '-w' '/tmp/graph13876100759263712667.weights' '-q' '0' '-e' '0.001'
[2026-05-23 18:57:17] [INFO ] Decomposing Gal with order
[2026-05-23 18:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 18:57:17] [INFO ] Removed a total of 4559 redundant transitions.
[2026-05-23 18:57:17] [INFO ] Flatten gal took : 261 ms
[2026-05-23 18:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 704 labels/synchronizations in 31 ms.
[2026-05-23 18:57:17] [INFO ] Time to serialize gal into /tmp/LTL6555813381577863558.gal : 2 ms
[2026-05-23 18:57:17] [INFO ] Time to serialize properties into /tmp/LTL5092487198819125448.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6555813381577863558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5092487198819125448.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i1.u7.NB_ATTENTE_A_0<1)||(i1.u7.CONTROLEUR_1<1))||((i1.u5.NB_ATTENTE_B_56<1)||(i2.u8.COMPTEUR_2<1)))"))||(G(F("((i0.u6.ROU...199
Formula 0 simplified : G(F!"(((i1.u7.NB_ATTENTE_A_0<1)||(i1.u7.CONTROLEUR_1<1))||((i1.u5.NB_ATTENTE_B_56<1)||(i2.u8.COMPTEUR_2<1)))" & FG!"((i0.u6.ROUTE_A>...189
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-09 finished in 122989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(G((p0 U G(p1))))) U p2)))))'
Support contains 7 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 16 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2026-05-23 18:57:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9277138922319169530.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11489611456913550832.kers'
[2026-05-23 18:57:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9277138922319169530.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11489611456913550832.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 18:57:32] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11489611456913550832.kers
Total runtime 5 ms.
[2026-05-23 18:57:32] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41664ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 41669ms
[2026-05-23 18:58:14] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:58:14] [INFO ] Invariant cache hit.
[2026-05-23 18:58:14] [INFO ] Implicit Places using invariants in 350 ms returned []
[2026-05-23 18:58:14] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:58:14] [INFO ] Invariant cache hit.
[2026-05-23 18:58:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:58:15] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1389 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 17 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43096 ms. Remains : 185/186 places, 2108/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(G((p0 U G(p1))))) U p2)))))'
Stuttering acceptance computed with spot in 298 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-10
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-10 finished in 43443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U p1))))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 26 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2026-05-23 18:58:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3851541213690231801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8540103679834653151.kers'
[2026-05-23 18:58:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3851541213690231801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8540103679834653151.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 369 rows 184 cols 1785 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-23 18:58:16] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8540103679834653151.kers
Total runtime 6 ms.
[2026-05-23 18:58:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41801ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 41806ms
[2026-05-23 18:58:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 18:58:58] [INFO ] Invariant cache hit.
[2026-05-23 18:58:58] [INFO ] Implicit Places using invariants in 336 ms returned []
[2026-05-23 18:58:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 18:58:58] [INFO ] Invariant cache hit.
[2026-05-23 18:58:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:58:59] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1622 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 16 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43477 ms. Remains : 183/186 places, 2107/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0)) U p1))))'
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-11
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-11 finished in 43662 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(p1)&&((!p2&&G(p3)) U p4)&&p0)))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 14 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2026-05-23 18:58:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11105802616406517969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1033574600509143894.kers'
[2026-05-23 18:58:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11105802616406517969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1033574600509143894.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 186 cols 1948 entries
Finished phase 1 with 181 SingleSign rule and 0 generalized
[2026-05-23 18:58:59] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1033574600509143894.kers
Total runtime 5 ms.
[2026-05-23 18:58:59] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/182 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41631ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 41635ms
[2026-05-23 18:59:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:59:41] [INFO ] Invariant cache hit.
[2026-05-23 18:59:41] [INFO ] Implicit Places using invariants in 390 ms returned []
[2026-05-23 18:59:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2026-05-23 18:59:41] [INFO ] Invariant cache hit.
[2026-05-23 18:59:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 18:59:43] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1576 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43247 ms. Remains : 184/186 places, 2108/2108 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(p1)&&((!p2&&G(p3)) U p4)&&p0)))'
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p4) (NOT p1)), (OR (NOT p0) (NOT p4) (NOT p1)), true, (NOT p1), (NOT p3), (NOT p4)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-12 finished in 43524 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(p1)) U X(X(X((p2||F(!p3)))))))'
Support contains 11 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 24 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2026-05-23 18:59:43] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15666949384163062965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18251549221056543396.kers'
[2026-05-23 18:59:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15666949384163062965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18251549221056543396.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 369 rows 184 cols 1785 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-23 18:59:43] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18251549221056543396.kers
Total runtime 3 ms.
[2026-05-23 18:59:43] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41629ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 41634ms
[2026-05-23 19:00:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:00:25] [INFO ] Invariant cache hit.
[2026-05-23 19:00:25] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-23 19:00:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:00:25] [INFO ] Invariant cache hit.
[2026-05-23 19:00:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:00:26] [INFO ] Implicit Places using invariants and state equation in 1014 ms returned [168]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1315 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42993 ms. Remains : 184/186 places, 2107/2108 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(p1)) U X(X(X((F(!p2)||p3))))))'
Stuttering acceptance computed with spot in 620 ms :[(AND p2 (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND p2 (NOT p3)), (AND p2 (NOT p3)), p2, (AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 810 ms.
Product exploration explored 100000 steps with 25000 reset in 803 ms.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Detected a total of 167/184 stabilizing places and 323/2107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 8 factoid took 100 ms. Reduced automaton from 15 states, 22 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (56 resets) in 310 ms. (128 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (20 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2026-05-23 19:00:29] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11728783799996973158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5086497673524199635.kers'
[2026-05-23 19:00:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11728783799996973158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5086497673524199635.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 369 rows 183 cols 1624 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 19:00:29] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5086497673524199635.kers
Total runtime 2 ms.
[2026-05-23 19:00:29] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 253 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 704ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 252 ms.
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 128 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Running 2104 sub problems to find dead transitions.
[2026-05-23 19:00:30] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:00:30] [INFO ] Invariant cache hit.
[2026-05-23 19:00:30] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/553 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/184 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41592ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 41596ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41729 ms. Remains : 184/184 places, 2107/2107 transitions.
RANDOM walk for 40000 steps (56 resets) in 331 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (20 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (20 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 276285 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 276285 steps, saw 75969 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2026-05-23 19:01:14] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:14] [INFO ] Invariant cache hit.
[2026-05-23 19:01:14] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 267 ms.
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 128 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 184/184 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 121 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2026-05-23 19:01:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:16] [INFO ] Invariant cache hit.
[2026-05-23 19:01:16] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-23 19:01:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:16] [INFO ] Invariant cache hit.
[2026-05-23 19:01:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:01:17] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2026-05-23 19:01:17] [INFO ] Redundant transitions in 48 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1245 ms. Remains : 184/184 places, 2107/2107 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 184 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 182 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 182 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 181 transition count 366
Applied a total of 1744 rules in 14 ms. Remains 181 /184 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1254356512708546845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11900798152985381941.kers'
[2026-05-23 19:01:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1254356512708546845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11900798152985381941.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 366 rows 180 cols 1616 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-23 19:01:17] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11900798152985381941.kers
Total runtime 5 ms.
[2026-05-23 19:01:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 19:01:17] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 19:01:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 19:01:17] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 19:01:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 19:01:17] [INFO ] After 27ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 19:01:17] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 19:01:17] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 495 ms.
Knowledge based reduction with 8 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Knowledge-based reduction took 49325 ms.
Stuttering acceptance computed with spot in 227 ms :[(AND p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Support contains 8 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 14 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 19:01:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6299827631971535681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10644837209984883858.kers'
[2026-05-23 19:01:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6299827631971535681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10644837209984883858.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 369 rows 183 cols 1624 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 19:01:18] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10644837209984883858.kers
Total runtime 7 ms.
[2026-05-23 19:01:18] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-23 19:01:18] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:18] [INFO ] Invariant cache hit.
[2026-05-23 19:01:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:01:19] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 184/184 places, 2107/2107 transitions.
Computed a total of 167 stabilizing places and 323 stable transitions
Computed a total of 167 stabilizing places and 323 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (56 resets) in 325 ms. (122 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (20 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (20 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2026-05-23 19:01:19] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:19] [INFO ] Invariant cache hit.
[2026-05-23 19:01:19] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 250 ms.
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 142 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 184/184 places, 2107/2107 transitions.
RANDOM walk for 40000 steps (56 resets) in 363 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (20 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 275838 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 2
Probabilistic random walk after 275838 steps, saw 75858 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2026-05-23 19:01:23] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:23] [INFO ] Invariant cache hit.
[2026-05-23 19:01:23] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 174/182 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 369/551 variables, 182/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 22/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/553 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/553 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 211 constraints, problems are : Problem set: 0 solved, 2 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 184/184 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 732ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 123 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 184/184 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 121 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2026-05-23 19:01:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:25] [INFO ] Invariant cache hit.
[2026-05-23 19:01:25] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-23 19:01:25] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:25] [INFO ] Invariant cache hit.
[2026-05-23 19:01:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:01:26] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2026-05-23 19:01:26] [INFO ] Redundant transitions in 49 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1228 ms. Remains : 184/184 places, 2107/2107 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 184 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 182 transition count 367
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 1743 place count 182 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1744 place count 181 transition count 366
Applied a total of 1744 rules in 13 ms. Remains 181 /184 variables (removed 3) and now considering 366/2107 (removed 1741) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1761817901801522071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15007736575285029069.kers'
[2026-05-23 19:01:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1761817901801522071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15007736575285029069.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 366 rows 180 cols 1616 entries
Finished phase 1 with 176 SingleSign rule and 0 generalized
[2026-05-23 19:01:26] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15007736575285029069.kers
Total runtime 7 ms.
[2026-05-23 19:01:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 19:01:26] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-23 19:01:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 19:01:26] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-23 19:01:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 19:01:26] [INFO ] After 26ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-23 19:01:26] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-23 19:01:26] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 487 ms.
Knowledge based reduction with 1 factoid took 66 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Knowledge-based reduction took 7684 ms.
Stuttering acceptance computed with spot in 209 ms :[(AND p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 210 ms :[(AND p2 (NOT p3)), p2, (AND p2 (NOT p3)), (AND p2 (NOT p3)), (AND p2 (NOT p3))]
Product exploration explored 100000 steps with 25000 reset in 806 ms.
Product exploration explored 100000 steps with 25000 reset in 798 ms.
Spot run failed in 81 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/ltsmin5414240331549009759
[2026-05-23 19:01:29] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5414240331549009759
Running compilation step : cd /tmp/ltsmin5414240331549009759;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5414240331549009759;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5414240331549009759;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 2107/2107 transitions.
Applied a total of 0 rules in 11 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 19:01:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4552742182664529764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2455335050000425753.kers'
[2026-05-23 19:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4552742182664529764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2455335050000425753.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 369 rows 183 cols 1624 entries
Finished phase 1 with 179 SingleSign rule and 0 generalized
[2026-05-23 19:01:32] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2455335050000425753.kers
Total runtime 3 ms.
[2026-05-23 19:01:32] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-23 19:01:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:01:32] [INFO ] Invariant cache hit.
[2026-05-23 19:01:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:01:33] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1090 ms. Remains : 184/184 places, 2107/2107 transitions.
Built C files in :
/tmp/ltsmin16138222284983564460
[2026-05-23 19:01:33] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16138222284983564460
Running compilation step : cd /tmp/ltsmin16138222284983564460;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16138222284983564460;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16138222284983564460;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 19:01:36] [INFO ] Flatten gal took : 32 ms
[2026-05-23 19:01:36] [INFO ] Flatten gal took : 45 ms
[2026-05-23 19:01:36] [INFO ] Time to serialize gal into /tmp/LTL8184115538375580957.gal : 10 ms
[2026-05-23 19:01:36] [INFO ] Time to serialize properties into /tmp/LTL9179343050983609731.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8184115538375580957.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4542223746314912401.hoa' '-atoms' '/tmp/LTL9179343050983609731.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9179343050983609731.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4542223746314912401.hoa
Detected timeout of ITS tools.
[2026-05-23 19:01:51] [INFO ] Flatten gal took : 32 ms
[2026-05-23 19:01:51] [INFO ] Flatten gal took : 32 ms
[2026-05-23 19:01:51] [INFO ] Time to serialize gal into /tmp/LTL11023847963714112611.gal : 9 ms
[2026-05-23 19:01:51] [INFO ] Time to serialize properties into /tmp/LTL4746067952850789286.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11023847963714112611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4746067952850789286.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((F("((NB_ATTENTE_B_58>=1)&&(ROUTE_B>=1))"))&&(X("(((NB_ATTENTE_A_55>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))")))U...343
Formula 0 simplified : (G!"((NB_ATTENTE_B_58>=1)&&(ROUTE_B>=1))" | X!"(((NB_ATTENTE_A_55>=1)&&(ATTENTE_A>=1))&&((CAPACITE>=1)&&(CONTROLEUR_1>=1)))") R XXX(...324
Detected timeout of ITS tools.
[2026-05-23 19:02:06] [INFO ] Flatten gal took : 33 ms
[2026-05-23 19:02:06] [INFO ] Applying decomposition
[2026-05-23 19:02:06] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17978684047223380608.txt' '-o' '/tmp/graph17978684047223380608.bin' '-w' '/tmp/graph17978684047223380608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17978684047223380608.bin' '-l' '-1' '-v' '-w' '/tmp/graph17978684047223380608.weights' '-q' '0' '-e' '0.001'
[2026-05-23 19:02:06] [INFO ] Decomposing Gal with order
[2026-05-23 19:02:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 19:02:07] [INFO ] Removed a total of 4243 redundant transitions.
[2026-05-23 19:02:07] [INFO ] Flatten gal took : 387 ms
[2026-05-23 19:02:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 683 labels/synchronizations in 20 ms.
[2026-05-23 19:02:07] [INFO ] Time to serialize gal into /tmp/LTL14905065855481792966.gal : 3 ms
[2026-05-23 19:02:07] [INFO ] Time to serialize properties into /tmp/LTL1027447687912466412.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14905065855481792966.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1027447687912466412.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("((i1.u1.NB_ATTENTE_B_58>=1)&&(i1.u1.ROUTE_B>=1))"))&&(X("(((i0.u0.NB_ATTENTE_A_55>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE...427
Formula 0 simplified : (G!"((i1.u1.NB_ATTENTE_B_58>=1)&&(i1.u1.ROUTE_B>=1))" | X!"(((i0.u0.NB_ATTENTE_A_55>=1)&&(i0.u0.ATTENTE_A>=1))&&((i0.u2.CAPACITE>=1)...408
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-13 finished in 159032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 26 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2026-05-23 19:02:22] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18020590524284857739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5645814920586110323.kers'
[2026-05-23 19:02:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18020590524284857739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5645814920586110323.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 369 rows 184 cols 1785 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-23 19:02:22] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5645814920586110323.kers
Total runtime 3 ms.
[2026-05-23 19:02:22] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1923/181 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41689ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 41694ms
[2026-05-23 19:03:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:03:04] [INFO ] Invariant cache hit.
[2026-05-23 19:03:04] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-23 19:03:04] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:03:04] [INFO ] Invariant cache hit.
[2026-05-23 19:03:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:03:05] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1695 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 11 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43431 ms. Remains : 183/186 places, 2107/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-14 finished in 43595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0 U (p1||G(!p0))) U ((X(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p0)))'
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2107
Applied a total of 2 rules in 25 ms. Remains 185 /186 variables (removed 1) and now considering 2107/2108 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 19:03:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:03:06] [INFO ] Invariant cache hit.
[2026-05-23 19:03:06] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-23 19:03:06] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2026-05-23 19:03:06] [INFO ] Invariant cache hit.
[2026-05-23 19:03:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-23 19:03:08] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2125 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 183/186 places, 2107/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2165 ms. Remains : 183/186 places, 2107/2108 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0 U (p1||G(!p0))) U ((X(!p2)&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))||p0)))'
Stuttering acceptance computed with spot in 194 ms :[false, false, (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), true]
Running random walk in product with property : BridgeAndVehicles-PT-V80P20N10-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 787 ms.
Product exploration explored 100000 steps with 33333 reset in 776 ms.
Computed a total of 166 stabilizing places and 323 stable transitions
Computed a total of 166 stabilizing places and 323 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 20 ms. Proved property starting from automaton with 5 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 39 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V80P20N10-LTLFireability-15 finished in 4004 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))'
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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(p1)) U X(X(X((p2||F(!p3)))))))'
Spot run failed in 37 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 19:03:10] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5089812988694899522
[2026-05-23 19:03:10] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2026-05-23 19:03:10] [INFO ] Applying decomposition
[2026-05-23 19:03:10] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5089812988694899522
Running compilation step : cd /tmp/ltsmin5089812988694899522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-23 19:03:10] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6931286567917469459.txt' '-o' '/tmp/graph6931286567917469459.bin' '-w' '/tmp/graph6931286567917469459.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6931286567917469459.bin' '-l' '-1' '-v' '-w' '/tmp/graph6931286567917469459.weights' '-q' '0' '-e' '0.001'
[2026-05-23 19:03:10] [INFO ] Decomposing Gal with order
[2026-05-23 19:03:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 19:03:10] [INFO ] Removed a total of 4518 redundant transitions.
[2026-05-23 19:03:10] [INFO ] Flatten gal took : 369 ms
[2026-05-23 19:03:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 653 labels/synchronizations in 20 ms.
[2026-05-23 19:03:11] [INFO ] Time to serialize gal into /tmp/LTLFireability10250584347419424728.gal : 3 ms
[2026-05-23 19:03:11] [INFO ] Time to serialize properties into /tmp/LTLFireability5678084343168120560.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10250584347419424728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5678084343168120560.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 4 LTL properties
Checking formula 0 : !((F("(((((((((i2.u2.NB_ATTENTE_B_75<1)||(i2.u2.ROUTE_B<1))&&((i2.u3.NB_ATTENTE_B_56<1)||(i2.u2.ROUTE_B<1)))&&(((i2.u3.NB_ATTENTE_B_17...4067
Formula 0 simplified : G!"(((((((((i2.u2.NB_ATTENTE_B_75<1)||(i2.u2.ROUTE_B<1))&&((i2.u3.NB_ATTENTE_B_56<1)||(i2.u2.ROUTE_B<1)))&&(((i2.u3.NB_ATTENTE_B_17<...4063
Compilation finished in 5196 ms.
Running link step : cd /tmp/ltsmin5089812988694899522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>(((LTLAPp1==true)||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>(((LTLAPp1==true)||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>(([]((LTLAPp3==true))||[](<>((LTLAPp4==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>(([]((LTLAPp3==true))||[](<>((LTLAPp4==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5089812988694899522;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '((<>((LTLAPp5==true))&&X((LTLAPp6==true))) U X(X(X(((LTLAPp7==true)||<>(!(LTLAPp8==true)))))))' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA BridgeAndVehicles-PT-V80P20N10-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin5089812988694899522;'/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' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 19:29:46] [INFO ] Flatten gal took : 36 ms
[2026-05-23 19:29:46] [INFO ] Time to serialize gal into /tmp/LTLFireability8171959851637923526.gal : 11 ms
[2026-05-23 19:29:46] [INFO ] Time to serialize properties into /tmp/LTLFireability1277280947972704009.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8171959851637923526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1277280947972704009.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((F("(((((((((NB_ATTENTE_B_75<1)||(ROUTE_B<1))&&((NB_ATTENTE_B_56<1)||(ROUTE_B<1)))&&(((NB_ATTENTE_B_17<1)||(ROUTE_B<1))&&((NB_ATTENT...3095
Formula 0 simplified : G!"(((((((((NB_ATTENTE_B_75<1)||(ROUTE_B<1))&&((NB_ATTENTE_B_56<1)||(ROUTE_B<1)))&&(((NB_ATTENTE_B_17<1)||(ROUTE_B<1))&&((NB_ATTENTE...3091

BK_TIME_CONFINEMENT_REACHED

--------------------
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="BridgeAndVehicles-PT-V80P20N10"
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 BridgeAndVehicles-PT-V80P20N10, 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 r034-tall-177946841900276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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 ;