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

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V10P10N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4731.876 770779.00 828029.00 2195.70 TFTFFFFTFFTFTTTF 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-177946841700009.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-COL-V10P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841700009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.7K Mar 5 08:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 5 08:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 08:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 5 08:21 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 4.7K Mar 15 07:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 08:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Mar 5 08:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 5 08:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 5 08:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 38K 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-COL-V10P10N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779481093336

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-05-22 20:18:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:18:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:18:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-22 20:18:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-22 20:18:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 541 ms
[2026-05-22 20:18:15] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 48 PT places and 5438.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2026-05-22 20:18:15] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2026-05-22 20:18:15] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
RANDOM walk for 40000 steps (8 resets) in 1650 ms. (24 steps per ms) remains 49/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/49 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7595419943881916675.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6901265560802713121.kers'
[2026-05-22 20:18:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7595419943881916675.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6901265560802713121.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 12 cols 28 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-22 20:18:16] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6901265560802713121.kers
Total runtime 2 ms.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
After SMT solving in domain Real declared 12/22 variables, and 4 constraints, problems are : Problem set: 47 solved, 0 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/12 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 47 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 47 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 20:18:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2026-05-22 20:18:16] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:18:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 20:18:16] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 11)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 11) 11) 11)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2026-05-22 20:18:16] [INFO ] Unfolded HLPN to a Petri net with 48 places and 288 transitions 2090 arcs in 22 ms.
[2026-05-22 20:18:16] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 15 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2026-05-22 20:18:16] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4596419075988692809.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9483640829721797300.kers'
[2026-05-22 20:18:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4596419075988692809.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9483640829721797300.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 48 cols 410 entries
Finished phase 1 with 21 SingleSign rule and 20 generalized
[2026-05-22 20:18:16] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9483640829721797300.kers
Total runtime 2 ms.
[2026-05-22 20:18:16] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/9 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 6 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/81 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/81 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/81 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 81 constraints, problems are : Problem set: 22 solved, 263 unsolved in 7896 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/7 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/9 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 90/138 variables, 48/59 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 22/81 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 263/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 344 constraints, problems are : Problem set: 22 solved, 263 unsolved in 16015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 263/285 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24195ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 24202ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
[2026-05-22 20:18:40] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6580032248397371002.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10561196830142367484.kers'
[2026-05-22 20:18:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6580032248397371002.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10561196830142367484.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 48 cols 398 entries
Finished phase 1 with 18 SingleSign rule and 21 generalized
[2026-05-22 20:18:40] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10561196830142367484.kers
Total runtime 1 ms.
[2026-05-22 20:18:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 20:18:40] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:18:40] [INFO ] Invariant cache hit.
[2026-05-22 20:18:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 20:18:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/48 places, 266/288 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24434 ms. Remains : 48/48 places, 266/288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2026-05-22 20:18:41] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:18:41] [INFO ] Invariant cache hit.
[2026-05-22 20:18:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 86/134 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 80 constraints, problems are : Problem set: 0 solved, 263 unsolved in 7038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 86/134 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 263/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/134 variables, and 343 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27193ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 27194ms
[2026-05-22 20:19:08] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:19:08] [INFO ] Invariant cache hit.
[2026-05-22 20:19:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-22 20:19:08] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:19:08] [INFO ] Invariant cache hit.
[2026-05-22 20:19:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 20:19:08] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 27393 ms. Remains : 48/48 places, 266/266 transitions.
Support contains 15 out of 48 places after structural reductions.
[2026-05-22 20:19:08] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:19:08] [INFO ] Flatten gal took : 24 ms
[2026-05-22 20:19:08] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (444 resets) in 1234 ms. (32 steps per ms) remains 25/37 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (20 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (17 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (16 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (20 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4006 steps (13 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (20 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (12 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (20 resets) in 50 ms. (78 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (20 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
[2026-05-22 20:19:09] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:19:09] [INFO ] Invariant cache hit.
[2026-05-22 20:19:09] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 16 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (OVERLAPS) 20/35 variables, 2/4 constraints. Problems are: Problem set: 12 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/6 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/37 variables, 2/8 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/123 variables, 37/45 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 20/65 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/134 variables, 11/76 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/77 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/77 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/77 constraints. Problems are: Problem set: 24 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 77 constraints, problems are : Problem set: 24 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 2/4 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/37 variables, 4/8 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 86/123 variables, 37/45 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 20/65 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/65 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/134 variables, 11/76 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/77 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 1/78 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/78 constraints. Problems are: Problem set: 24 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/78 constraints. Problems are: Problem set: 24 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 78 constraints, problems are : Problem set: 24 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/25 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 251ms problems are : Problem set: 24 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 334 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2026-05-22 20:19:09] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18061252695658348034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17423583460159467717.kers'
[2026-05-22 20:19:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18061252695658348034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17423583460159467717.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 46 cols 396 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-22 20:19:09] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17423583460159467717.kers
Total runtime 0 ms.
[2026-05-22 20:19:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 74 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 337 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25557ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 25559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25583 ms. Remains : 46/48 places, 266/266 transitions.
RANDOM walk for 40000 steps (443 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40010 steps (148 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Probably explored full state space saw : 259552 states, properties seen :0
Probabilistic random walk after 1080821 steps, saw 259552 distinct states, run finished after 2139 ms. (steps per millisecond=505 ) properties seen :0
Explored full state space saw : 259556 states, properties seen :0
Exhaustive walk after 1080838 steps, saw 259556 distinct states, run finished after 1862 ms. (steps per millisecond=580 ) properties seen :0
Successfully simplified 25 atomic propositions for a total of 8 simplifications.
[2026-05-22 20:19:39] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:19:39] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:19:39] [INFO ] Input system was already deterministic with 266 transitions.
Computed a total of 31 stabilizing places and 42 stable transitions
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 5 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2026-05-22 20:19:39] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10442053334770945864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9046863537605964907.kers'
[2026-05-22 20:19:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10442053334770945864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9046863537605964907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 47 cols 397 entries
Finished phase 1 with 28 SingleSign rule and 11 generalized
[2026-05-22 20:19:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9046863537605964907.kers
Total runtime 1 ms.
[2026-05-22 20:19:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 86/133 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 78 constraints, problems are : Problem set: 0 solved, 263 unsolved in 6595 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 1/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 86/133 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 263/341 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 133/133 variables, and 342 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26739ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 26739ms
[2026-05-22 20:20:05] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:20:05] [INFO ] Invariant cache hit.
[2026-05-22 20:20:05] [INFO ] Implicit Places using invariants in 72 ms returned [13, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 266/266 transitions.
Applied a total of 0 rules in 7 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26831 ms. Remains : 45/48 places, 266/266 transitions.
[2026-05-22 20:20:06] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:20:06] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:20:06] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-22 20:20:06] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:20:06] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:20:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12773232039129514052.gal : 8 ms
[2026-05-22 20:20:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14276972507306567235.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12773232039129514052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14276972507306567235.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-22 20:20:36] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:20:36] [INFO ] Applying decomposition
[2026-05-22 20:20:36] [INFO ] Flatten gal took : 25 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/graph15182923161466831094.txt' '-o' '/tmp/graph15182923161466831094.bin' '-w' '/tmp/graph15182923161466831094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15182923161466831094.bin' '-l' '-1' '-v' '-w' '/tmp/graph15182923161466831094.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:20:36] [INFO ] Decomposing Gal with order
[2026-05-22 20:20:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:20:36] [INFO ] Removed a total of 543 redundant transitions.
[2026-05-22 20:20:36] [INFO ] Flatten gal took : 84 ms
[2026-05-22 20:20:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 95 labels/synchronizations in 7 ms.
[2026-05-22 20:20:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1539188664533840488.gal : 2 ms
[2026-05-22 20:20:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5382418311867291219.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1539188664533840488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5382418311867291219.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,0.939123,37624,2165,1569,68816,10818,120,84858,136,143200,0


Converting to forward existential form...Done !
original formula: EX(EG((i0.u0.SORTI_B<=1)))
=> equivalent forward existential formula: [FwdG(EY(Init),(i0.u0.SORTI_B<=1))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,0,18.4877,370756,1,0,433705,96478,318,1.2328e+06,706,3.1981e+06,348358
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 7 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2026-05-22 20:20:55] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17526876614727912836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6653027119306057738.kers'
[2026-05-22 20:20:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17526876614727912836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6653027119306057738.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 44 cols 373 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-22 20:20:55] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6653027119306057738.kers
Total runtime 0 ms.
[2026-05-22 20:20:55] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4870 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24984ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 24984ms
[2026-05-22 20:21:20] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2026-05-22 20:21:20] [INFO ] Invariant cache hit.
[2026-05-22 20:21:20] [INFO ] Implicit Places using invariants in 81 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25081 ms. Remains : 43/48 places, 265/266 transitions.
[2026-05-22 20:21:20] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:21:20] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:21:20] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-22 20:21:20] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:21:20] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:21:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10666453179083459646.gal : 3 ms
[2026-05-22 20:21:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14866424736428750384.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10666453179083459646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14866424736428750384.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,21.0165,495104,2,57587,5,794249,6,0,439,987797,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,21.0227,495104,1,0,6,794249,7,1,670,987797,1
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 265
Applied a total of 3 rules in 24 ms. Remains 46 /48 variables (removed 2) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2026-05-22 20:21:41] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14528555258577212480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12077492306480671032.kers'
[2026-05-22 20:21:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14528555258577212480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12077492306480671032.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 45 cols 364 entries
Finished phase 1 with 35 SingleSign rule and 3 generalized
[2026-05-22 20:21:41] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12077492306480671032.kers
Total runtime 1 ms.
[2026-05-22 20:21:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 85/131 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 77 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7730 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 85/131 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 262/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 339 constraints, problems are : Problem set: 0 solved, 262 unsolved in 19845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27685ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 27685ms
[2026-05-22 20:22:09] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2026-05-22 20:22:09] [INFO ] Invariant cache hit.
[2026-05-22 20:22:09] [INFO ] Implicit Places using invariants in 80 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 81 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 44/48 places, 265/266 transitions.
Applied a total of 0 rules in 18 ms. Remains 44 /44 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 27810 ms. Remains : 44/48 places, 265/266 transitions.
[2026-05-22 20:22:09] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:22:09] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:22:09] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-22 20:22:09] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:22:09] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:22:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2399497130897835051.gal : 2 ms
[2026-05-22 20:22:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality8969050937779673541.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2399497130897835051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8969050937779673541.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-22 20:22:39] [INFO ] Flatten gal took : 20 ms
[2026-05-22 20:22:39] [INFO ] Applying decomposition
[2026-05-22 20:22:39] [INFO ] Flatten gal took : 7 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/graph11132684153621107787.txt' '-o' '/tmp/graph11132684153621107787.bin' '-w' '/tmp/graph11132684153621107787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11132684153621107787.bin' '-l' '-1' '-v' '-w' '/tmp/graph11132684153621107787.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:22:39] [INFO ] Decomposing Gal with order
[2026-05-22 20:22:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:22:39] [INFO ] Removed a total of 633 redundant transitions.
[2026-05-22 20:22:39] [INFO ] Flatten gal took : 50 ms
[2026-05-22 20:22:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 17 ms.
[2026-05-22 20:22:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality4006923495355364288.gal : 1 ms
[2026-05-22 20:22:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality5412981712109424128.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4006923495355364288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5412981712109424128.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,164516,0.50663,22700,781,523,39580,5447,130,63292,98,22119,0


Converting to forward existential form...Done !
original formula: EG((i1.u0.SORTI_B<=1))
=> equivalent forward existential formula: [FwdG(Init,(i1.u0.SORTI_B<=1))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
dead was empty
(forward)formula 0,0,8.99995,219516,1,0,270714,38846,339,1.46326e+06,479,260042,144019
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
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 43 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 41 transition count 262
Applied a total of 10 rules in 33 ms. Remains 41 /48 variables (removed 7) and now considering 262/266 (removed 4) transitions.
[2026-05-22 20:22:48] [INFO ] Flow matrix only has 82 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2601375124407521356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10668653167856497295.kers'
[2026-05-22 20:22:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2601375124407521356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10668653167856497295.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 41 cols 348 entries
Finished phase 1 with 34 SingleSign rule and 1 generalized
[2026-05-22 20:22:48] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10668653167856497295.kers
Total runtime 0 ms.
[2026-05-22 20:22:48] [INFO ] Implicit Places using invariants in 229 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/48 places, 262/266 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 276 ms. Remains : 40/48 places, 262/266 transitions.
[2026-05-22 20:22:48] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:22:48] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:22:48] [INFO ] Input system was already deterministic with 262 transitions.
[2026-05-22 20:22:48] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:22:48] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:22:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality15816142633259325412.gal : 2 ms
[2026-05-22 20:22:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality16388759072765514469.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15816142633259325412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16388759072765514469.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,63294,1.42814,46976,2,13945,5,102498,6,0,423,77994,0


Converting to forward existential form...Done !
original formula: EG(EF((ROUTE_A>ATTENTE_B)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (ROUTE_A>ATTENTE_B)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56,...1388
dead was empty
(forward)formula 0,0,18.3885,462876,1,0,909,1.13997e+06,537,297,3796,1.2859e+06,725
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 45 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 45 transition count 265
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 43 transition count 264
Applied a total of 6 rules in 18 ms. Remains 43 /48 variables (removed 5) and now considering 264/266 (removed 2) transitions.
[2026-05-22 20:23:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11702928487515031279.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14040221901153010830.kers'
[2026-05-22 20:23:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11702928487515031279.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14040221901153010830.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 43 cols 352 entries
Finished phase 1 with 36 SingleSign rule and 1 generalized
[2026-05-22 20:23:07] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14040221901153010830.kers
Total runtime 0 ms.
[2026-05-22 20:23:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 20:23:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2026-05-22 20:23:07] [INFO ] Invariant cache hit.
[2026-05-22 20:23:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2026-05-22 20:23:07] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2026-05-22 20:23:07] [INFO ] Redundant transitions in 10 ms returned []
Running 261 sub problems to find dead transitions.
[2026-05-22 20:23:07] [INFO ] Flow matrix only has 84 transitions (discarded 180 similar events)
[2026-05-22 20:23:07] [INFO ] Invariant cache hit.
[2026-05-22 20:23:07] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/127 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 0/127 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 70 constraints, problems are : Problem set: 0 solved, 261 unsolved in 5259 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 3 (OVERLAPS) 84/127 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 261/331 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 332 constraints, problems are : Problem set: 0 solved, 261 unsolved in 29901 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35236ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 35237ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/48 places, 264/266 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35456 ms. Remains : 43/48 places, 264/266 transitions.
[2026-05-22 20:23:42] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:23:42] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:23:42] [INFO ] Input system was already deterministic with 264 transitions.
[2026-05-22 20:23:42] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:23:42] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:23:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality16400388565312192222.gal : 2 ms
[2026-05-22 20:23:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17094210811576888218.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16400388565312192222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17094210811576888218.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,69476,6.6325,190172,2,78308,5,177713,6,0,437,248564,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 20:24:12] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:24:12] [INFO ] Applying decomposition
[2026-05-22 20:24:12] [INFO ] Flatten gal took : 6 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/graph17426906931097327384.txt' '-o' '/tmp/graph17426906931097327384.bin' '-w' '/tmp/graph17426906931097327384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17426906931097327384.bin' '-l' '-1' '-v' '-w' '/tmp/graph17426906931097327384.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:24:13] [INFO ] Decomposing Gal with order
[2026-05-22 20:24:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:24:13] [INFO ] Removed a total of 271 redundant transitions.
[2026-05-22 20:24:13] [INFO ] Flatten gal took : 142 ms
[2026-05-22 20:24:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 262 labels/synchronizations in 13 ms.
[2026-05-22 20:24:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2600931839390798802.gal : 3 ms
[2026-05-22 20:24:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18093356550258230526.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2600931839390798802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18093356550258230526.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,69476,5.8729,160616,2,58855,5,442620,6,0,455,290958,0


Converting to forward existential form...Done !
original formula: EG(A(((gu1.VIDANGE_0+gu1.VIDANGE_1)<=(gu1.CHOIX_0+gu1.CHOIX_1)) U EF((gu0.ATTENTE_A<=gu0.ATTENTE_B))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (gu0.ATTENTE_A<=gu0.ATTENTE_B))) U (!(((gu1.VIDANGE_0+gu1.VIDANGE_1)<=(gu1.CHOIX_0+gu...278
Reverse transition relation is NOT exact ! Due to transitions gu1.t10, gu1.t11, t0, t18, t42, t94, t145, t251, t260, Intersection with reachable at each s...213
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 4 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2026-05-22 20:24:43] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9276180067514702360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2404252426999472754.kers'
[2026-05-22 20:24:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9276180067514702360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2404252426999472754.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 44 cols 373 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-22 20:24:43] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2404252426999472754.kers
Total runtime 1 ms.
[2026-05-22 20:24:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4901 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25026ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 25027ms
[2026-05-22 20:25:08] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2026-05-22 20:25:08] [INFO ] Invariant cache hit.
[2026-05-22 20:25:08] [INFO ] Implicit Places using invariants in 97 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25133 ms. Remains : 43/48 places, 265/266 transitions.
[2026-05-22 20:25:08] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:25:08] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:25:08] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-22 20:25:08] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:25:08] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:25:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality12546889499947958223.gal : 1 ms
[2026-05-22 20:25:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality10157913666736953234.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12546889499947958223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10157913666736953234.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,19.7996,496152,2,57587,5,794249,6,0,439,987797,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,19.8155,496152,1,0,6,794249,7,1,670,987797,1
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 4 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2026-05-22 20:25:28] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8034015685216234118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16775505497159081075.kers'
[2026-05-22 20:25:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8034015685216234118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16775505497159081075.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 46 cols 396 entries
Finished phase 1 with 38 SingleSign rule and 1 generalized
[2026-05-22 20:25:28] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16775505497159081075.kers
Total runtime 1 ms.
[2026-05-22 20:25:28] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 74 constraints, problems are : Problem set: 0 solved, 263 unsolved in 5357 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 263/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 337 constraints, problems are : Problem set: 0 solved, 263 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25479ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 25480ms
[2026-05-22 20:25:53] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2026-05-22 20:25:53] [INFO ] Invariant cache hit.
[2026-05-22 20:25:54] [INFO ] Implicit Places using invariants in 76 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/48 places, 266/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25580 ms. Remains : 45/48 places, 266/266 transitions.
[2026-05-22 20:25:54] [INFO ] Flatten gal took : 22 ms
[2026-05-22 20:25:54] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:25:54] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-22 20:25:54] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:25:54] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:25:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16334174551930845095.gal : 4 ms
[2026-05-22 20:25:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15587866925257107291.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16334174551930845095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15587866925257107291.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,14.8795,405604,2,119801,5,518455,6,0,448,703923,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 20:26:24] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:26:24] [INFO ] Applying decomposition
[2026-05-22 20:26:24] [INFO ] Flatten gal took : 5 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/graph10324522606661231395.txt' '-o' '/tmp/graph10324522606661231395.bin' '-w' '/tmp/graph10324522606661231395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10324522606661231395.bin' '-l' '-1' '-v' '-w' '/tmp/graph10324522606661231395.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:26:24] [INFO ] Decomposing Gal with order
[2026-05-22 20:26:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:26:24] [INFO ] Removed a total of 415 redundant transitions.
[2026-05-22 20:26:24] [INFO ] Flatten gal took : 27 ms
[2026-05-22 20:26:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 2 ms.
[2026-05-22 20:26:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality6262858019214861220.gal : 1 ms
[2026-05-22 20:26:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality8118910184379250213.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6262858019214861220.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8118910184379250213.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,1.30855,43320,2,8555,5,176901,6,0,300,189157,0


Converting to forward existential form...Done !
original formula: E(AG(((gu1.SUR_PONT_A<=gu1.ROUTE_A) * EX((gi1.gu3.ATTENTE_A<=9)))) U AF(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((gu1.SUR_PONT_A<=gu1.ROUTE_A) * EX((gi1.gu3.ATTENTE_A<=9))))))) * !(EG(!(!(EX(!(FALSE)...171
Reverse transition relation is NOT exact ! Due to transitions gi1.gu0.t23, gi1.t171, gi1.t111, gi1.t55, gi1.t54, gi1.t24, gi1.t22, gi1.t21, t0, t10, Inter...247
(forward)formula 0,1,16.588,402036,1,0,317,2.23586e+06,119,85,2294,1.99497e+06,324
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 3 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2026-05-22 20:26:41] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8942860635523492952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17064839717184291243.kers'
[2026-05-22 20:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8942860635523492952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17064839717184291243.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 85 rows 44 cols 373 entries
Finished phase 1 with 37 SingleSign rule and 1 generalized
[2026-05-22 20:26:41] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17064839717184291243.kers
Total runtime 1 ms.
[2026-05-22 20:26:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 73 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4890 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 262/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25012ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 25013ms
[2026-05-22 20:27:06] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2026-05-22 20:27:06] [INFO ] Invariant cache hit.
[2026-05-22 20:27:06] [INFO ] Implicit Places using invariants in 101 ms returned [13, 26]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 104 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 265/266 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25123 ms. Remains : 43/48 places, 265/266 transitions.
[2026-05-22 20:27:06] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:27:06] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:27:06] [INFO ] Input system was already deterministic with 265 transitions.
[2026-05-22 20:27:06] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:27:06] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:27:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12521867377252121837.gal : 2 ms
[2026-05-22 20:27:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality909559403295859556.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12521867377252121837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality909559403295859556.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,19.9223,495940,2,57587,5,794249,6,0,439,987797,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 20:27:36] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:27:36] [INFO ] Applying decomposition
[2026-05-22 20:27:36] [INFO ] Flatten gal took : 5 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/graph16616519993220460019.txt' '-o' '/tmp/graph16616519993220460019.bin' '-w' '/tmp/graph16616519993220460019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16616519993220460019.bin' '-l' '-1' '-v' '-w' '/tmp/graph16616519993220460019.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:27:36] [INFO ] Decomposing Gal with order
[2026-05-22 20:27:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:27:36] [INFO ] Removed a total of 523 redundant transitions.
[2026-05-22 20:27:36] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:27:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 3 ms.
[2026-05-22 20:27:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13090302471313886875.gal : 1 ms
[2026-05-22 20:27:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality13229426789675492086.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13090302471313886875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13229426789675492086.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,2.13005,62212,1744,970,49392,17519,150,285062,138,277838,0


Converting to forward existential form...Done !
original formula: EX(EF(EG(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t21, t22, t23, t54, t125, t134, t155, t164, i0.t144, i0.t135, i0.t53, i2.u0.t10, Interse...245
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-22 20:28:06] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:28:06] [INFO ] Flatten gal took : 4 ms
[2026-05-22 20:28:06] [INFO ] Applying decomposition
[2026-05-22 20:28:06] [INFO ] Flatten gal took : 5 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/graph10827745659533673587.txt' '-o' '/tmp/graph10827745659533673587.bin' '-w' '/tmp/graph10827745659533673587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10827745659533673587.bin' '-l' '-1' '-v' '-w' '/tmp/graph10827745659533673587.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:28:06] [INFO ] Decomposing Gal with order
[2026-05-22 20:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:28:06] [INFO ] Removed a total of 290 redundant transitions.
[2026-05-22 20:28:06] [INFO ] Flatten gal took : 123 ms
[2026-05-22 20:28:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 524 labels/synchronizations in 8 ms.
[2026-05-22 20:28:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9119672845954841057.gal : 3 ms
[2026-05-22 20:28:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13741538365529361453.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9119672845954841057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13741538365529361453.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,259556,10.7452,312188,2,97263,5,1.22759e+06,6,0,474,523513,0


Converting to forward existential form...Done !
original formula: EG(A(((gu2.VIDANGE_0+gu2.VIDANGE_1)<=(gu2.CHOIX_0+gu2.CHOIX_1)) U EF((gu1.ATTENTE_A<=gu1.ATTENTE_B))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(E(TRUE U (gu1.ATTENTE_A<=gu1.ATTENTE_B))) U (!(((gu2.VIDANGE_0+gu2.VIDANGE_1)<=(gu2.CHOIX_0+gu...278
Reverse transition relation is NOT exact ! Due to transitions gi2.gu0.t10, gi2.gu0.t23, t3, t21, t31, t54, t130, t251, Intersection with reachable at each...215
(forward)formula 0,1,165.754,3684840,1,0,231,1.6243e+07,12,42,1363,9.70178e+06,2
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

original formula: EX(EF(EG(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),EX(TRUE))] != FALSE
dead was empty
(forward)formula 1,0,175.209,3684840,1,0,231,1.6243e+07,12,42,1615,9.70178e+06,9
FORMULA BridgeAndVehicles-COL-V10P10N10-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 769572 ms.

BK_STOP 1779481864115

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

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