MCC'2026- Execution of r034-tall-177946841800251

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16213.039	3600000.00	5114712.00	719468.20	FTFFFT?FFTTFFFFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 23K Mar 5 08:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 5 08:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 134K Mar 5 08:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 539K Mar 5 08:33 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 15K Mar 15 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 15 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 63K Mar 15 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 201K Mar 15 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 57K Mar 5 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 336K Mar 5 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 322K Mar 5 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Mar 5 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 1.1M 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-V50P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779552890205

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-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-23 16:14:51] [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 16:14:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 16:14:51] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-23 16:14:51] [INFO ] Transformed 128 places.
[2026-05-23 16:14:51] [INFO ] Transformed 1328 transitions.
[2026-05-23 16:14:51] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 231 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 52 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2026-05-23 16:14:51] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17734607829500884443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15826127868626925381.kers'
[2026-05-23 16:14:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17734607829500884443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15826127868626925381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 128 cols 1290 entries
Finished phase 1 with 21 SingleSign rule and 100 generalized
[2026-05-23 16:14:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15826127868626925381.kers
Total runtime 2 ms.
[2026-05-23 16:14:51] [INFO ] State equation strengthened by 22 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 7 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 2/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/9 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 10 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42286ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 42318ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2026-05-23 16:15:34] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15114242473713486986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-150604569944254361.kers'
[2026-05-23 16:15:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15114242473713486986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-150604569944254361.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 128 cols 1286 entries
Finished phase 1 with 20 SingleSign rule and 101 generalized
[2026-05-23 16:15:34] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-150604569944254361.kers
Total runtime 3 ms.
[2026-05-23 16:15:34] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-23 16:15:34] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:15:34] [INFO ] Invariant cache hit.
[2026-05-23 16:15:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:15:34] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 18 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43130 ms. Remains : 128/128 places, 1228/1328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:15:34] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:15:34] [INFO ] Invariant cache hit.
[2026-05-23 16:15:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/376 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/376 variables, and 9 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41627ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 41631ms
[2026-05-23 16:16:16] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:16:16] [INFO ] Invariant cache hit.
[2026-05-23 16:16:16] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-23 16:16:16] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:16:16] [INFO ] Invariant cache hit.
[2026-05-23 16:16:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:16:17] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 42306 ms. Remains : 128/128 places, 1228/1228 transitions.
Support contains 21 out of 128 places after structural reductions.
[2026-05-23 16:16:17] [INFO ] Flatten gal took : 112 ms
[2026-05-23 16:16:17] [INFO ] Flatten gal took : 85 ms
[2026-05-23 16:16:17] [INFO ] Input system was already deterministic with 1228 transitions.
Support contains 19 out of 128 places (down from 21) after GAL structural reductions.
RANDOM walk for 40000 steps (88 resets) in 3549 ms. (11 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40004 steps (32 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
[2026-05-23 16:16:18] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:16:18] [INFO ] Invariant cache hit.
[2026-05-23 16:16:18] [INFO ] State equation strengthened by 20 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/363 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/365 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/376 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/376 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/376 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 150/363 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/365 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/365 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/365 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/376 variables, 11/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/376 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/376 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/376 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 126 ms.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 1220 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Applied a total of 3 rules in 139 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2026-05-23 16:16:20] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13058821283581147638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3610556750575293294.kers'
[2026-05-23 16:16:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13058821283581147638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3610556750575293294.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 124 cols 1181 entries
Finished phase 1 with 119 SingleSign rule and 1 generalized
[2026-05-23 16:16:20] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-3610556750575293294.kers
Total runtime 7 ms.
[2026-05-23 16:16:20] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1272 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21336 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43116ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 43120ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 69 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43335 ms. Remains : 125/128 places, 1225/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40005 steps (32 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 412055 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 1
Probabilistic random walk after 412055 steps, saw 112727 distinct states, run finished after 3006 ms. (steps per millisecond=137 ) properties seen :0
[2026-05-23 16:17:06] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16272560199308325934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10428935423946604122.kers'
[2026-05-23 16:17:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16272560199308325934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10428935423946604122.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:17:06] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10428935423946604122.kers
Total runtime 2 ms.
[2026-05-23 16:17:06] [INFO ] State equation strengthened by 20 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) 252/355 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/357 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/357 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/370 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/370 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 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) 252/355 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/357 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/357 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/357 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/370 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/370 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1141ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 54 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 125/125 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 54 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 16:17:07] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:17:07] [INFO ] Invariant cache hit.
[2026-05-23 16:17:08] [INFO ] Implicit Places using invariants in 302 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 306 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1225/1225 transitions.
Applied a total of 0 rules in 64 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 425 ms. Remains : 123/125 places, 1225/1225 transitions.
RANDOM walk for 40002 steps (88 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 465670 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 465670 steps, saw 127299 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2026-05-23 16:17:11] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6947106408015479540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9808697831604968999.kers'
[2026-05-23 16:17:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6947106408015479540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9808697831604968999.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 122 cols 973 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 16:17:11] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9808697831604968999.kers
Total runtime 2 ms.
[2026-05-23 16:17:11] [INFO ] State equation strengthened by 20 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) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/355 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/368 variables, 13/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/368 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 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) 250/353 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/355 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/368 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 952 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1107ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 133 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 65 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 123/123 places, 1225/1225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1225/1225 transitions.
Applied a total of 0 rules in 52 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
[2026-05-23 16:17:12] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:17:12] [INFO ] Invariant cache hit.
[2026-05-23 16:17:13] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-23 16:17:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:17:13] [INFO ] Invariant cache hit.
[2026-05-23 16:17:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:17:13] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2026-05-23 16:17:13] [INFO ] Redundant transitions in 74 ms returned []
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:17:13] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:17:13] [INFO ] Invariant cache hit.
[2026-05-23 16:17:13] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 123/368 variables, and 6 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/123 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/368 variables, 123/129 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/368 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 1221/1370 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 1370 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 123/123 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61715ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 61718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62549 ms. Remains : 123/123 places, 1225/1225 transitions.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X((G(p1)||X(F(p2)))))))'
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 9 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:18:15] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12117808101179543102.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9351435569528030976.kers'
[2026-05-23 16:18:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12117808101179543102.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9351435569528030976.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 127 cols 1285 entries
Finished phase 1 with 70 SingleSign rule and 51 generalized
[2026-05-23 16:18:15] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9351435569528030976.kers
Total runtime 4 ms.
[2026-05-23 16:18:15] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/375 variables, and 8 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41726ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 41729ms
[2026-05-23 16:18:57] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:18:57] [INFO ] Invariant cache hit.
[2026-05-23 16:18:57] [INFO ] Implicit Places using invariants in 201 ms returned []
[2026-05-23 16:18:57] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:18:57] [INFO ] Invariant cache hit.
[2026-05-23 16:18:57] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:18:58] [INFO ] Implicit Places using invariants and state equation in 943 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1147 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42898 ms. Remains : 125/128 places, 1228/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&X((G(p1)||X(F(p2)))))))'
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-02 finished in 43321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1 U (p2||G(p1))))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 7 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:18:58] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:18:58] [INFO ] Invariant cache hit.
[2026-05-23 16:18:59] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-23 16:18:59] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:18:59] [INFO ] Invariant cache hit.
[2026-05-23 16:18:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:18:59] [INFO ] Implicit Places using invariants and state equation in 760 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 970 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 987 ms. Remains : 125/128 places, 1228/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1 U (p2||G(p1))))))'
Stuttering acceptance computed with spot in 354 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 708 ms.
Product exploration explored 100000 steps with 50000 reset in 609 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 2436 edges and 125 vertex of which 124 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/125 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 12 ms. Proved property starting from automaton with 10 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 52 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-05 finished in 2745 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||G(p1)))) U (F(!p1)&&X(p0))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 12 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2026-05-23 16:19:01] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9096056140731319917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3637254629534380018.kers'
[2026-05-23 16:19:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9096056140731319917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3637254629534380018.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 124 cols 1181 entries
Finished phase 1 with 119 SingleSign rule and 1 generalized
[2026-05-23 16:19:01] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3637254629534380018.kers
Total runtime 1 ms.
[2026-05-23 16:19:01] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1272 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21235 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42857ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 42861ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 16:19:44] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9448635921225274891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12102954578203441882.kers'
[2026-05-23 16:19:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9448635921225274891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12102954578203441882.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:19:44] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12102954578203441882.kers
Total runtime 2 ms.
[2026-05-23 16:19:44] [INFO ] Implicit Places using invariants in 236 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 248 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43139 ms. Remains : 124/128 places, 1225/1228 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||G(p1)))) U (F(!p1)&&X(p0))))'
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) p1), (AND (NOT p1) (NOT p0)), (NOT p0), p1, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06
Product exploration explored 100000 steps with 797 reset in 547 ms.
Product exploration explored 100000 steps with 900 reset in 516 ms.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 933 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 24 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
[2026-05-23 16:19:47] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-396966865692131789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12549686091077334082.kers'
[2026-05-23 16:19:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-396966865692131789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12549686091077334082.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 245 rows 123 cols 1073 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 16:19:47] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12549686091077334082.kers
Total runtime 1 ms.
[2026-05-23 16:19:47] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2026-05-23 16:19:49] [INFO ] [Real]Absence check using state equation in 1363 ms returned sat
[2026-05-23 16:19:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 16:19:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-23 16:19:49] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2026-05-23 16:19:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:19:49] [INFO ] [Nat]Added 20 Read/Feed constraints in 244 ms returned sat
[2026-05-23 16:19:49] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 44 ms.
[2026-05-23 16:19:50] [INFO ] Added : 11 causal constraints over 4 iterations in 453 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3980 ms.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 9 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Running 1222 sub problems to find dead transitions.
[2026-05-23 16:19:50] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:19:50] [INFO ] Invariant cache hit.
[2026-05-23 16:19:50] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 124/369 variables, and 7 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/124 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (OVERLAPS) 245/369 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 1322 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 21269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1171 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42849ms problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 42854ms
[2026-05-23 16:20:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:20:33] [INFO ] Invariant cache hit.
[2026-05-23 16:20:33] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-23 16:20:33] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:20:33] [INFO ] Invariant cache hit.
[2026-05-23 16:20:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:20:33] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 43609 ms. Remains : 124/124 places, 1225/1225 transitions.
Computed a total of 107 stabilizing places and 201 stable transitions
Computed a total of 107 stabilizing places and 201 stable transitions
Detected a total of 107/124 stabilizing places and 201/1225 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 27 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/4 properties
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
[2026-05-23 16:20:34] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:20:34] [INFO ] Invariant cache hit.
[2026-05-23 16:20:34] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2026-05-23 16:20:36] [INFO ] [Real]Absence check using state equation in 1394 ms returned sat
[2026-05-23 16:20:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 16:20:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2026-05-23 16:20:36] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2026-05-23 16:20:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:20:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 248 ms returned sat
[2026-05-23 16:20:36] [INFO ] Computed and/alt/rep : 108/216/108 causal constraints (skipped 134 transitions) in 36 ms.
[2026-05-23 16:20:37] [INFO ] Added : 11 causal constraints over 4 iterations in 438 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 3232 ms.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), p1, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 881 reset in 480 ms.
Product exploration explored 100000 steps with 928 reset in 482 ms.
Spot run failed in 78 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin10694057788307419127
[2026-05-23 16:20:38] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10694057788307419127
Running compilation step : cd /tmp/ltsmin10694057788307419127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2493 ms.
Running link step : cd /tmp/ltsmin10694057788307419127;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10694057788307419127;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased18410018793970976955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 1225/1225 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:20:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:20:53] [INFO ] Invariant cache hit.
[2026-05-23 16:20:53] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-23 16:20:53] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
[2026-05-23 16:20:53] [INFO ] Invariant cache hit.
[2026-05-23 16:20:53] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:20:54] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 124/124 places, 1225/1225 transitions.
Built C files in :
/tmp/ltsmin7387587353477679266
[2026-05-23 16:20:54] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7387587353477679266
Running compilation step : cd /tmp/ltsmin7387587353477679266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2362 ms.
Running link step : cd /tmp/ltsmin7387587353477679266;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7387587353477679266;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14454939002142001625.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 16:21:09] [INFO ] Flatten gal took : 45 ms
[2026-05-23 16:21:09] [INFO ] Flatten gal took : 46 ms
[2026-05-23 16:21:09] [INFO ] Time to serialize gal into /tmp/LTL7482230756817961587.gal : 33 ms
[2026-05-23 16:21:10] [INFO ] Time to serialize properties into /tmp/LTL548848449280265413.prop : 2 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/LTL7482230756817961587.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12309164747691827119.hoa' '-atoms' '/tmp/LTL548848449280265413.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL548848449280265413.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12309164747691827119.hoa
Detected timeout of ITS tools.
[2026-05-23 16:21:25] [INFO ] Flatten gal took : 35 ms
[2026-05-23 16:21:25] [INFO ] Flatten gal took : 40 ms
[2026-05-23 16:21:25] [INFO ] Time to serialize gal into /tmp/LTL15537781591957320357.gal : 14 ms
[2026-05-23 16:21:25] [INFO ] Time to serialize properties into /tmp/LTL7193204227485372229.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/LTL15537781591957320357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7193204227485372229.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(("((CONTROLEUR_1+CONTROLEUR_2)>=1)")||(G("(ATTENTE_B>1)")))))U((F("(ATTENTE_B<=1)"))&&(X("((CONTROLEUR_1+CONTROLEUR_2)>=1)")))...157
Formula 0 simplified : G(F!"(ATTENTE_B>1)" & FG!"((CONTROLEUR_1+CONTROLEUR_2)>=1)") R (G!"(ATTENTE_B<=1)" | X!"((CONTROLEUR_1+CONTROLEUR_2)>=1)")
Detected timeout of ITS tools.
[2026-05-23 16:21:40] [INFO ] Flatten gal took : 31 ms
[2026-05-23 16:21:40] [INFO ] Applying decomposition
[2026-05-23 16:21:40] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6008638900225602881.txt' '-o' '/tmp/graph6008638900225602881.bin' '-w' '/tmp/graph6008638900225602881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6008638900225602881.bin' '-l' '-1' '-v' '-w' '/tmp/graph6008638900225602881.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:21:40] [INFO ] Decomposing Gal with order
[2026-05-23 16:21:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:21:41] [INFO ] Removed a total of 3185 redundant transitions.
[2026-05-23 16:21:41] [INFO ] Flatten gal took : 454 ms
[2026-05-23 16:21:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 484 labels/synchronizations in 45 ms.
[2026-05-23 16:21:41] [INFO ] Time to serialize gal into /tmp/LTL17587396933270428204.gal : 2 ms
[2026-05-23 16:21:41] [INFO ] Time to serialize properties into /tmp/LTL16027921058083939642.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/LTL17587396933270428204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16027921058083939642.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(F(("((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>=1)")||(G("(gi1.gu4.ATTENTE_B>1)")))))U((F("(gi1.gu4.ATTENTE_B<=1)"))&&(X("((gu1.CONTRO...189
Formula 0 simplified : G(F!"(gi1.gu4.ATTENTE_B>1)" & FG!"((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>=1)") R (G!"(gi1.gu4.ATTENTE_B<=1)" | X!"((gu1.CONTROLEUR_1+g...177
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-06 finished in 174917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1)||X(G(p2))))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 11 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:21:56] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9425713697373560776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-978097599420940805.kers'
[2026-05-23 16:21:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9425713697373560776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-978097599420940805.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1284 entries
Finished phase 1 with 120 SingleSign rule and 1 generalized
[2026-05-23 16:21:56] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-978097599420940805.kers
Total runtime 5 ms.
[2026-05-23 16:21:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1274 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21306 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43015ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 43018ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 16:22:39] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6217777251393188253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4416876943257703633.kers'
[2026-05-23 16:22:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6217777251393188253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4416876943257703633.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:22:39] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4416876943257703633.kers
Total runtime 2 ms.
[2026-05-23 16:22:39] [INFO ] Implicit Places using invariants in 269 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 271 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43309 ms. Remains : 124/128 places, 1226/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1)||X(G(p2))))))'
Stuttering acceptance computed with spot in 203 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-08 finished in 43552 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(F(p0))||G(p1))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 293 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
[2026-05-23 16:22:40] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14641162359088158708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9922204671841592605.kers'
[2026-05-23 16:22:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14641162359088158708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9922204671841592605.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 121 cols 1076 entries
Finished phase 1 with 116 SingleSign rule and 1 generalized
[2026-05-23 16:22:40] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9922204671841592605.kers
Total runtime 3 ms.
[2026-05-23 16:22:40] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-23 16:22:40] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
[2026-05-23 16:22:40] [INFO ] Invariant cache hit.
[2026-05-23 16:22:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:22:41] [INFO ] Implicit Places using invariants and state equation in 725 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 959 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/128 places, 1224/1228 transitions.
Applied a total of 0 rules in 60 ms. Remains 119 /119 variables (removed 0) and now considering 1224/1224 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1313 ms. Remains : 119/128 places, 1224/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10
Product exploration explored 100000 steps with 319 reset in 464 ms.
Product exploration explored 100000 steps with 319 reset in 471 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/119 stabilizing places and 202/1224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 11 factoid took 64 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (127 resets) in 870 ms. (45 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (60 resets) in 264 ms. (150 steps per ms) remains 1/2 properties
[2026-05-23 16:22:42] [INFO ] Flow matrix only has 244 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11164884077657662946.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17984792038177664619.kers'
[2026-05-23 16:22:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11164884077657662946.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17984792038177664619.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 244 rows 119 cols 874 entries
Finished phase 1 with 115 SingleSign rule and 0 generalized
[2026-05-23 16:22:42] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17984792038177664619.kers
Total runtime 1 ms.
[2026-05-23 16:22:42] [INFO ] State equation strengthened by 20 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, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 52/363 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/119 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 20 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 492 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-10 finished in 2828 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((p1||X(X(F(p0))))))))'
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 27 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2026-05-23 16:22:43] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12099279445817369714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7793893315247522520.kers'
[2026-05-23 16:22:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12099279445817369714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7793893315247522520.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 247 rows 124 cols 1181 entries
Finished phase 1 with 119 SingleSign rule and 1 generalized
[2026-05-23 16:22:43] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7793893315247522520.kers
Total runtime 1 ms.
[2026-05-23 16:22:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1272 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21385 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1123 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43058ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 43061ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 16:23:26] [INFO ] Flow matrix only has 245 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-34814960100779782.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13630648463337462716.kers'
[2026-05-23 16:23:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-34814960100779782.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13630648463337462716.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 245 rows 124 cols 1173 entries
Finished phase 1 with 117 SingleSign rule and 1 generalized
[2026-05-23 16:23:26] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13630648463337462716.kers
Total runtime 6 ms.
[2026-05-23 16:23:26] [INFO ] Implicit Places using invariants in 293 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 297 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43396 ms. Remains : 123/128 places, 1225/1228 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((p1||X(X(F(p0))))))))'
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-11 finished in 43621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&F(G(p2)))))'
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 12 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:23:26] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16045198563274073078.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13626010732880509855.kers'
[2026-05-23 16:23:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16045198563274073078.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13626010732880509855.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1284 entries
Finished phase 1 with 120 SingleSign rule and 1 generalized
[2026-05-23 16:23:26] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13626010732880509855.kers
Total runtime 2 ms.
[2026-05-23 16:23:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1274 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21342 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43069ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 43072ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 16:24:09] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12972567863434319811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9322778629529275366.kers'
[2026-05-23 16:24:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12972567863434319811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9322778629529275366.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:24:09] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9322778629529275366.kers
Total runtime 5 ms.
[2026-05-23 16:24:10] [INFO ] Implicit Places using invariants in 285 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 289 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 13 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43390 ms. Remains : 124/128 places, 1226/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&F(G(p2)))))'
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 2676 steps with 6 reset in 14 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-12 finished in 43683 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&&F(p1)))||(((p1 U p2) U p3)&&(p0 U p4))))'
Support contains 7 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 66 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:24:10] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13992514268817797509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12684169312970876506.kers'
[2026-05-23 16:24:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13992514268817797509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12684169312970876506.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 127 cols 1285 entries
Finished phase 1 with 70 SingleSign rule and 51 generalized
[2026-05-23 16:24:10] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12684169312970876506.kers
Total runtime 5 ms.
[2026-05-23 16:24:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 127/375 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 101/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41672ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 41674ms
[2026-05-23 16:24:52] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:24:52] [INFO ] Invariant cache hit.
[2026-05-23 16:24:52] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-23 16:24:52] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:24:52] [INFO ] Invariant cache hit.
[2026-05-23 16:24:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:24:53] [INFO ] Implicit Places using invariants and state equation in 836 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1058 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 1228/1228 transitions.
Applied a total of 0 rules in 96 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42899 ms. Remains : 126/128 places, 1228/1228 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&&F(p1)))||(((p1 U p2) U p3)&&(p0 U p4))))'
Stuttering acceptance computed with spot in 465 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p4))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14
Product exploration explored 100000 steps with 1205 reset in 476 ms.
Product exploration explored 100000 steps with 1197 reset in 460 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 2540 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/126 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/5 atomic propositions.
Knowledge based reduction with 59 factoid took 222 ms. Reduced automaton from 11 states, 40 edges and 5 AP (stutter insensitive) to 17 states, 57 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (88 resets) in 423 ms. (94 steps per ms) remains 7/31 properties
BEST_FIRST walk for 40003 steps (32 resets) in 131 ms. (303 steps per ms) remains 1/7 properties
BEST_FIRST walk for 1815 steps (0 resets) in 8 ms. (201 steps per ms) remains 0/1 properties
Knowledge based reduction with 59 factoid took 3651 ms. Reduced automaton from 17 states, 57 edges and 4 AP (stutter insensitive) to 17 states, 57 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 700 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false, false, false, false, false, false]
[2026-05-23 16:24:59] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11166903882791871903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5645017653795663438.kers'
[2026-05-23 16:24:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11166903882791871903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5645017653795663438.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1184 entries
Finished phase 1 with 70 SingleSign rule and 50 generalized
[2026-05-23 16:24:59] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5645017653795663438.kers
Total runtime 2 ms.
[2026-05-23 16:24:59] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 16:25:01] [INFO ] [Real]Absence check using state equation in 1269 ms returned sat
[2026-05-23 16:25:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 16:25:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-23 16:25:01] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-23 16:25:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:25:01] [INFO ] [Nat]Added 20 Read/Feed constraints in 259 ms returned sat
[2026-05-23 16:25:01] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 135 transitions) in 31 ms.
[2026-05-23 16:25:02] [INFO ] Added : 35 causal constraints over 8 iterations in 250 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Knowledge-based reduction took 7396 ms.
Stuttering acceptance computed with spot in 744 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false, false, false, false, false, false]
Support contains 5 out of 126 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 57 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:25:02] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:25:02] [INFO ] Invariant cache hit.
[2026-05-23 16:25:02] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 126/374 variables, and 7 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 51/1174 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41713ms problems are : Problem set: 0 solved, 1225 unsolved
Search for dead transitions found 0 dead transitions in 41716ms
[2026-05-23 16:25:44] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:25:44] [INFO ] Invariant cache hit.
[2026-05-23 16:25:44] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-23 16:25:44] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:25:44] [INFO ] Invariant cache hit.
[2026-05-23 16:25:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:25:45] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2026-05-23 16:25:45] [INFO ] Redundant transitions in 22 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42763 ms. Remains : 126/126 places, 1228/1228 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 2540 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/126 stabilizing places and 204/1228 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge based reduction with 65 factoid took 198 ms. Reduced automaton from 17 states, 57 edges and 4 AP (stutter insensitive) to 17 states, 57 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (88 resets) in 392 ms. (101 steps per ms) remains 6/31 properties
BEST_FIRST walk for 34574 steps (27 resets) in 70 ms. (486 steps per ms) remains 0/6 properties
Knowledge based reduction with 65 factoid took 3662 ms. Reduced automaton from 17 states, 57 edges and 4 AP (stutter insensitive) to 17 states, 57 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 675 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false, false, false, false, false, false]
[2026-05-23 16:25:50] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:25:50] [INFO ] Invariant cache hit.
[2026-05-23 16:25:50] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2026-05-23 16:25:51] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2026-05-23 16:25:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 16:25:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-23 16:25:52] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2026-05-23 16:25:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:25:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 252 ms returned sat
[2026-05-23 16:25:52] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 135 transitions) in 34 ms.
[2026-05-23 16:25:52] [INFO ] Added : 35 causal constraints over 8 iterations in 243 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Knowledge-based reduction took 7339 ms.
Stuttering acceptance computed with spot in 577 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 658 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 1218 reset in 451 ms.
Product exploration explored 100000 steps with 1200 reset in 478 ms.
Built C files in :
/tmp/ltsmin13920524165708062338
[2026-05-23 16:25:55] [INFO ] Computing symmetric may disable matrix : 1228 transitions.
[2026-05-23 16:25:55] [INFO ] Computation of Complete disable matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:25:55] [INFO ] Computing symmetric may enable matrix : 1228 transitions.
[2026-05-23 16:25:55] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:25:55] [INFO ] Computing Do-Not-Accords matrix : 1228 transitions.
[2026-05-23 16:25:55] [INFO ] Computation of Completed DNA matrix. took 68 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:25:55] [INFO ] Built C files in 565ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13920524165708062338
Running compilation step : cd /tmp/ltsmin13920524165708062338;'/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/ltsmin13920524165708062338;'/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/ltsmin13920524165708062338;'/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 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 54 ms. Remains 126 /126 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Skipped dead transition search.
[2026-05-23 16:25:58] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:25:58] [INFO ] Invariant cache hit.
[2026-05-23 16:25:59] [INFO ] Implicit Places using invariants in 244 ms returned []
[2026-05-23 16:25:59] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2026-05-23 16:25:59] [INFO ] Invariant cache hit.
[2026-05-23 16:25:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-23 16:25:59] [INFO ] Implicit Places using invariants and state equation in 740 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 988 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/126 places, 1228/1228 transitions.
Applied a total of 0 rules in 55 ms. Remains 125 /125 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1099 ms. Remains : 125/126 places, 1228/1228 transitions.
Built C files in :
/tmp/ltsmin6946451727173883202
[2026-05-23 16:25:59] [INFO ] Computing symmetric may disable matrix : 1228 transitions.
[2026-05-23 16:25:59] [INFO ] Computation of Complete disable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:25:59] [INFO ] Computing symmetric may enable matrix : 1228 transitions.
[2026-05-23 16:25:59] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:26:00] [INFO ] Computing Do-Not-Accords matrix : 1228 transitions.
[2026-05-23 16:26:00] [INFO ] Computation of Completed DNA matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:26:00] [INFO ] Built C files in 534ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6946451727173883202
Running compilation step : cd /tmp/ltsmin6946451727173883202;'/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/ltsmin6946451727173883202;'/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/ltsmin6946451727173883202;'/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 16:26:03] [INFO ] Flatten gal took : 86 ms
[2026-05-23 16:26:03] [INFO ] Flatten gal took : 82 ms
[2026-05-23 16:26:03] [INFO ] Time to serialize gal into /tmp/LTL3434175655470975218.gal : 6 ms
[2026-05-23 16:26:03] [INFO ] Time to serialize properties into /tmp/LTL15883846399542529813.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/LTL3434175655470975218.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12383457778927183735.hoa' '-atoms' '/tmp/LTL15883846399542529813.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/LTL15883846399542529813.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12383457778927183735.hoa
Detected timeout of ITS tools.
[2026-05-23 16:26:18] [INFO ] Flatten gal took : 24 ms
[2026-05-23 16:26:18] [INFO ] Flatten gal took : 24 ms
[2026-05-23 16:26:18] [INFO ] Time to serialize gal into /tmp/LTL6589772443541571132.gal : 6 ms
[2026-05-23 16:26:18] [INFO ] Time to serialize properties into /tmp/LTL5695357886849606004.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/LTL6589772443541571132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5695357886849606004.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<=SUR_PONT_A)")&&(F("(NB_ATTENTE_B_23>=1)"))))||(((("(NB_ATTENTE_B_23>=1)")U("(ROUTE_A>=1)"))U("(SUR_PONT_B>=3)"))&&((...211
Formula 0 simplified : F(!"(SORTI_B<=SUR_PONT_A)" | G!"(NB_ATTENTE_B_23>=1)") & (((!"(NB_ATTENTE_B_23>=1)" R !"(ROUTE_A>=1)") R !"(SUR_PONT_B>=3)") | (!"(S...206
Detected timeout of ITS tools.
[2026-05-23 16:26:33] [INFO ] Flatten gal took : 34 ms
[2026-05-23 16:26:33] [INFO ] Applying decomposition
[2026-05-23 16:26:33] [INFO ] Flatten gal took : 24 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/graph6650990827590423396.txt' '-o' '/tmp/graph6650990827590423396.bin' '-w' '/tmp/graph6650990827590423396.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6650990827590423396.bin' '-l' '-1' '-v' '-w' '/tmp/graph6650990827590423396.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:26:33] [INFO ] Decomposing Gal with order
[2026-05-23 16:26:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:26:34] [INFO ] Removed a total of 1306 redundant transitions.
[2026-05-23 16:26:34] [INFO ] Flatten gal took : 190 ms
[2026-05-23 16:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 519 labels/synchronizations in 15 ms.
[2026-05-23 16:26:34] [INFO ] Time to serialize gal into /tmp/LTL18178425065566643275.gal : 4 ms
[2026-05-23 16:26:34] [INFO ] Time to serialize properties into /tmp/LTL12978021445922342563.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/LTL18178425065566643275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12978021445922342563.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((G(("(gu0.SORTI_B<=gu0.SUR_PONT_A)")&&(F("(gi2.gu3.NB_ATTENTE_B_23>=1)"))))||(((("(gi2.gu3.NB_ATTENTE_B_23>=1)")U("(gi2.gu2.ROUTE_A...267
Formula 0 simplified : F(!"(gu0.SORTI_B<=gu0.SUR_PONT_A)" | G!"(gi2.gu3.NB_ATTENTE_B_23>=1)") & (((!"(gi2.gu3.NB_ATTENTE_B_23>=1)" R !"(gi2.gu2.ROUTE_A>=1)...262
Detected timeout of ITS tools.
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14 finished in 159061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 7 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2026-05-23 16:26:49] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3787108292539797144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10446138628089093139.kers'
[2026-05-23 16:26:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3787108292539797144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10446138628089093139.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 126 cols 1284 entries
Finished phase 1 with 120 SingleSign rule and 1 generalized
[2026-05-23 16:26:49] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10446138628089093139.kers
Total runtime 1 ms.
[2026-05-23 16:26:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1274 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21209 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1124 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43134ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 43136ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
[2026-05-23 16:27:32] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17165286266343848825.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12170916977194273827.kers'
[2026-05-23 16:27:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17165286266343848825.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12170916977194273827.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 246 rows 126 cols 1276 entries
Finished phase 1 with 118 SingleSign rule and 1 generalized
[2026-05-23 16:27:32] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12170916977194273827.kers
Total runtime 1 ms.
[2026-05-23 16:27:32] [INFO ] Implicit Places using invariants in 285 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 293 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 124/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43446 ms. Remains : 124/128 places, 1226/1228 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N10-LTLCardinality-15
Stuttering criterion allowed to conclude after 1266 steps with 2 reset in 8 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N10-LTLCardinality-15 finished in 43576 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||G(p1)))) U (F(!p1)&&X(p0))))'
Spot run failed in 43 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&&F(p1)))||(((p1 U p2) U p3)&&(p0 U p4))))'
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.
[2026-05-23 16:27:33] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8659590650683818591
[2026-05-23 16:27:33] [INFO ] Applying decomposition
[2026-05-23 16:27:33] [INFO ] Computing symmetric may disable matrix : 1228 transitions.
[2026-05-23 16:27:33] [INFO ] Flatten gal took : 21 ms
[2026-05-23 16:27:33] [INFO ] Computation of Complete disable matrix. took 54 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16274169361121880978.txt' '-o' '/tmp/graph16274169361121880978.bin' '-w' '/tmp/graph16274169361121880978.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16274169361121880978.bin' '-l' '-1' '-v' '-w' '/tmp/graph16274169361121880978.weights' '-q' '0' '-e' '0.001'
[2026-05-23 16:27:33] [INFO ] Decomposing Gal with order
[2026-05-23 16:27:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 16:27:33] [INFO ] Computing symmetric may enable matrix : 1228 transitions.
[2026-05-23 16:27:33] [INFO ] Computation of Complete enable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:27:33] [INFO ] Computing Do-Not-Accords matrix : 1228 transitions.
[2026-05-23 16:27:33] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 16:27:33] [INFO ] Built C files in 552ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8659590650683818591
Running compilation step : cd /tmp/ltsmin8659590650683818591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 16:27:33] [INFO ] Removed a total of 2365 redundant transitions.
[2026-05-23 16:27:33] [INFO ] Flatten gal took : 581 ms
[2026-05-23 16:27:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1444 labels/synchronizations in 51 ms.
[2026-05-23 16:27:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality8991225446546812342.gal : 4 ms
[2026-05-23 16:27:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality10752415116038884766.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/LTLCardinality8991225446546812342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10752415116038884766.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 2 LTL properties
Checking formula 0 : !(((G(F(("((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>=1)")||(G("(gu4.ATTENTE_B>1)")))))U((F("(gu4.ATTENTE_B<=1)"))&&(X("((gu1.CONTROLEUR_1+g...181
Formula 0 simplified : G(F!"(gu4.ATTENTE_B>1)" & FG!"((gu1.CONTROLEUR_1+gu1.CONTROLEUR_2)>=1)") R (G!"(gu4.ATTENTE_B<=1)" | X!"((gu1.CONTROLEUR_1+gu1.CONTR...169
Compilation finished in 5883 ms.
Running link step : cd /tmp/ltsmin8659590650683818591;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin8659590650683818591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))) U (<>(!(LTLAPp1==true))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8659590650683818591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))) U (<>(!(LTLAPp1==true))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8659590650683818591;'/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)&&<>((LTLAPp3==true))))||((((LTLAPp3==true) U (LTLAPp4==true)) U (LTLAPp5==true))&&((LTLAPp2==true) U (LTLAPp6==true))))' '--buchi-type=spotba'
LTSmin run took 4337 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin8659590650683818591;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '([](<>(((LTLAPp0==true)||[]((LTLAPp1==true))))) U (<>(!(LTLAPp1==true))&&X((LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 16:51:55] [INFO ] Flatten gal took : 264 ms
[2026-05-23 16:51:55] [INFO ] Time to serialize gal into /tmp/LTLCardinality8593228847182187351.gal : 25 ms
[2026-05-23 16:51:55] [INFO ] Time to serialize properties into /tmp/LTLCardinality2313012178615968895.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8593228847182187351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2313012178615968895.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !(((G(F(("((CONTROLEUR_1+CONTROLEUR_2)>=1)")||(G("(ATTENTE_B>1)")))))U((F("(ATTENTE_B<=1)"))&&(X("((CONTROLEUR_1+CONTROLEUR_2)>=1)")))...157
Formula 0 simplified : G(F!"(ATTENTE_B>1)" & FG!"((CONTROLEUR_1+CONTROLEUR_2)>=1)") R (G!"(ATTENTE_B<=1)" | X!"((CONTROLEUR_1+CONTROLEUR_2)>=1)")

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-V50P50N10"
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-V50P50N10, 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-177946841800251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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