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-177946841800259.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-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841800259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.1M
-rw-r--r-- 1 mcc users 20K Mar 5 08:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 5 08:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 294K Mar 5 08:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Mar 5 08:35 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 5.3K Mar 15 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 62K Mar 15 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 178K Mar 15 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Mar 5 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Mar 5 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 652K Mar 5 08:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Mar 5 08:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Mar 15 07:35 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 2.0M 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-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779555692998

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 17:01:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 17:01:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 17:01:34] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2026-05-23 17:01:34] [INFO ] Transformed 138 places.
[2026-05-23 17:01:34] [INFO ] Transformed 2348 transitions.
[2026-05-23 17:01:34] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 56 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:01:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16996686105269098029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18149194472937791939.kers'
[2026-05-23 17:01:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16996686105269098029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18149194472937791939.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 138 cols 1450 entries
Finished phase 1 with 31 SingleSign rule and 100 generalized
[2026-05-23 17:01:34] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18149194472937791939.kers
Total runtime 2 ms.
[2026-05-23 17:01:34] [INFO ] State equation strengthened by 42 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20200 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42597ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 42643ms
[2026-05-23 17:02:17] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:02:17] [INFO ] Invariant cache hit.
[2026-05-23 17:02:17] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-23 17:02:17] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:02:17] [INFO ] Invariant cache hit.
[2026-05-23 17:02:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:02:18] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1199 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 43979 ms. Remains : 138/138 places, 2348/2348 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 29 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:02:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:02:18] [INFO ] Invariant cache hit.
[2026-05-23 17:02:19] [INFO ] Implicit Places using invariants in 324 ms returned []
[2026-05-23 17:02:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:02:19] [INFO ] Invariant cache hit.
[2026-05-23 17:02:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:02:19] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1203 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 19 out of 138 places after structural reductions.
[2026-05-23 17:02:20] [INFO ] Flatten gal took : 175 ms
[2026-05-23 17:02:20] [INFO ] Flatten gal took : 121 ms
[2026-05-23 17:02:20] [INFO ] Input system was already deterministic with 2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 3319 ms. (12 steps per ms) remains 9/37 properties
BEST_FIRST walk for 40003 steps (32 resets) in 263 ms. (151 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (44 resets) in 335 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 231 ms. (172 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 216 ms. (184 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 262 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40014 steps (32 resets) in 261 ms. (152 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 285 ms. (139 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 214 ms. (186 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (31 resets) in 248 ms. (160 steps per ms) remains 9/9 properties
[2026-05-23 17:02:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:02:22] [INFO ] Invariant cache hit.
[2026-05-23 17:02:22] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/33 variables, 3/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 3/36 variables, 1/5 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 290/326 variables, 36/41 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 42/83 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/83 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 102/428 variables, 102/185 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/187 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/187 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/187 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 187 constraints, problems are : Problem set: 7 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 192/405 variables, 106/118 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 2/120 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 42/162 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 2/164 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/164 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/407 variables, 1/165 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 2/167 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/407 variables, 0/167 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 21/428 variables, 21/188 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/428 variables, 1/189 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/428 variables, 0/189 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/428 variables, 0/189 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 189 constraints, problems are : Problem set: 7 solved, 2 unsolved in 1801 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2167ms problems are : Problem set: 7 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 493 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 320 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:02:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7295683477582497373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16765867686229161935.kers'
[2026-05-23 17:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7295683477582497373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16765867686229161935.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1448 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 17:02:25] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16765867686229161935.kers
Total runtime 15 ms.
[2026-05-23 17:02:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42039ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 42045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42372 ms. Remains : 136/138 places, 2348/2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 188 ms. (211 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 250795 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 2
Probabilistic random walk after 250795 steps, saw 67014 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :0
[2026-05-23 17:03:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:03:10] [INFO ] Invariant cache hit.
[2026-05-23 17:03:10] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 296/401 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/403 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/426 variables, 23/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 296/401 variables, 108/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 42/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/403 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 23/426 variables, 23/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/426 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1569 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1906ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 462 ms.
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 221 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 165 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2026-05-23 17:03:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:03:13] [INFO ] Invariant cache hit.
[2026-05-23 17:03:13] [INFO ] Implicit Places using invariants in 354 ms returned []
[2026-05-23 17:03:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:03:13] [INFO ] Invariant cache hit.
[2026-05-23 17:03:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:03:15] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1559 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 165 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1890 ms. Remains : 134/136 places, 2348/2348 transitions.
RANDOM walk for 40002 steps (92 resets) in 453 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40024 steps (32 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 264281 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 2
Probabilistic random walk after 264281 steps, saw 70771 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2026-05-23 17:03:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9251421126740816361.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7733463640387278394.kers'
[2026-05-23 17:03:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9251421126740816361.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7733463640387278394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 134 cols 1246 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-23 17:03:18] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7733463640387278394.kers
Total runtime 1 ms.
[2026-05-23 17:03:18] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/399 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/401 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 23/424 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 102/105 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 294/399 variables, 106/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 42/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/401 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 23/424 variables, 23/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/424 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 183 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2228ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 248 ms.
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 178 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 164 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2026-05-23 17:03:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:03:21] [INFO ] Invariant cache hit.
[2026-05-23 17:03:21] [INFO ] Implicit Places using invariants in 337 ms returned []
[2026-05-23 17:03:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:03:21] [INFO ] Invariant cache hit.
[2026-05-23 17:03:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:03:22] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2026-05-23 17:03:22] [INFO ] Redundant transitions in 116 ms returned []
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:03:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:03:22] [INFO ] Invariant cache hit.
[2026-05-23 17:03:22] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 7 constraints, problems are : Problem set: 10 solved, 2335 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 2335 unsolved
Problem TDEAD198 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2277 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 2245 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 100 solved, 2245 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2193/142 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61854ms problems are : Problem set: 100 solved, 2245 unsolved
Search for dead transitions found 100 dead transitions in 61860ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 2248/2348 transitions.
Applied a total of 0 rules in 154 ms. Remains 134 /134 variables (removed 0) and now considering 2248/2248 (removed 0) transitions.
[2026-05-23 17:04:24] [INFO ] Redundant transitions in 102 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63551 ms. Remains : 134/134 places, 2248/2348 transitions.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 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) U p1)||X(X(F(p2))))))'
Support contains 7 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 15 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:04:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12084578554868118787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2338880847219494652.kers'
[2026-05-23 17:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12084578554868118787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2338880847219494652.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 137 cols 1449 entries
Finished phase 1 with 81 SingleSign rule and 50 generalized
[2026-05-23 17:04:25] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2338880847219494652.kers
Total runtime 1 ms.
[2026-05-23 17:04:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41905ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 41911ms
[2026-05-23 17:05:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:05:07] [INFO ] Invariant cache hit.
[2026-05-23 17:05:07] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-23 17:05:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:05:07] [INFO ] Invariant cache hit.
[2026-05-23 17:05:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:05:08] [INFO ] Implicit Places using invariants and state equation in 1060 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1380 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43326 ms. Remains : 135/138 places, 2348/2348 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) U p1)||X(X(F(p2))))))'
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
Stuttering criterion allowed to conclude after 59938 steps with 1167 reset in 546 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 finished in 44329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 380 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
Running 2344 sub problems to find dead transitions.
[2026-05-23 17:05:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16281009734152085957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2029142129157747566.kers'
[2026-05-23 17:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16281009734152085957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2029142129157747566.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 134 cols 1345 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-23 17:05:09] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2029142129157747566.kers
Total runtime 1 ms.
[2026-05-23 17:05:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42370ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 42376ms
[2026-05-23 17:05:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:05:52] [INFO ] Invariant cache hit.
[2026-05-23 17:05:52] [INFO ] Implicit Places using invariants in 347 ms returned []
[2026-05-23 17:05:52] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:05:52] [INFO ] Invariant cache hit.
[2026-05-23 17:05:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:05:53] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1488 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 207 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44461 ms. Remains : 133/138 places, 2347/2348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01
Product exploration explored 100000 steps with 615 reset in 563 ms.
Product exploration explored 100000 steps with 611 reset in 549 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 7 factoid took 70 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (92 resets) in 393 ms. (101 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
[2026-05-23 17:05:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18228432832892913655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18240367831285424505.kers'
[2026-05-23 17:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18228432832892913655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18240367831285424505.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 132 cols 1143 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:05:55] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18240367831285424505.kers
Total runtime 2 ms.
[2026-05-23 17:05:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 155 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2026-05-23 17:05:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:05:57] [INFO ] Invariant cache hit.
[2026-05-23 17:05:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/422 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/133 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41919ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 41924ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42086 ms. Remains : 133/133 places, 2347/2347 transitions.
RANDOM walk for 40001 steps (92 resets) in 288 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40022 steps (32 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 299087 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 299087 steps, saw 79945 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-23 17:06:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:42] [INFO ] Invariant cache hit.
[2026-05-23 17:06:42] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 156 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 159 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2026-05-23 17:06:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:43] [INFO ] Invariant cache hit.
[2026-05-23 17:06:44] [INFO ] Implicit Places using invariants in 353 ms returned []
[2026-05-23 17:06:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:44] [INFO ] Invariant cache hit.
[2026-05-23 17:06:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:06:45] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1179 ms to find 0 implicit places.
[2026-05-23 17:06:45] [INFO ] Redundant transitions in 58 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1408 ms. Remains : 133/133 places, 2347/2347 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 22 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15145209984854128078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12594760054154830776.kers'
[2026-05-23 17:06:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15145209984854128078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12594760054154830776.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 285 rows 128 cols 1131 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-23 17:06:45] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12594760054154830776.kers
Total runtime 2 ms.
[2026-05-23 17:06:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:06:45] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 17:06:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-23 17:06:45] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-23 17:06:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 17:06:45] [INFO ] After 63ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 17:06:45] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 17:06:45] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 432 ms.
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2026-05-23 17:06:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1939153340127020474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2187101111592175314.kers'
[2026-05-23 17:06:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1939153340127020474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2187101111592175314.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 132 cols 1143 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:06:45] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2187101111592175314.kers
Total runtime 2 ms.
[2026-05-23 17:06:46] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-23 17:06:46] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-23 17:06:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:06:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2026-05-23 17:06:47] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-23 17:06:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:06:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 1029 ms returned sat
[2026-05-23 17:06:48] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 92 ms.
[2026-05-23 17:06:48] [INFO ] Added : 20 causal constraints over 5 iterations in 318 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 53480 ms.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 198 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:06:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:48] [INFO ] Invariant cache hit.
[2026-05-23 17:06:49] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-23 17:06:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:49] [INFO ] Invariant cache hit.
[2026-05-23 17:06:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:06:50] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2026-05-23 17:06:50] [INFO ] Redundant transitions in 57 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1780 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 7 factoid took 45 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40001 steps (92 resets) in 373 ms. (106 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (32 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
[2026-05-23 17:06:50] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:50] [INFO ] Invariant cache hit.
[2026-05-23 17:06:50] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 180 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 133/133 places, 2347/2347 transitions.
RANDOM walk for 40000 steps (92 resets) in 322 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 301239 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 301239 steps, saw 80471 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2026-05-23 17:06:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:55] [INFO ] Invariant cache hit.
[2026-05-23 17:06:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/399 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 23/422 variables, 23/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 101/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 294/397 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/399 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/422 variables, 23/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 133/133 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 172 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 155 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2026-05-23 17:06:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:57] [INFO ] Invariant cache hit.
[2026-05-23 17:06:57] [INFO ] Implicit Places using invariants in 326 ms returned []
[2026-05-23 17:06:57] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:06:57] [INFO ] Invariant cache hit.
[2026-05-23 17:06:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:06:58] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2026-05-23 17:06:58] [INFO ] Redundant transitions in 53 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1330 ms. Remains : 133/133 places, 2347/2347 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 12 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7123475259863705859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-693387392989753201.kers'
[2026-05-23 17:06:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7123475259863705859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-693387392989753201.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 285 rows 128 cols 1131 entries
Finished phase 1 with 124 SingleSign rule and 0 generalized
[2026-05-23 17:06:58] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-693387392989753201.kers
Total runtime 2 ms.
[2026-05-23 17:06:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-23 17:06:58] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-23 17:06:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2026-05-23 17:06:58] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-23 17:06:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 17:06:58] [INFO ] After 65ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-23 17:06:58] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-23 17:06:58] [INFO ] After 350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 419 ms.
Knowledge based reduction with 7 factoid took 65 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2026-05-23 17:06:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10419303438078542062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15326177246330869799.kers'
[2026-05-23 17:06:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10419303438078542062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15326177246330869799.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 132 cols 1143 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 17:06:58] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15326177246330869799.kers
Total runtime 3 ms.
[2026-05-23 17:06:59] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2026-05-23 17:06:59] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-23 17:06:59] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:07:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2026-05-23 17:07:00] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-23 17:07:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:07:01] [INFO ] [Nat]Added 42 Read/Feed constraints in 659 ms returned sat
[2026-05-23 17:07:01] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 166 transitions) in 40 ms.
[2026-05-23 17:07:01] [INFO ] Added : 20 causal constraints over 5 iterations in 241 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 10787 ms.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 617 reset in 528 ms.
Product exploration explored 100000 steps with 615 reset in 519 ms.
Built C files in :
/tmp/ltsmin13977613957044406588
[2026-05-23 17:07:02] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:07:02] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13977613957044406588
Running compilation step : cd /tmp/ltsmin13977613957044406588;'/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/ltsmin13977613957044406588;'/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/ltsmin13977613957044406588;'/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 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 164 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:07:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:07:05] [INFO ] Invariant cache hit.
[2026-05-23 17:07:06] [INFO ] Implicit Places using invariants in 346 ms returned []
[2026-05-23 17:07:06] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:07:06] [INFO ] Invariant cache hit.
[2026-05-23 17:07:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:07:07] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2026-05-23 17:07:07] [INFO ] Redundant transitions in 55 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1779 ms. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin2510052553473424465
[2026-05-23 17:07:07] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:07:07] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2510052553473424465
Running compilation step : cd /tmp/ltsmin2510052553473424465;'/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/ltsmin2510052553473424465;'/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/ltsmin2510052553473424465;'/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 17:07:10] [INFO ] Flatten gal took : 77 ms
[2026-05-23 17:07:10] [INFO ] Flatten gal took : 67 ms
[2026-05-23 17:07:10] [INFO ] Time to serialize gal into /tmp/LTL14922565720614624977.gal : 27 ms
[2026-05-23 17:07:11] [INFO ] Time to serialize properties into /tmp/LTL18305194442877206852.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/LTL14922565720614624977.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15122700553154131885.hoa' '-atoms' '/tmp/LTL18305194442877206852.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...320
Loading property file /tmp/LTL18305194442877206852.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15122700553154131885.hoa
Detected timeout of ITS tools.
[2026-05-23 17:07:27] [INFO ] Flatten gal took : 59 ms
[2026-05-23 17:07:27] [INFO ] Flatten gal took : 67 ms
[2026-05-23 17:07:27] [INFO ] Time to serialize gal into /tmp/LTL11670729904059663218.gal : 22 ms
[2026-05-23 17:07:27] [INFO ] Time to serialize properties into /tmp/LTL9208094213836450081.ltl : 3 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/LTL11670729904059663218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9208094213836450081.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 : !((G((F("(ROUTE_A<3)"))&&(F(G("(CAPACITE>=2)"))))))
Formula 0 simplified : F(G!"(ROUTE_A<3)" | GF!"(CAPACITE>=2)")
Detected timeout of ITS tools.
[2026-05-23 17:07:42] [INFO ] Flatten gal took : 42 ms
[2026-05-23 17:07:42] [INFO ] Applying decomposition
[2026-05-23 17:07:42] [INFO ] Flatten gal took : 45 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/graph111088828051598951.txt' '-o' '/tmp/graph111088828051598951.bin' '-w' '/tmp/graph111088828051598951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph111088828051598951.bin' '-l' '-1' '-v' '-w' '/tmp/graph111088828051598951.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:07:42] [INFO ] Decomposing Gal with order
[2026-05-23 17:07:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:07:43] [INFO ] Removed a total of 4373 redundant transitions.
[2026-05-23 17:07:43] [INFO ] Flatten gal took : 931 ms
[2026-05-23 17:07:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 32 ms.
[2026-05-23 17:07:43] [INFO ] Time to serialize gal into /tmp/LTL5006499271844242256.gal : 2 ms
[2026-05-23 17:07:43] [INFO ] Time to serialize properties into /tmp/LTL10745505047157066006.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/LTL5006499271844242256.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10745505047157066006.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 : !((G((F("(i2.u2.ROUTE_A<3)"))&&(F(G("(u1.CAPACITE>=2)"))))))
Formula 0 simplified : F(G!"(i2.u2.ROUTE_A<3)" | GF!"(u1.CAPACITE>=2)")
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 finished in 169243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2346
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 10 place count 131 transition count 2344
Applied a total of 10 rules in 303 ms. Remains 131 /138 variables (removed 7) and now considering 2344/2348 (removed 4) transitions.
[2026-05-23 17:07:59] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16890801747177031394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15866059696405546629.kers'
[2026-05-23 17:07:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16890801747177031394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15866059696405546629.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 131 cols 1240 entries
Finished phase 1 with 127 SingleSign rule and 0 generalized
[2026-05-23 17:07:59] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15866059696405546629.kers
Total runtime 3 ms.
[2026-05-23 17:07:59] [INFO ] Implicit Places using invariants in 352 ms returned []
[2026-05-23 17:07:59] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2026-05-23 17:07:59] [INFO ] Invariant cache hit.
[2026-05-23 17:07:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:08:00] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1431 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/138 places, 2344/2348 transitions.
Applied a total of 0 rules in 182 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1917 ms. Remains : 129/138 places, 2344/2348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02
Product exploration explored 100000 steps with 324 reset in 804 ms.
Product exploration explored 100000 steps with 323 reset in 794 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/129 stabilizing places and 202/2344 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 575 steps (0 resets) in 11 ms. (47 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2026-05-23 17:08:02] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8918185632297537939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-729174266999255013.kers'
[2026-05-23 17:08:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8918185632297537939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-729174266999255013.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 286 rows 129 cols 1038 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-23 17:08:02] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-729174266999255013.kers
Total runtime 1 ms.
[2026-05-23 17:08:03] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2026-05-23 17:08:03] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2026-05-23 17:08:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:08:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 17:08:04] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2026-05-23 17:08:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:08:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 1067 ms returned sat
[2026-05-23 17:08:05] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 163 transitions) in 40 ms.
[2026-05-23 17:08:05] [INFO ] Added : 19 causal constraints over 5 iterations in 696 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3535 ms.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 169 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2026-05-23 17:08:06] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2026-05-23 17:08:06] [INFO ] Invariant cache hit.
[2026-05-23 17:08:06] [INFO ] Implicit Places using invariants in 346 ms returned []
[2026-05-23 17:08:06] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2026-05-23 17:08:06] [INFO ] Invariant cache hit.
[2026-05-23 17:08:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:08:07] [INFO ] Implicit Places using invariants and state equation in 886 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2026-05-23 17:08:07] [INFO ] Redundant transitions in 55 ms returned []
Running 2341 sub problems to find dead transitions.
[2026-05-23 17:08:07] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2026-05-23 17:08:07] [INFO ] Invariant cache hit.
[2026-05-23 17:08:07] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2341 unsolved
Problem TDEAD243 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1504 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 129/415 variables, and 5 constraints, problems are : Problem set: 61 solved, 2280 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2341/100 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 2280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 61 solved, 2280 unsolved
Problem TDEAD1525 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2092 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2218 is UNSAT
Problem TDEAD2239 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2323 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 100 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/415 variables, and 5 constraints, problems are : Problem set: 100 solved, 2241 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2180/100 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62100ms problems are : Problem set: 100 solved, 2241 unsolved
Search for dead transitions found 100 dead transitions in 62109ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 129/129 places, 2244/2344 transitions.
Applied a total of 0 rules in 147 ms. Remains 129 /129 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
[2026-05-23 17:09:09] [INFO ] Redundant transitions in 53 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 63793 ms. Remains : 129/129 places, 2244/2344 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/129 stabilizing places and 202/2244 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 45 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 592 steps (0 resets) in 9 ms. (59 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2026-05-23 17:09:09] [INFO ] Flow matrix only has 284 transitions (discarded 1960 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11304391198998436728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9564630125039128330.kers'
[2026-05-23 17:09:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11304391198998436728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9564630125039128330.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 129 cols 1034 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-23 17:09:09] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9564630125039128330.kers
Total runtime 5 ms.
[2026-05-23 17:09:10] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 17:09:10] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-23 17:09:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:09:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2026-05-23 17:09:11] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2026-05-23 17:09:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:09:11] [INFO ] [Nat]Added 40 Read/Feed constraints in 384 ms returned sat
[2026-05-23 17:09:11] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 161 transitions) in 33 ms.
[2026-05-23 17:09:12] [INFO ] Added : 22 causal constraints over 7 iterations in 422 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2499 ms.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 324 reset in 754 ms.
Product exploration explored 100000 steps with 324 reset in 745 ms.
Built C files in :
/tmp/ltsmin15137461463448302310
[2026-05-23 17:09:13] [INFO ] Too many transitions (2244) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:09:13] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15137461463448302310
Running compilation step : cd /tmp/ltsmin15137461463448302310;'/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/ltsmin15137461463448302310;'/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/ltsmin15137461463448302310;'/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 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 2244/2244 transitions.
Applied a total of 0 rules in 140 ms. Remains 129 /129 variables (removed 0) and now considering 2244/2244 (removed 0) transitions.
[2026-05-23 17:09:16] [INFO ] Flow matrix only has 284 transitions (discarded 1960 similar events)
[2026-05-23 17:09:16] [INFO ] Invariant cache hit.
[2026-05-23 17:09:17] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-23 17:09:17] [INFO ] Flow matrix only has 284 transitions (discarded 1960 similar events)
[2026-05-23 17:09:17] [INFO ] Invariant cache hit.
[2026-05-23 17:09:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-23 17:09:18] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1180 ms to find 0 implicit places.
[2026-05-23 17:09:18] [INFO ] Redundant transitions in 52 ms returned []
Running 2241 sub problems to find dead transitions.
[2026-05-23 17:09:18] [INFO ] Flow matrix only has 284 transitions (discarded 1960 similar events)
[2026-05-23 17:09:18] [INFO ] Invariant cache hit.
[2026-05-23 17:09:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 129/413 variables, and 4 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2241/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/413 variables, and 4 constraints, problems are : Problem set: 0 solved, 2241 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 2141/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61863ms problems are : Problem set: 0 solved, 2241 unsolved
Search for dead transitions found 0 dead transitions in 61868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63254 ms. Remains : 129/129 places, 2244/2244 transitions.
Built C files in :
/tmp/ltsmin5990952810344208008
[2026-05-23 17:10:20] [INFO ] Too many transitions (2244) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:10:20] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5990952810344208008
Running compilation step : cd /tmp/ltsmin5990952810344208008;'/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/ltsmin5990952810344208008;'/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/ltsmin5990952810344208008;'/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 17:10:23] [INFO ] Flatten gal took : 34 ms
[2026-05-23 17:10:23] [INFO ] Flatten gal took : 35 ms
[2026-05-23 17:10:23] [INFO ] Time to serialize gal into /tmp/LTL16764020641304867887.gal : 12 ms
[2026-05-23 17:10:23] [INFO ] Time to serialize properties into /tmp/LTL14874034179910545785.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/LTL16764020641304867887.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7244349242501177220.hoa' '-atoms' '/tmp/LTL14874034179910545785.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/LTL14874034179910545785.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7244349242501177220.hoa
Detected timeout of ITS tools.
[2026-05-23 17:10:38] [INFO ] Flatten gal took : 34 ms
[2026-05-23 17:10:38] [INFO ] Flatten gal took : 35 ms
[2026-05-23 17:10:38] [INFO ] Time to serialize gal into /tmp/LTL11012637782740949637.gal : 12 ms
[2026-05-23 17:10:38] [INFO ] Time to serialize properties into /tmp/LTL6403370710642155238.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/LTL11012637782740949637.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6403370710642155238.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("(ROUTE_B<3)"))))
Formula 0 simplified : GF!"(ROUTE_B<3)"
Detected timeout of ITS tools.
[2026-05-23 17:10:53] [INFO ] Flatten gal took : 32 ms
[2026-05-23 17:10:53] [INFO ] Applying decomposition
[2026-05-23 17:10:53] [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/graph10485876160837261132.txt' '-o' '/tmp/graph10485876160837261132.bin' '-w' '/tmp/graph10485876160837261132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10485876160837261132.bin' '-l' '-1' '-v' '-w' '/tmp/graph10485876160837261132.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:10:53] [INFO ] Decomposing Gal with order
[2026-05-23 17:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:10:54] [INFO ] Removed a total of 4463 redundant transitions.
[2026-05-23 17:10:54] [INFO ] Flatten gal took : 342 ms
[2026-05-23 17:10:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 451 labels/synchronizations in 22 ms.
[2026-05-23 17:10:54] [INFO ] Time to serialize gal into /tmp/LTL6211024573490391131.gal : 1 ms
[2026-05-23 17:10:54] [INFO ] Time to serialize properties into /tmp/LTL7397099501825661326.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/LTL6211024573490391131.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7397099501825661326.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.u3.ROUTE_B<3)"))))
Formula 0 simplified : GF!"(i1.u3.ROUTE_B<3)"
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 finished in 190523 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))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 16 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:11:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-922444877628890484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9012202574051702428.kers'
[2026-05-23 17:11:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-922444877628890484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9012202574051702428.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 137 cols 1449 entries
Finished phase 1 with 81 SingleSign rule and 50 generalized
[2026-05-23 17:11:09] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9012202574051702428.kers
Total runtime 5 ms.
[2026-05-23 17:11:09] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41926ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 41930ms
[2026-05-23 17:11:51] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:11:51] [INFO ] Invariant cache hit.
[2026-05-23 17:11:51] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-23 17:11:51] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:11:51] [INFO ] Invariant cache hit.
[2026-05-23 17:11:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:11:52] [INFO ] Implicit Places using invariants and state equation in 959 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1310 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43273 ms. Remains : 135/138 places, 2348/2348 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))'
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 795 ms.
Product exploration explored 100000 steps with 50000 reset in 819 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 17 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 finished in 45041 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)&&X(G((X(X(p2))||G(p3)))))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 14 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:11:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11159521580570255939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17471860651492950948.kers'
[2026-05-23 17:11:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11159521580570255939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17471860651492950948.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 137 cols 1449 entries
Finished phase 1 with 81 SingleSign rule and 50 generalized
[2026-05-23 17:11:54] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17471860651492950948.kers
Total runtime 2 ms.
[2026-05-23 17:11:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2026-05-23 17:11:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:11:54] [INFO ] Invariant cache hit.
[2026-05-23 17:11:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:11:55] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 137/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1364 ms. Remains : 137/138 places, 2348/2348 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)&&X(G((X(X(p2))||G(p3)))))))'
Stuttering acceptance computed with spot in 432 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p3) p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 45 steps with 7 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 finished in 1850 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))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 15 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:11:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11337459924876084229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2064535300578103050.kers'
[2026-05-23 17:11:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11337459924876084229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2064535300578103050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 137 cols 1449 entries
Finished phase 1 with 81 SingleSign rule and 50 generalized
[2026-05-23 17:11:56] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2064535300578103050.kers
Total runtime 4 ms.
[2026-05-23 17:11:56] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-23 17:11:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:11:56] [INFO ] Invariant cache hit.
[2026-05-23 17:11:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:11:58] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1932 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1960 ms. Remains : 136/138 places, 2348/2348 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))))'
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 827 ms.
Product exploration explored 100000 steps with 50000 reset in 885 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 13 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 finished in 3807 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)&&((p0 U (p1&&G(p2)))||(F(p3)&&X(p1)))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 17 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:11:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13512952252834434244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7451893123941420396.kers'
[2026-05-23 17:11:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13512952252834434244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7451893123941420396.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 137 cols 1449 entries
Finished phase 1 with 81 SingleSign rule and 50 generalized
[2026-05-23 17:11:59] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7451893123941420396.kers
Total runtime 2 ms.
[2026-05-23 17:12:00] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-23 17:12:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:12:00] [INFO ] Invariant cache hit.
[2026-05-23 17:12:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:12:01] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 137/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1557 ms. Remains : 137/138 places, 2348/2348 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)&&((p0 U (p1&&G(p2)))||(F(p3)&&X(p1)))))'
Stuttering acceptance computed with spot in 514 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 4612 steps with 23 reset in 38 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 finished in 2158 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(p1))||p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 23 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
Running 2344 sub problems to find dead transitions.
[2026-05-23 17:12:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16879239081076293061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12209543863736992593.kers'
[2026-05-23 17:12:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16879239081076293061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12209543863736992593.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 134 cols 1345 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-23 17:12:02] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12209543863736992593.kers
Total runtime 5 ms.
[2026-05-23 17:12:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41908ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 41914ms
[2026-05-23 17:12:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:12:44] [INFO ] Invariant cache hit.
[2026-05-23 17:12:44] [INFO ] Implicit Places using invariants in 342 ms returned []
[2026-05-23 17:12:44] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:12:44] [INFO ] Invariant cache hit.
[2026-05-23 17:12:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:12:45] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 16 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43363 ms. Remains : 134/138 places, 2347/2348 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(p1))||p0)))'
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 875 ms.
Product exploration explored 100000 steps with 50000 reset in 886 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Detected a total of 107/134 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 18 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 finished in 45308 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((X(p0)&&F(!p1))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 27 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 17:12:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:12:47] [INFO ] Invariant cache hit.
[2026-05-23 17:12:47] [INFO ] Implicit Places using invariants in 385 ms returned []
[2026-05-23 17:12:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:12:47] [INFO ] Invariant cache hit.
[2026-05-23 17:12:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:12:48] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1471 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1511 ms. Remains : 133/138 places, 2347/2348 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((X(p0)&&F(p1))))))'
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
Stuttering criterion allowed to conclude after 646 steps with 19 reset in 11 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 finished in 1800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G((p0 U p1)) U G(p2))||!(false U p0)))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 183 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:12:49] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-328219814468635436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4617052159338946167.kers'
[2026-05-23 17:12:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-328219814468635436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4617052159338946167.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 137 cols 1449 entries
Finished phase 1 with 81 SingleSign rule and 50 generalized
[2026-05-23 17:12:49] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4617052159338946167.kers
Total runtime 5 ms.
[2026-05-23 17:12:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/427 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/137 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41935ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 41939ms
[2026-05-23 17:13:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:13:31] [INFO ] Invariant cache hit.
[2026-05-23 17:13:31] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-23 17:13:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:13:31] [INFO ] Invariant cache hit.
[2026-05-23 17:13:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:13:32] [INFO ] Implicit Places using invariants and state equation in 855 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 179 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43476 ms. Remains : 136/138 places, 2348/2348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G((p0 U p1)) U G(p2))||!(false U p0)))'
Stuttering acceptance computed with spot in 175 ms :[(AND p0 p2), p2, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
Product exploration explored 100000 steps with 3128 reset in 600 ms.
Product exploration explored 100000 steps with 3151 reset in 615 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 14 factoid took 82 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (92 resets) in 421 ms. (94 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 245 ms. (162 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 159 ms. (250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 181 ms. (219 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (28 resets) in 170 ms. (233 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40015 steps (32 resets) in 174 ms. (228 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40007 steps (32 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
[2026-05-23 17:13:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9614661442291637238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12225979980060314153.kers'
[2026-05-23 17:13:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9614661442291637238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12225979980060314153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1348 entries
Finished phase 1 with 80 SingleSign rule and 50 generalized
[2026-05-23 17:13:34] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12225979980060314153.kers
Total runtime 1 ms.
[2026-05-23 17:13:34] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 184 constraints, problems are : Problem set: 0 solved, 6 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5401ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 155 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2026-05-23 17:13:40] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:13:40] [INFO ] Invariant cache hit.
[2026-05-23 17:13:40] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/142 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41867ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 41873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42032 ms. Remains : 136/136 places, 2348/2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 422 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (24 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (28 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40020 steps (32 resets) in 196 ms. (203 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 232683 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 6
Probabilistic random walk after 232683 steps, saw 62160 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2026-05-23 17:14:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:14:25] [INFO ] Invariant cache hit.
[2026-05-23 17:14:25] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 184 constraints, problems are : Problem set: 0 solved, 6 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/426 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12753 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13154ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2398 ms.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 158 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 152 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2026-05-23 17:14:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:14:41] [INFO ] Invariant cache hit.
[2026-05-23 17:14:41] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-23 17:14:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:14:41] [INFO ] Invariant cache hit.
[2026-05-23 17:14:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:14:42] [INFO ] Implicit Places using invariants and state equation in 692 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2026-05-23 17:14:42] [INFO ] Redundant transitions in 56 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 136/136 places, 2348/2348 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 136 transition count 290
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 2062 place count 134 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2063 place count 134 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2064 place count 133 transition count 287
Applied a total of 2064 rules in 12 ms. Remains 133 /136 variables (removed 3) and now considering 287/2348 (removed 2061) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8091746234384685715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2231382754310816260.kers'
[2026-05-23 17:14:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8091746234384685715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2231382754310816260.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 133 cols 1340 entries
Finished phase 1 with 77 SingleSign rule and 50 generalized
[2026-05-23 17:14:42] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2231382754310816260.kers
Total runtime 5 ms.
[2026-05-23 17:14:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-23 17:14:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-23 17:14:44] [INFO ] After 1479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2026-05-23 17:14:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 17:14:44] [INFO ] After 726ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-23 17:14:45] [INFO ] After 1581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-23 17:14:46] [INFO ] After 3644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 3722 ms.
Knowledge based reduction with 14 factoid took 158 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 302 ms :[p2, p2, (AND p1 p2), (AND p1 p2), false, false, false, false, false]
[2026-05-23 17:14:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18044265325637679501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-996222146992686292.kers'
[2026-05-23 17:14:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18044265325637679501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-996222146992686292.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1348 entries
Finished phase 1 with 80 SingleSign rule and 50 generalized
[2026-05-23 17:14:46] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-996222146992686292.kers
Total runtime 2 ms.
[2026-05-23 17:14:47] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2026-05-23 17:14:49] [INFO ] [Real]Absence check using state equation in 2339 ms returned sat
[2026-05-23 17:14:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:14:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-23 17:14:50] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2026-05-23 17:14:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:14:50] [INFO ] [Nat]Added 42 Read/Feed constraints in 160 ms returned sat
[2026-05-23 17:14:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2026-05-23 17:14:50] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 36 ms.
[2026-05-23 17:14:51] [INFO ] Added : 41 causal constraints over 9 iterations in 325 ms. Result :sat
Could not prove EG p2
Knowledge-based reduction took 77088 ms.
Stuttering acceptance computed with spot in 335 ms :[p2, p2, (AND p1 p2), (AND p1 p2), false, false, false, false, false]
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 179 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:14:51] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:14:51] [INFO ] Invariant cache hit.
[2026-05-23 17:14:52] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-23 17:14:52] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:14:52] [INFO ] Invariant cache hit.
[2026-05-23 17:14:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:14:52] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1012 ms to find 0 implicit places.
[2026-05-23 17:14:52] [INFO ] Redundant transitions in 55 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1255 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 24 factoid took 80 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (92 resets) in 353 ms. (112 steps per ms) remains 6/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 119 ms. (333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 124 ms. (320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (28 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (32 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (32 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
[2026-05-23 17:14:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:14:53] [INFO ] Invariant cache hit.
[2026-05-23 17:14:53] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 184 constraints, problems are : Problem set: 0 solved, 6 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5383ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 191 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 136/136 places, 2348/2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 341 ms. (116 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (24 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (28 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40013 steps (32 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (32 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 209011 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 6
Probabilistic random walk after 209011 steps, saw 55887 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2026-05-23 17:15:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:15:02] [INFO ] Invariant cache hit.
[2026-05-23 17:15:02] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/426 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 184 constraints, problems are : Problem set: 0 solved, 6 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 6/12 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 239/251 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 174/425 variables, 123/159 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 1/426 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/426 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 187 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12696 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 6/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13078ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2731 ms.
Support contains 6 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 155 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 154 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2026-05-23 17:15:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:15:18] [INFO ] Invariant cache hit.
[2026-05-23 17:15:18] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-23 17:15:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:15:18] [INFO ] Invariant cache hit.
[2026-05-23 17:15:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:15:19] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2026-05-23 17:15:19] [INFO ] Redundant transitions in 56 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1233 ms. Remains : 136/136 places, 2348/2348 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 136 transition count 290
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 2062 place count 134 transition count 288
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2063 place count 134 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2064 place count 133 transition count 287
Applied a total of 2064 rules in 10 ms. Remains 133 /136 variables (removed 3) and now considering 287/2348 (removed 2061) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4908640065034847088.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6167523008230945131.kers'
[2026-05-23 17:15:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4908640065034847088.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6167523008230945131.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 287 rows 133 cols 1340 entries
Finished phase 1 with 77 SingleSign rule and 50 generalized
[2026-05-23 17:15:19] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6167523008230945131.kers
Total runtime 3 ms.
[2026-05-23 17:15:19] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-23 17:15:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-23 17:15:20] [INFO ] After 1498ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2026-05-23 17:15:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 17:15:21] [INFO ] After 722ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-23 17:15:22] [INFO ] After 1577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-23 17:15:22] [INFO ] After 3659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 3729 ms.
Knowledge based reduction with 24 factoid took 196 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 389 ms :[p2, p2, (AND p1 p2), (AND p1 p2), false, false, false, false, false]
[2026-05-23 17:15:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-847394522275892988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2707556129916997983.kers'
[2026-05-23 17:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-847394522275892988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2707556129916997983.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 136 cols 1348 entries
Finished phase 1 with 80 SingleSign rule and 50 generalized
[2026-05-23 17:15:23] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2707556129916997983.kers
Total runtime 2 ms.
[2026-05-23 17:15:23] [INFO ] [Real]Absence check using 6 positive place invariants in 15 ms returned sat
[2026-05-23 17:15:26] [INFO ] [Real]Absence check using state equation in 2422 ms returned sat
[2026-05-23 17:15:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 17:15:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2026-05-23 17:15:27] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2026-05-23 17:15:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:15:27] [INFO ] [Nat]Added 42 Read/Feed constraints in 162 ms returned sat
[2026-05-23 17:15:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2026-05-23 17:15:27] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 39 ms.
[2026-05-23 17:15:28] [INFO ] Added : 41 causal constraints over 9 iterations in 328 ms. Result :sat
Could not prove EG p2
Knowledge-based reduction took 35276 ms.
Stuttering acceptance computed with spot in 413 ms :[p2, p2, (AND p1 p2), (AND p1 p2), false, false, false, false, false]
Stuttering acceptance computed with spot in 418 ms :[p2, p2, (AND p1 p2), (AND p1 p2), false, false, false, false, false]
Product exploration explored 100000 steps with 3052 reset in 606 ms.
Product exploration explored 100000 steps with 3174 reset in 620 ms.
Built C files in :
/tmp/ltsmin13727260057388843956
[2026-05-23 17:15:30] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:15:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13727260057388843956
Running compilation step : cd /tmp/ltsmin13727260057388843956;'/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/ltsmin13727260057388843956;'/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/ltsmin13727260057388843956;'/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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 176 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 17:15:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:15:33] [INFO ] Invariant cache hit.
[2026-05-23 17:15:33] [INFO ] Implicit Places using invariants in 307 ms returned []
[2026-05-23 17:15:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2026-05-23 17:15:33] [INFO ] Invariant cache hit.
[2026-05-23 17:15:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:15:34] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1015 ms to find 0 implicit places.
[2026-05-23 17:15:34] [INFO ] Redundant transitions in 55 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1252 ms. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin16423751154969053579
[2026-05-23 17:15:34] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:15:34] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16423751154969053579
Running compilation step : cd /tmp/ltsmin16423751154969053579;'/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/ltsmin16423751154969053579;'/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/ltsmin16423751154969053579;'/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 17:15:37] [INFO ] Flatten gal took : 34 ms
[2026-05-23 17:15:37] [INFO ] Flatten gal took : 36 ms
[2026-05-23 17:15:37] [INFO ] Time to serialize gal into /tmp/LTL10223774988682850078.gal : 11 ms
[2026-05-23 17:15:37] [INFO ] Time to serialize properties into /tmp/LTL892383737865201852.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/LTL10223774988682850078.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11055481786016126743.hoa' '-atoms' '/tmp/LTL892383737865201852.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/LTL892383737865201852.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11055481786016126743.hoa
Detected timeout of ITS tools.
[2026-05-23 17:15:52] [INFO ] Flatten gal took : 34 ms
[2026-05-23 17:15:52] [INFO ] Flatten gal took : 49 ms
[2026-05-23 17:15:52] [INFO ] Time to serialize gal into /tmp/LTL1428721722623850388.gal : 11 ms
[2026-05-23 17:15:52] [INFO ] Time to serialize properties into /tmp/LTL1238329859253167725.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/LTL1428721722623850388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1238329859253167725.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((!((G(("(SORTI_B<=ATTENTE_B)")U("(SUR_PONT_B<=CAPACITE)")))U(G("(SUR_PONT_A<=CONTROLEUR_2)")))))
Formula 0 simplified : G("(SORTI_B<=ATTENTE_B)" U "(SUR_PONT_B<=CAPACITE)") U G"(SUR_PONT_A<=CONTROLEUR_2)"
Detected timeout of ITS tools.
[2026-05-23 17:16:07] [INFO ] Flatten gal took : 36 ms
[2026-05-23 17:16:07] [INFO ] Applying decomposition
[2026-05-23 17:16:07] [INFO ] Flatten gal took : 35 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/graph16165744785613530985.txt' '-o' '/tmp/graph16165744785613530985.bin' '-w' '/tmp/graph16165744785613530985.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16165744785613530985.bin' '-l' '-1' '-v' '-w' '/tmp/graph16165744785613530985.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:16:08] [INFO ] Decomposing Gal with order
[2026-05-23 17:16:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:16:08] [INFO ] Removed a total of 3443 redundant transitions.
[2026-05-23 17:16:08] [INFO ] Flatten gal took : 271 ms
[2026-05-23 17:16:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 476 labels/synchronizations in 24 ms.
[2026-05-23 17:16:08] [INFO ] Time to serialize gal into /tmp/LTL10580836678176607268.gal : 7 ms
[2026-05-23 17:16:08] [INFO ] Time to serialize properties into /tmp/LTL8605369364741494424.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/LTL10580836678176607268.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8605369364741494424.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 : !((!((G(("(gu4.SORTI_B<=gu4.ATTENTE_B)")U("(gu1.SUR_PONT_B<=gu1.CAPACITE)")))U(G("(gu0.SUR_PONT_A<=gu0.CONTROLEUR_2)")))))
Formula 0 simplified : G("(gu4.SORTI_B<=gu4.ATTENTE_B)" U "(gu1.SUR_PONT_B<=gu1.CAPACITE)") U G"(gu0.SUR_PONT_A<=gu0.CONTROLEUR_2)"
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 finished in 214480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(G(p1))) U (!p0&&X(G(p1))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 24 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
Running 2344 sub problems to find dead transitions.
[2026-05-23 17:16:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1201154510702352204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13219767379578670366.kers'
[2026-05-23 17:16:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1201154510702352204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13219767379578670366.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 289 rows 134 cols 1345 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-23 17:16:23] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13219767379578670366.kers
Total runtime 5 ms.
[2026-05-23 17:16:23] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2203/141 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41909ms problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 41914ms
[2026-05-23 17:17:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:17:05] [INFO ] Invariant cache hit.
[2026-05-23 17:17:05] [INFO ] Implicit Places using invariants in 358 ms returned []
[2026-05-23 17:17:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2026-05-23 17:17:05] [INFO ] Invariant cache hit.
[2026-05-23 17:17:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-23 17:17:07] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1471 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43427 ms. Remains : 134/138 places, 2347/2348 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X(G(p1))) U (!p0&&X(G(p1))))))'
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 410 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 finished in 43605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 68 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)))'
Spot run failed in 35 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' '!((!(G((p0 U p1)) U G(p2))||!(false U p0)))'
Spot run failed in 42 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 17:17:07] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13974833321515846930
[2026-05-23 17:17:07] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2026-05-23 17:17:07] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13974833321515846930
Running compilation step : cd /tmp/ltsmin13974833321515846930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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 17:17:07] [INFO ] Applying decomposition
[2026-05-23 17:17:07] [INFO ] Flatten gal took : 47 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/graph1254849810956788256.txt' '-o' '/tmp/graph1254849810956788256.bin' '-w' '/tmp/graph1254849810956788256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1254849810956788256.bin' '-l' '-1' '-v' '-w' '/tmp/graph1254849810956788256.weights' '-q' '0' '-e' '0.001'
[2026-05-23 17:17:07] [INFO ] Decomposing Gal with order
[2026-05-23 17:17:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 17:17:07] [INFO ] Removed a total of 3443 redundant transitions.
[2026-05-23 17:17:07] [INFO ] Flatten gal took : 178 ms
[2026-05-23 17:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 476 labels/synchronizations in 26 ms.
[2026-05-23 17:17:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality3749850061447339143.gal : 8 ms
[2026-05-23 17:17:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality11250346524708855552.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/LTLCardinality3749850061447339143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11250346524708855552.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...298
Read 3 LTL properties
Checking formula 0 : !((G((F("(gi3.gu3.ROUTE_A<3)"))&&(F(G("(gu2.CAPACITE>=2)"))))))
Formula 0 simplified : F(G!"(gi3.gu3.ROUTE_A<3)" | GF!"(gu2.CAPACITE>=2)")
Compilation finished in 6430 ms.
Running link step : cd /tmp/ltsmin13974833321515846930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin13974833321515846930;'/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))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin13974833321515846930;'/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))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13974833321515846930;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin13974833321515846930;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin13974833321515846930;'/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) U (LTLAPp4==true))) U []((LTLAPp5==true)))||!(false U (LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin13974833321515846930;'/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) U (LTLAPp4==true))) U []((LTLAPp5==true)))||!(false U (LTLAPp3==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin13974833321515846930;'/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))&&<>([]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 17:42:19] [INFO ] Flatten gal took : 41 ms
[2026-05-23 17:42:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality10120218747823868411.gal : 11 ms
[2026-05-23 17:42:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality17752951838094920868.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/LTLCardinality10120218747823868411.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17752951838094920868.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...299
Read 3 LTL properties
Checking formula 0 : !((G((F("(ROUTE_A<3)"))&&(F(G("(CAPACITE>=2)"))))))
Formula 0 simplified : F(G!"(ROUTE_A<3)" | GF!"(CAPACITE>=2)")

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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-V50P50N20"
export BK_EXAMINATION="LTLCardinality"
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-V50P50N20, examination is LTLCardinality"
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-177946841800259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;