Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.1K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 05:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Mar 7 05:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 05:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 05:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 97K 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 FireWire-PT-08-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779803709295

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-26 13:55:11] [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-26 13:55:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 13:55:12] [INFO ] Load time of PNML (sax parser for PT used): 188 ms
[2026-05-26 13:55:12] [INFO ] Transformed 127 places.
[2026-05-26 13:55:12] [INFO ] Transformed 397 transitions.
[2026-05-26 13:55:12] [INFO ] Found NUPN structural information;
[2026-05-26 13:55:12] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
FORMULA FireWire-PT-08-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-08-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 339
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 124 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 124 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 124 transition count 330
Applied a total of 12 rules in 73 ms. Remains 124 /127 variables (removed 3) and now considering 330/344 (removed 14) transitions.
[2026-05-26 13:55:12] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12340753808312745073.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2037983940024679663.kers'
[2026-05-26 13:55:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12340753808312745073.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2037983940024679663.kers]
Normalized transition count is 303 out of 304 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 303 rows 124 cols 1033 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-26 13:55:12] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2037983940024679663.kers
Total runtime 4 ms.
[2026-05-26 13:55:12] [INFO ] Implicit Places using invariants in 500 ms returned []
[2026-05-26 13:55:12] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2026-05-26 13:55:12] [INFO ] Invariant cache hit.
[2026-05-26 13:55:13] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 13:55:13] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 1067 ms to find 0 implicit places.
Running 329 sub problems to find dead transitions.
[2026-05-26 13:55:13] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2026-05-26 13:55:13] [INFO ] Invariant cache hit.
[2026-05-26 13:55:13] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 303/427 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 1/428 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/428 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 329 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 182 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (OVERLAPS) 303/427 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 329/510 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/428 variables, and 510 constraints, problems are : Problem set: 0 solved, 329 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60653ms problems are : Problem set: 0 solved, 329 unsolved
Search for dead transitions found 0 dead transitions in 60683ms
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 330/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61915 ms. Remains : 124/127 places, 330/344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 330/330 (removed 0) transitions.
[2026-05-26 13:56:14] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2026-05-26 13:56:14] [INFO ] Invariant cache hit.
[2026-05-26 13:56:14] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-26 13:56:14] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2026-05-26 13:56:14] [INFO ] Invariant cache hit.
[2026-05-26 13:56:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 13:56:14] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 124/124 places, 330/330 transitions.
Support contains 51 out of 124 places after structural reductions.
[2026-05-26 13:56:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-26 13:56:14] [INFO ] Flatten gal took : 85 ms
FORMULA FireWire-PT-08-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 13:56:14] [INFO ] Flatten gal took : 41 ms
[2026-05-26 13:56:15] [INFO ] Input system was already deterministic with 330 transitions.
Support contains 46 out of 124 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (2235 resets) in 3000 ms. (13 steps per ms) remains 19/35 properties
BEST_FIRST walk for 4001 steps (63 resets) in 59 ms. (66 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (47 resets) in 45 ms. (86 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (58 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (50 resets) in 53 ms. (74 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (53 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (61 resets) in 45 ms. (87 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (43 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (71 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (52 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (64 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (56 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (53 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (70 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (60 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (55 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (55 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
[2026-05-26 13:56:16] [INFO ] Flow matrix only has 304 transitions (discarded 26 similar events)
[2026-05-26 13:56:16] [INFO ] Invariant cache hit.
[2026-05-26 13:56:16] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 88/121 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 303/424 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 3/427 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 1/428 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 175 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 88/121 variables, 7/8 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 303/424 variables, 121/133 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 42/175 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 17/192 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 2/194 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/194 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 3/427 variables, 3/197 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/427 variables, 1/198 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 0/198 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 1/428 variables, 1/199 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 1/200 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 200 constraints, problems are : Problem set: 1 solved, 18 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6325ms problems are : Problem set: 1 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 330/330 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 327
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 121 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 121 transition count 320
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 121 transition count 319
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 120 transition count 321
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 120 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 120 transition count 318
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 120 transition count 320
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 19 place count 119 transition count 318
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 119 transition count 316
Applied a total of 21 rules in 165 ms. Remains 119 /124 variables (removed 5) and now considering 316/330 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 119/124 places, 316/330 transitions.
RANDOM walk for 40000 steps (2226 resets) in 717 ms. (55 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (38 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (56 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (43 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (49 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (43 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (58 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (50 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (58 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (63 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (51 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (66 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (57 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (49 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (52 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (65 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (51 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 541216 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :17 out of 18
Probabilistic random walk after 541216 steps, saw 118019 distinct states, run finished after 3014 ms. (steps per millisecond=179 ) properties seen :17
[2026-05-26 13:56:26] [INFO ] Flow matrix only has 291 transitions (discarded 25 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18092788655100735439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11265305080578122361.kers'
[2026-05-26 13:56:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18092788655100735439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11265305080578122361.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 119 cols 991 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 13:56:26] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11265305080578122361.kers
Total runtime 2 ms.
[2026-05-26 13:56:26] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 291/407 variables, 116/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 43/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 3/410 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/410 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 172 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 112/116 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 291/407 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 43/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/410 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/410 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 410/410 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 316/316 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 308
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 308
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 115 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 114 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 114 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 113 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 113 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 112 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 112 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 111 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 111 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 110 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 110 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 109 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 109 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 108 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 108 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 107 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 107 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 106 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 106 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 105 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 105 transition count 282
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 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 104 transition count 281
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 102 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 102 transition count 281
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 102 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 101 transition count 278
Applied a total of 43 rules in 146 ms. Remains 101 /119 variables (removed 18) and now considering 278/316 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 101/119 places, 278/316 transitions.
RANDOM walk for 40000 steps (2295 resets) in 1337 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (580 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458314 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :0 out of 1
Probabilistic random walk after 1458314 steps, saw 310003 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
[2026-05-26 13:56:30] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-371232973212455961.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2385331376148018798.kers'
[2026-05-26 13:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-371232973212455961.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2385331376148018798.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 249 rows 99 cols 827 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-26 13:56:30] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2385331376148018798.kers
Total runtime 1 ms.
[2026-05-26 13:56:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/57 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/93 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 170/263 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 18/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/264 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 80/344 variables, 36/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/350 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/350 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/350 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/350 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/57 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 36/93 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 170/263 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/263 variables, 18/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/264 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 80/344 variables, 36/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/344 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/350 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/350 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/350 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 278/278 transitions.
Applied a total of 0 rules in 13 ms. Remains 101 /101 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 101/101 places, 278/278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 278/278 transitions.
Applied a total of 0 rules in 11 ms. Remains 101 /101 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2026-05-26 13:56:31] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2026-05-26 13:56:31] [INFO ] Invariant cache hit.
[2026-05-26 13:56:31] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 13:56:31] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2026-05-26 13:56:31] [INFO ] Invariant cache hit.
[2026-05-26 13:56:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:56:31] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2026-05-26 13:56:31] [INFO ] Redundant transitions in 31 ms returned []
Running 276 sub problems to find dead transitions.
[2026-05-26 13:56:31] [INFO ] Flow matrix only has 249 transitions (discarded 29 similar events)
[2026-05-26 13:56:31] [INFO ] Invariant cache hit.
[2026-05-26 13:56:31] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/349 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 0/350 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 157 constraints, problems are : Problem set: 0 solved, 276 unsolved in 28912 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 249/349 variables, 100/118 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 38/156 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 276/432 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/350 variables, and 434 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59140ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 59143ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59709 ms. Remains : 101/101 places, 278/278 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 101 vertex of which 29 / 101 are part of one of the 4 SCC in 4 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 126 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 75 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 75 transition count 148
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 8 place count 74 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 74 transition count 146
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 11 place count 73 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 72 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 72 transition count 124
Free-agglomeration rule applied 3 times with reduction of 2 identical transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 72 transition count 119
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 69 transition count 118
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 69 transition count 118
Applied a total of 22 rules in 52 ms. Remains 69 /101 variables (removed 32) and now considering 118/278 (removed 160) transitions.
Running SMT prover for 1 properties.
[2026-05-26 13:57:31] [INFO ] Flow matrix only has 116 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8720530721943842152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5218368551793820289.kers'
[2026-05-26 13:57:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8720530721943842152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5218368551793820289.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 116 rows 67 cols 411 entries
Finished phase 1 with 61 SingleSign rule and 0 generalized
[2026-05-26 13:57:31] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5218368551793820289.kers
Total runtime 2 ms.
[2026-05-26 13:57:31] [INFO ] [Real]Absence check using 8 positive place invariants in 40 ms returned sat
[2026-05-26 13:57:31] [INFO ] After 111ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-26 13:57:31] [INFO ] After 135ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2026-05-26 13:57:31] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA FireWire-PT-08-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 13:57:31] [INFO ] Flatten gal took : 41 ms
[2026-05-26 13:57:31] [INFO ] Flatten gal took : 43 ms
[2026-05-26 13:57:31] [INFO ] Input system was already deterministic with 330 transitions.
Computed a total of 21 stabilizing places and 43 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 312
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 1 with 2 rules applied. Total rules applied 18 place count 116 transition count 311
Applied a total of 18 rules in 30 ms. Remains 116 /124 variables (removed 8) and now considering 311/330 (removed 19) transitions.
[2026-05-26 13:57:31] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13717601681877258748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3291297964228170967.kers'
[2026-05-26 13:57:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13717601681877258748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3291297964228170967.kers]
Normalized transition count is 284 out of 285 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 116 cols 963 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-26 13:57:31] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3291297964228170967.kers
Total runtime 2 ms.
[2026-05-26 13:57:31] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-26 13:57:31] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2026-05-26 13:57:31] [INFO ] Invariant cache hit.
[2026-05-26 13:57:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 13:57:32] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2026-05-26 13:57:32] [INFO ] Redundant transitions in 5 ms returned []
Running 310 sub problems to find dead transitions.
[2026-05-26 13:57:32] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2026-05-26 13:57:32] [INFO ] Invariant cache hit.
[2026-05-26 13:57:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 172 constraints, problems are : Problem set: 0 solved, 310 unsolved in 26609 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/400 variables, 116/131 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 310/481 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/401 variables, and 481 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 116/116 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56717ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 56719ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/124 places, 311/330 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57617 ms. Remains : 116/124 places, 311/330 transitions.
[2026-05-26 13:58:29] [INFO ] Flatten gal took : 29 ms
[2026-05-26 13:58:29] [INFO ] Flatten gal took : 32 ms
[2026-05-26 13:58:29] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-26 13:58:29] [INFO ] Flatten gal took : 20 ms
[2026-05-26 13:58:29] [INFO ] Flatten gal took : 19 ms
[2026-05-26 13:58:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality10972219058581995722.gal : 18 ms
[2026-05-26 13:58:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4269144292833022735.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10972219058581995722.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4269144292833022735.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,9.99816e+06,1.75787,35152,2,2581,5,117704,6,0,774,109329,0


Converting to forward existential form...Done !
original formula: EG((EF(((p46==0)||(p116==1))) * (A((((p37==0)||(p71==1))||((p15==0)||(p2==1))) U (p14!=1)) + (p125==0))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((p46==0)||(p116==1))) * (!((E(!((p14!=1)) U (!((((p37==0)||(p71==1))||((p15==0)||(p2==1)))...217
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...667
Detected timeout of ITS tools.
[2026-05-26 13:58:59] [INFO ] Flatten gal took : 29 ms
[2026-05-26 13:58:59] [INFO ] Applying decomposition
[2026-05-26 13:58:59] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14581074887345804427.txt' '-o' '/tmp/graph14581074887345804427.bin' '-w' '/tmp/graph14581074887345804427.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14581074887345804427.bin' '-l' '-1' '-v' '-w' '/tmp/graph14581074887345804427.weights' '-q' '0' '-e' '0.001'
[2026-05-26 13:58:59] [INFO ] Decomposing Gal with order
[2026-05-26 13:58:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 13:58:59] [INFO ] Removed a total of 484 redundant transitions.
[2026-05-26 13:59:00] [INFO ] Flatten gal took : 118 ms
[2026-05-26 13:59:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 23 ms.
[2026-05-26 13:59:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11158531468559687292.gal : 11 ms
[2026-05-26 13:59:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality16160385882252433513.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/CTLCardinality11158531468559687292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16160385882252433513.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,9.99816e+06,11.5256,298976,1575,199,295190,9587,634,2.50023e+06,89,66701,0


Converting to forward existential form...Done !
original formula: EG((EF(((i1.i0.u14.p46==0)||(i0.u39.p116==1))) * (A((((i1.i0.u12.p37==0)||(i4.i0.u21.p71==1))||((i1.i2.u5.p15==0)||(i0.u0.p2==1))) U (i1....193
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((i1.i0.u14.p46==0)||(i0.u39.p116==1))) * (!((E(!((i1.i2.u4.p14!=1)) U (!((((i1.i0.u12.p37=...305
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t69, t74, t79, t91, t92, t93, t94, t97, t99, t140, t142, t1...824
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 107 transition count 288
Applied a total of 37 rules in 15 ms. Remains 107 /124 variables (removed 17) and now considering 288/330 (removed 42) transitions.
[2026-05-26 13:59:30] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15789920895367221639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8219755324129044555.kers'
[2026-05-26 13:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15789920895367221639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8219755324129044555.kers]
Normalized transition count is 261 out of 262 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 107 cols 875 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 13:59:30] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8219755324129044555.kers
Total runtime 1 ms.
[2026-05-26 13:59:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-26 13:59:30] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 13:59:30] [INFO ] Invariant cache hit.
[2026-05-26 13:59:30] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 13:59:30] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-26 13:59:30] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 13:59:30] [INFO ] Invariant cache hit.
[2026-05-26 13:59:30] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 28380 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 445 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58506ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 58508ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58946 ms. Remains : 107/124 places, 288/330 transitions.
[2026-05-26 14:00:29] [INFO ] Flatten gal took : 17 ms
[2026-05-26 14:00:29] [INFO ] Flatten gal took : 17 ms
[2026-05-26 14:00:29] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 14:00:29] [INFO ] Flatten gal took : 16 ms
[2026-05-26 14:00:29] [INFO ] Flatten gal took : 15 ms
[2026-05-26 14:00:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2583020951426697666.gal : 4 ms
[2026-05-26 14:00:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4650983235075423070.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/CTLCardinality2583020951426697666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4650983235075423070.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,1.13746e+07,7.45535,162900,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: (EX(EF((p43==1))) * EX((AG((p2==0)) + AG(((p20!=0)&&(p28!=1))))))
=> equivalent forward existential formula: ([(EY((Init * EX(E(TRUE U (p43==1))))) * !(E(TRUE U !((p2==0)))))] != FALSE + [(EY((Init * EX(E(TRUE U (p43==1))...209
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
Detected timeout of ITS tools.
[2026-05-26 14:00:59] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:00:59] [INFO ] Applying decomposition
[2026-05-26 14:00:59] [INFO ] Flatten gal took : 11 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/graph9694293733791370990.txt' '-o' '/tmp/graph9694293733791370990.bin' '-w' '/tmp/graph9694293733791370990.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9694293733791370990.bin' '-l' '-1' '-v' '-w' '/tmp/graph9694293733791370990.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:00:59] [INFO ] Decomposing Gal with order
[2026-05-26 14:00:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:00:59] [INFO ] Removed a total of 437 redundant transitions.
[2026-05-26 14:00:59] [INFO ] Flatten gal took : 30 ms
[2026-05-26 14:00:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 15 ms.
[2026-05-26 14:00:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality1365619975789533132.gal : 6 ms
[2026-05-26 14:00:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality9321483266974864358.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/CTLCardinality1365619975789533132.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9321483266974864358.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,1.13746e+07,12.096,264096,2254,219,394175,11054,616,1.30476e+06,87,56160,0


Converting to forward existential form...Done !
original formula: (EX(EF((i0.i0.u13.p43==1))) * EX((AG((i0.i0.u0.p2==0)) + AG(((i0.i0.u7.p20!=0)&&(i2.u9.p28!=1))))))
=> equivalent forward existential formula: ([(EY((Init * EX(E(TRUE U (i0.i0.u13.p43==1))))) * !(E(TRUE U !((i0.i0.u0.p2==0)))))] != FALSE + [(EY((Init * EX...253
Reverse transition relation is NOT exact ! Due to transitions t42, t44, t48, t49, t51, t57, t59, t82, t91, t92, t93, t94, t99, t140, t142, t164, t193, t200...861
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 312
Applied a total of 16 rules in 4 ms. Remains 117 /124 variables (removed 7) and now considering 312/330 (removed 18) transitions.
[2026-05-26 14:01:29] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4038377842685204201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13843447247798845413.kers'
[2026-05-26 14:01:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4038377842685204201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13843447247798845413.kers]
Normalized transition count is 285 out of 286 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 285 rows 117 cols 965 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-26 14:01:29] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13843447247798845413.kers
Total runtime 2 ms.
[2026-05-26 14:01:29] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-26 14:01:29] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2026-05-26 14:01:29] [INFO ] Invariant cache hit.
[2026-05-26 14:01:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 14:01:30] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Running 311 sub problems to find dead transitions.
[2026-05-26 14:01:30] [INFO ] Flow matrix only has 286 transitions (discarded 26 similar events)
[2026-05-26 14:01:30] [INFO ] Invariant cache hit.
[2026-05-26 14:01:30] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 173 constraints, problems are : Problem set: 0 solved, 311 unsolved in 28073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 311/483 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/403 variables, and 483 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58185ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 58187ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 312/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58685 ms. Remains : 117/124 places, 312/330 transitions.
[2026-05-26 14:02:28] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:02:28] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:02:28] [INFO ] Input system was already deterministic with 312 transitions.
[2026-05-26 14:02:28] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:02:28] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:02:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6106728293599118308.gal : 4 ms
[2026-05-26 14:02:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality15133281165141802818.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/CTLCardinality6106728293599118308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15133281165141802818.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,1.17933e+07,0.937667,23812,2,2488,5,74405,6,0,779,60238,0


Converting to forward existential form...Done !
original formula: (EF((AG((p116==0)) * EX(TRUE))) + EX((p72==1)))
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * !(E(TRUE U !((p116==0)))))) * TRUE)] != FALSE + [(EY(Init) * (p72==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...673
(forward)formula 0,1,5.77799,133932,1,0,654,687882,643,332,6547,501897,740
FORMULA FireWire-PT-08-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 107 transition count 288
Applied a total of 37 rules in 23 ms. Remains 107 /124 variables (removed 17) and now considering 288/330 (removed 42) transitions.
[2026-05-26 14:02:34] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10899837332712579998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13900640261109067015.kers'
[2026-05-26 14:02:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10899837332712579998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13900640261109067015.kers]
Normalized transition count is 261 out of 262 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 107 cols 875 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 14:02:34] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13900640261109067015.kers
Total runtime 1 ms.
[2026-05-26 14:02:34] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-26 14:02:34] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:02:34] [INFO ] Invariant cache hit.
[2026-05-26 14:02:34] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:02:34] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-26 14:02:34] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:02:34] [INFO ] Invariant cache hit.
[2026-05-26 14:02:34] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 28425 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 445 constraints, problems are : Problem set: 0 solved, 287 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58561ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 58563ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59033 ms. Remains : 107/124 places, 288/330 transitions.
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 12 ms
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:03:33] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 13 ms
[2026-05-26 14:03:33] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:03:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality4555794857268499014.gal : 4 ms
[2026-05-26 14:03:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality3441233009292691334.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/CTLCardinality4555794857268499014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3441233009292691334.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,1.13746e+07,7.2744,162520,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,7.28412,162520,1,0,6,443377,7,1,1102,562005,1
FORMULA FireWire-PT-08-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 107 transition count 288
Applied a total of 37 rules in 22 ms. Remains 107 /124 variables (removed 17) and now considering 288/330 (removed 42) transitions.
[2026-05-26 14:03:40] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:03:40] [INFO ] Invariant cache hit.
[2026-05-26 14:03:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-26 14:03:40] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:03:40] [INFO ] Invariant cache hit.
[2026-05-26 14:03:40] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:03:40] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 107/124 places, 288/330 transitions.
[2026-05-26 14:03:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:03:40] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:03:41] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 14:03:41] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:03:41] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:03:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7416580995685955844.gal : 17 ms
[2026-05-26 14:03:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality17203831439151323896.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/CTLCardinality7416580995685955844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17203831439151323896.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,1.13746e+07,7.06452,162456,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: EX(EF((p19==1)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * (p19==1))] != FALSE
(forward)formula 0,1,12.4136,162508,1,0,9,446103,9,1,1482,565267,4
FORMULA FireWire-PT-08-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 320
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 320
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 119 transition count 317
Applied a total of 13 rules in 5 ms. Remains 119 /124 variables (removed 5) and now considering 317/330 (removed 13) transitions.
[2026-05-26 14:03:53] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-976442272366514045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-520625700614041176.kers'
[2026-05-26 14:03:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-976442272366514045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-520625700614041176.kers]
Normalized transition count is 290 out of 291 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 119 cols 981 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 14:03:53] [INFO ] Computed 8 invariants in 5 ms
Computed 8 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-520625700614041176.kers
Total runtime 6 ms.
[2026-05-26 14:03:53] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-26 14:03:53] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2026-05-26 14:03:53] [INFO ] Invariant cache hit.
[2026-05-26 14:03:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-26 14:03:54] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2026-05-26 14:03:54] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2026-05-26 14:03:54] [INFO ] Invariant cache hit.
[2026-05-26 14:03:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (OVERLAPS) 1/410 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/410 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 410/410 variables, and 177 constraints, problems are : Problem set: 0 solved, 316 unsolved in 29630 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 290/409 variables, 119/134 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/409 variables, 42/176 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 316/492 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/410 variables, and 493 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 119/119 constraints, ReadFeed: 42/43 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59779ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 59781ms
Starting structural reductions in LTL mode, iteration 1 : 119/124 places, 317/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60514 ms. Remains : 119/124 places, 317/330 transitions.
[2026-05-26 14:04:54] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:04:54] [INFO ] Flatten gal took : 16 ms
[2026-05-26 14:04:54] [INFO ] Input system was already deterministic with 317 transitions.
[2026-05-26 14:04:54] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:04:54] [INFO ] Flatten gal took : 14 ms
[2026-05-26 14:04:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13049553048915731294.gal : 4 ms
[2026-05-26 14:04:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality8871520602058551063.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/CTLCardinality13049553048915731294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8871520602058551063.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,1.22144e+07,0.855153,19752,2,2351,5,60070,6,0,792,52034,0


Converting to forward existential form...Done !
original formula: (EX(((p56==1) * !(E(AF((p62==1)) U AG((p30==0)))))) + AG(AF(E(E((p5==0) U (p57==1)) U ((p77==0)||(p35==0))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX(((p56==1) * !(E(!(EG(!((p62==1)))) U !(E(TRUE U !((p30==0)))))))))),TRUE),!(E(E((p5==0) ...201
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...690
Detected timeout of ITS tools.
[2026-05-26 14:05:24] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:05:24] [INFO ] Applying decomposition
[2026-05-26 14:05:24] [INFO ] Flatten gal took : 8 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/graph9978848231193622931.txt' '-o' '/tmp/graph9978848231193622931.bin' '-w' '/tmp/graph9978848231193622931.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9978848231193622931.bin' '-l' '-1' '-v' '-w' '/tmp/graph9978848231193622931.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:05:24] [INFO ] Decomposing Gal with order
[2026-05-26 14:05:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:05:24] [INFO ] Removed a total of 475 redundant transitions.
[2026-05-26 14:05:24] [INFO ] Flatten gal took : 24 ms
[2026-05-26 14:05:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 22 ms.
[2026-05-26 14:05:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality1431110103728428949.gal : 5 ms
[2026-05-26 14:05:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1939319208161901237.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/CTLCardinality1431110103728428949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1939319208161901237.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,1.22144e+07,13.7954,354628,1907,256,387222,11158,663,2.7253e+06,110,90407,0


Converting to forward existential form...Done !
original formula: (EX(((i3.u19.p56==1) * !(E(AF((i4.u21.p62==1)) U AG((i2.u10.p30==0)))))) + AG(AF(E(E((i1.i0.u1.p5==0) U (i3.u18.p57==1)) U ((i0.u0.p77==0...178
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX(((i3.u19.p56==1) * !(E(!(EG(!((i4.u21.p62==1)))) U !(E(TRUE U !((i2.u10.p30==0))))))))))...251
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t68, t69, t74, t79, t91, t92, t93, t94, t97, t99, t140, t14...913
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
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 117 transition count 316
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 117 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 117 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 39 place count 105 transition count 286
Applied a total of 39 rules in 72 ms. Remains 105 /124 variables (removed 19) and now considering 286/330 (removed 44) transitions.
[2026-05-26 14:05:54] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8364899961131695455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-379398126314697996.kers'
[2026-05-26 14:05:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8364899961131695455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-379398126314697996.kers]
Normalized transition count is 259 out of 260 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 259 rows 103 cols 855 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-26 14:05:54] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-379398126314697996.kers
Total runtime 8 ms.
[2026-05-26 14:05:54] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-26 14:05:54] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:05:54] [INFO ] Invariant cache hit.
[2026-05-26 14:05:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 14:05:55] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2026-05-26 14:05:55] [INFO ] Redundant transitions in 6 ms returned []
Running 283 sub problems to find dead transitions.
[2026-05-26 14:05:55] [INFO ] Flow matrix only has 260 transitions (discarded 26 similar events)
[2026-05-26 14:05:55] [INFO ] Invariant cache hit.
[2026-05-26 14:05:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (OVERLAPS) 1/364 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 364/365 variables, and 158 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 259/363 variables, 104/121 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 36/157 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 283/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 1/364 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/365 variables, and 441 constraints, problems are : Problem set: 0 solved, 283 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in SI_CTL mode, iteration 1 : 105/124 places, 286/330 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60743 ms. Remains : 105/124 places, 286/330 transitions.
[2026-05-26 14:06:55] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:06:55] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:06:55] [INFO ] Input system was already deterministic with 286 transitions.
[2026-05-26 14:06:55] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:06:55] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:06:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3274231680551213885.gal : 4 ms
[2026-05-26 14:06:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality13294513254274781972.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/CTLCardinality3274231680551213885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13294513254274781972.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,9.2827e+06,5.91717,107036,2,5120,5,297236,6,0,705,383219,0


Converting to forward existential form...Done !
original formula: EF(EG(E((p3==1) U !(EF((p98==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E((p3==1) U !(E(TRUE U (p98==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t10, t11, t13, t14, t15, t17, t19, t23, t24, t26, t27, t28, t30, t32, t36...612
Detected timeout of ITS tools.
[2026-05-26 14:07:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:07:25] [INFO ] Applying decomposition
[2026-05-26 14:07:25] [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/graph5904981162946612255.txt' '-o' '/tmp/graph5904981162946612255.bin' '-w' '/tmp/graph5904981162946612255.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5904981162946612255.bin' '-l' '-1' '-v' '-w' '/tmp/graph5904981162946612255.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:07:25] [INFO ] Decomposing Gal with order
[2026-05-26 14:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:07:25] [INFO ] Removed a total of 436 redundant transitions.
[2026-05-26 14:07:25] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 8 ms.
[2026-05-26 14:07:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7670845068449507714.gal : 3 ms
[2026-05-26 14:07:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16140087584267639294.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/CTLCardinality7670845068449507714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16140087584267639294.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 118 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 116 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 290
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 1 with 2 rules applied. Total rules applied 36 place count 106 transition count 289
Applied a total of 36 rules in 34 ms. Remains 106 /124 variables (removed 18) and now considering 289/330 (removed 41) transitions.
[2026-05-26 14:07:55] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1348112024750541147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12826204887018746896.kers'
[2026-05-26 14:07:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1348112024750541147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12826204887018746896.kers]
Normalized transition count is 262 out of 263 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 262 rows 104 cols 867 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 14:07:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12826204887018746896.kers
Total runtime 2 ms.
[2026-05-26 14:07:55] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-26 14:07:55] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2026-05-26 14:07:55] [INFO ] Invariant cache hit.
[2026-05-26 14:07:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-26 14:07:55] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2026-05-26 14:07:55] [INFO ] Redundant transitions in 2 ms returned []
Running 286 sub problems to find dead transitions.
[2026-05-26 14:07:55] [INFO ] Flow matrix only has 263 transitions (discarded 26 similar events)
[2026-05-26 14:07:55] [INFO ] Invariant cache hit.
[2026-05-26 14:07:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/119 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 36/155 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 1/368 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 0/368 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/369 variables, and 157 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 262/367 variables, 105/120 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 36/156 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/367 variables, 286/442 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 8 (OVERLAPS) 1/368 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 286 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 445 constraints, problems are : Problem set: 0 solved, 286 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/124 places, 289/330 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60475 ms. Remains : 106/124 places, 289/330 transitions.
[2026-05-26 14:08:56] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:08:56] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:08:56] [INFO ] Input system was already deterministic with 289 transitions.
[2026-05-26 14:08:56] [INFO ] Flatten gal took : 11 ms
[2026-05-26 14:08:56] [INFO ] Flatten gal took : 10 ms
[2026-05-26 14:08:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13682842215083291527.gal : 4 ms
[2026-05-26 14:08:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality590567267725802763.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/CTLCardinality13682842215083291527.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality590567267725802763.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,9.46946e+06,5.21791,110428,2,5184,5,307529,6,0,712,396096,0


Converting to forward existential form...Done !
original formula: EF(EG((p72==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p72==1))] != FALSE
Hit Full ! (commute/partial/dont) 286/0/3
(forward)formula 0,1,6.22443,110428,1,0,11,307529,19,3,4166,396096,8
FORMULA FireWire-PT-08-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 119 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 118 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 118 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 117 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 117 transition count 311
Applied a total of 17 rules in 5 ms. Remains 117 /124 variables (removed 7) and now considering 311/330 (removed 19) transitions.
[2026-05-26 14:09:02] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10735533600345974434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8982235705669529133.kers'
[2026-05-26 14:09:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10735533600345974434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8982235705669529133.kers]
Normalized transition count is 284 out of 285 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 284 rows 117 cols 961 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-26 14:09:02] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8982235705669529133.kers
Total runtime 1 ms.
[2026-05-26 14:09:02] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-26 14:09:02] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2026-05-26 14:09:02] [INFO ] Invariant cache hit.
[2026-05-26 14:09:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-26 14:09:02] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Running 310 sub problems to find dead transitions.
[2026-05-26 14:09:02] [INFO ] Flow matrix only has 285 transitions (discarded 26 similar events)
[2026-05-26 14:09:02] [INFO ] Invariant cache hit.
[2026-05-26 14:09:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/401 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 173 constraints, problems are : Problem set: 0 solved, 310 unsolved in 29077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 284/401 variables, 117/132 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 310/482 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/402 variables, and 483 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 40/41 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59182ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 59184ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 311/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59675 ms. Remains : 117/124 places, 311/330 transitions.
[2026-05-26 14:10:02] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:10:02] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:10:02] [INFO ] Input system was already deterministic with 311 transitions.
[2026-05-26 14:10:02] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:10:02] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:10:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality9396313443260302151.gal : 2 ms
[2026-05-26 14:10:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality8546236821877025223.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/CTLCardinality9396313443260302151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8546236821877025223.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,1.21573e+07,1.68836,47996,2,2516,5,165980,6,0,778,152795,0


Converting to forward existential form...Done !
original formula: ((!(A(EF((A(((p79==0)||(p101==1)) U (p82==0)) + AF((p94==0)))) U A((p51==0) U (p64==1)))) * EF(AG(((AX((p93==0)) * (p45==0)) * ((p42==0)&...230
=> equivalent forward existential formula: ([(FwdU((Init * (!(!((E(!(!((E(!((p64==1)) U (!((p51==0)) * !((p64==1)))) + EG(!((p64==1)))))) U (!(E(TRUE U (!(...1089
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...666
Detected timeout of ITS tools.
[2026-05-26 14:10:32] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:10:32] [INFO ] Applying decomposition
[2026-05-26 14:10:32] [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/graph13532444953406334854.txt' '-o' '/tmp/graph13532444953406334854.bin' '-w' '/tmp/graph13532444953406334854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13532444953406334854.bin' '-l' '-1' '-v' '-w' '/tmp/graph13532444953406334854.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:10:32] [INFO ] Decomposing Gal with order
[2026-05-26 14:10:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:10:32] [INFO ] Removed a total of 482 redundant transitions.
[2026-05-26 14:10:32] [INFO ] Flatten gal took : 25 ms
[2026-05-26 14:10:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 8 ms.
[2026-05-26 14:10:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality13726911979475738747.gal : 3 ms
[2026-05-26 14:10:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6522872027396127550.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/CTLCardinality13726911979475738747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6522872027396127550.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 -...263
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,1.21573e+07,1.13979,36488,926,145,58700,993,591,140280,88,6201,0


Converting to forward existential form...Done !
original formula: ((!(A(EF((A(((i0.u1.p79==0)||(i6.u35.p101==1)) U (i0.u28.p82==0)) + AF((i4.u32.p94==0)))) U A((i3.u18.p51==0) U (i4.u21.p64==1)))) * EF(A...326
=> equivalent forward existential formula: ([(FwdU((Init * (!(!((E(!(!((E(!((i4.u21.p64==1)) U (!((i3.u18.p51==0)) * !((i4.u21.p64==1)))) + EG(!((i4.u21.p6...1436
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t64, t68, t69, t74, t79, t83, t87, t91, t92, t93, t94,...821
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,19.0484,481244,1,0,775194,3323,3697,2.41013e+06,409,17440,1419254
FORMULA FireWire-PT-08-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 117 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 117 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 115 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 115 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 113 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 113 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 111 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 111 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 108 transition count 290
Applied a total of 35 rules in 36 ms. Remains 108 /124 variables (removed 16) and now considering 290/330 (removed 40) transitions.
[2026-05-26 14:10:51] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3765226618052970580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7186274572881571892.kers'
[2026-05-26 14:10:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3765226618052970580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7186274572881571892.kers]
Normalized transition count is 263 out of 264 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 108 cols 883 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 14:10:51] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7186274572881571892.kers
Total runtime 1 ms.
[2026-05-26 14:10:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-26 14:10:51] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 14:10:51] [INFO ] Invariant cache hit.
[2026-05-26 14:10:51] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:10:51] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2026-05-26 14:10:51] [INFO ] Redundant transitions in 2 ms returned []
Running 289 sub problems to find dead transitions.
[2026-05-26 14:10:51] [INFO ] Flow matrix only has 264 transitions (discarded 26 similar events)
[2026-05-26 14:10:51] [INFO ] Invariant cache hit.
[2026-05-26 14:10:51] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/371 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 1/372 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 161 constraints, problems are : Problem set: 0 solved, 289 unsolved in 24517 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 263/371 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 289/449 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/372 variables, and 449 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 37/38 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54590ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 54591ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/124 places, 290/330 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54991 ms. Remains : 108/124 places, 290/330 transitions.
[2026-05-26 14:11:46] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:11:46] [INFO ] Flatten gal took : 8 ms
[2026-05-26 14:11:46] [INFO ] Input system was already deterministic with 290 transitions.
[2026-05-26 14:11:46] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:11:46] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:11:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality5282671018131074897.gal : 2 ms
[2026-05-26 14:11:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality9496935223980247785.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/CTLCardinality5282671018131074897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9496935223980247785.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,1.16804e+07,8.30011,178172,2,6344,5,491263,6,0,721,685464,0


Converting to forward existential form...Done !
original formula: EF((EG(AG((p38==1))) * !(A(AG((p64==1)) U ((((p42==0)||(p89==1))&&(p69==1))||(p108!=1))))))
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * EG(!(E(TRUE U !((p38==1)))))),!(((((p42==0)||(p89==1))&&(p69==1))||(p108!=1))))...356
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...618
Detected timeout of ITS tools.
[2026-05-26 14:12:16] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:12:16] [INFO ] Applying decomposition
[2026-05-26 14:12:16] [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/graph754153899077433434.txt' '-o' '/tmp/graph754153899077433434.bin' '-w' '/tmp/graph754153899077433434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph754153899077433434.bin' '-l' '-1' '-v' '-w' '/tmp/graph754153899077433434.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:12:16] [INFO ] Decomposing Gal with order
[2026-05-26 14:12:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:12:16] [INFO ] Removed a total of 441 redundant transitions.
[2026-05-26 14:12:16] [INFO ] Flatten gal took : 18 ms
[2026-05-26 14:12:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 6 ms.
[2026-05-26 14:12:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6287376200267302298.gal : 3 ms
[2026-05-26 14:12:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality2367869087191853227.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/CTLCardinality6287376200267302298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2367869087191853227.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,1.16804e+07,5.31072,122592,1826,171,188130,1818,602,589233,87,14307,0


Converting to forward existential form...Done !
original formula: EF((EG(AG((i3.u12.p38==1))) * !(A(AG((i4.u20.p64==1)) U ((((i1.i0.u14.p42==0)||(i6.u34.p89==1))&&(i5.i0.u21.p69==1))||(i6.u35.p108!=1))))...157
=> equivalent forward existential formula: ([(FwdU((FwdU((FwdU(Init,TRUE) * EG(!(E(TRUE U !((i3.u12.p38==1)))))),!(((((i1.i0.u14.p42==0)||(i6.u34.p89==1))&...479
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t48, t49, t51, t59, t64, t69, t74, t79, t82, t94, t99, t136, t137, t138, t140, ...811
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,19.1512,386868,1,0,543456,5521,3564,2.215e+06,407,34384,960838
FORMULA FireWire-PT-08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 118 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 118 transition count 317
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 118 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 107 transition count 288
Applied a total of 37 rules in 13 ms. Remains 107 /124 variables (removed 17) and now considering 288/330 (removed 42) transitions.
[2026-05-26 14:12:35] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5971098748676137879.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10506283069992150783.kers'
[2026-05-26 14:12:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5971098748676137879.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10506283069992150783.kers]
Normalized transition count is 261 out of 262 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 107 cols 875 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 14:12:35] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10506283069992150783.kers
Total runtime 2 ms.
[2026-05-26 14:12:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-26 14:12:35] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:12:35] [INFO ] Invariant cache hit.
[2026-05-26 14:12:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:12:36] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2026-05-26 14:12:36] [INFO ] Flow matrix only has 262 transitions (discarded 26 similar events)
[2026-05-26 14:12:36] [INFO ] Invariant cache hit.
[2026-05-26 14:12:36] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 287 unsolved in 28594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 261/368 variables, 107/121 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 37/158 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 287/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 287 unsolved
SMT process timed out in 58702ms, After SMT, problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 58704ms
Starting structural reductions in LTL mode, iteration 1 : 107/124 places, 288/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59176 ms. Remains : 107/124 places, 288/330 transitions.
[2026-05-26 14:13:35] [INFO ] Flatten gal took : 9 ms
[2026-05-26 14:13:35] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:13:35] [INFO ] Input system was already deterministic with 288 transitions.
[2026-05-26 14:13:35] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:13:35] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:13:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality13917312967741029993.gal : 1 ms
[2026-05-26 14:13:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality15318348271266714630.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/CTLCardinality13917312967741029993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15318348271266714630.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,1.13746e+07,7.48709,162388,2,6093,5,443377,6,0,715,562005,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,7.49723,162388,1,0,6,443377,7,1,1102,562005,1
FORMULA FireWire-PT-08-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 330/330 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 119 transition count 317
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 291
Applied a total of 34 rules in 13 ms. Remains 108 /124 variables (removed 16) and now considering 291/330 (removed 39) transitions.
[2026-05-26 14:13:42] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-747984518439395504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3762606693312642810.kers'
[2026-05-26 14:13:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-747984518439395504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3762606693312642810.kers]
Normalized transition count is 264 out of 265 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 108 cols 887 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 14:13:42] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3762606693312642810.kers
Total runtime 2 ms.
[2026-05-26 14:13:42] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-26 14:13:42] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 14:13:42] [INFO ] Invariant cache hit.
[2026-05-26 14:13:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2026-05-26 14:13:42] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2026-05-26 14:13:42] [INFO ] Flow matrix only has 265 transitions (discarded 26 similar events)
[2026-05-26 14:13:42] [INFO ] Invariant cache hit.
[2026-05-26 14:13:42] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/373 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 161 constraints, problems are : Problem set: 0 solved, 290 unsolved in 23889 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (OVERLAPS) 264/372 variables, 108/123 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 37/160 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 290/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/373 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 451 constraints, problems are : Problem set: 0 solved, 290 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53968ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 53969ms
Starting structural reductions in LTL mode, iteration 1 : 108/124 places, 291/330 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54350 ms. Remains : 108/124 places, 291/330 transitions.
[2026-05-26 14:14:36] [INFO ] Flatten gal took : 5 ms
[2026-05-26 14:14:36] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:14:36] [INFO ] Input system was already deterministic with 291 transitions.
[2026-05-26 14:14:37] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:14:37] [INFO ] Flatten gal took : 6 ms
[2026-05-26 14:14:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality8873665814338116833.gal : 1 ms
[2026-05-26 14:14:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6291705619763930743.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/CTLCardinality8873665814338116833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6291705619763930743.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,1.20233e+07,8.70319,181596,2,6350,5,511453,6,0,722,674894,0


Converting to forward existential form...Done !
original formula: EF((EX(TRUE) * AG(((p39==1)||(p38==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(TRUE)) * !(E(TRUE U !(((p39==1)||(p38==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t6, t7, t11, t12, t14, t15, t16, t18, t20, t24, t25, t27, t28, t29, t31, t33, t37...624
(forward)formula 0,1,15.7674,226740,1,0,540,1.11509e+06,601,277,6212,982313,611
FORMULA FireWire-PT-08-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-26 14:14:52] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:14:52] [INFO ] Flatten gal took : 7 ms
[2026-05-26 14:14:52] [INFO ] Applying decomposition
[2026-05-26 14:14:52] [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/graph13138484842471426594.txt' '-o' '/tmp/graph13138484842471426594.bin' '-w' '/tmp/graph13138484842471426594.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13138484842471426594.bin' '-l' '-1' '-v' '-w' '/tmp/graph13138484842471426594.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:14:52] [INFO ] Decomposing Gal with order
[2026-05-26 14:14:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:14:52] [INFO ] Removed a total of 522 redundant transitions.
[2026-05-26 14:14:52] [INFO ] Flatten gal took : 21 ms
[2026-05-26 14:14:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 6 ms.
[2026-05-26 14:14:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5946488447285253384.gal : 3 ms
[2026-05-26 14:14:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality2824116924347783671.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/CTLCardinality5946488447285253384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2824116924347783671.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 4 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,1.42699e+07,7.39462,157940,1760,116,237766,2431,623,731579,88,15651,0


Converting to forward existential form...Done !
original formula: EG((EF(((i1.u15.p46==0)||(i0.u39.p116==1))) * (A((((i1.u12.p37==0)||(i6.i0.u22.p71==1))||((i1.u7.p15==0)||(i0.u0.p2==1))) U (i3.u4.p14!=1...178
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((i1.u15.p46==0)||(i0.u39.p116==1))) * (!((E(!((i3.u4.p14!=1)) U (!((((i1.u12.p37==0)||(i6....284
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t44, t45, t48, t49, t51, t59, t60, t64, t69, t74, t79, t83, t94, t97, t99, t138, t13...883
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,15.5273,245644,1,0,361401,2431,3290,1.04698e+06,353,15651,793131
FORMULA FireWire-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(EF((i1.u14.p43==1))) * EX((AG((i0.u0.p2==0)) + AG(((i1.u6.p20!=0)&&(i3.u9.p28!=1))))))
=> equivalent forward existential formula: ([(EY((Init * EX(E(TRUE U (i1.u14.p43==1))))) * !(E(TRUE U !((i0.u0.p2==0)))))] != FALSE + [(EY((Init * EX(E(TRU...241
(forward)formula 1,0,24.3927,444704,1,0,665885,2431,3303,1.82767e+06,354,15651,1417739
FORMULA FireWire-PT-08-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(((i4.u19.p56==1) * !(E(AF((i6.i0.u21.p62==1)) U AG((i3.u10.p30==0)))))) + AG(AF(E(E((i1.u1.p5==0) U (i4.u18.p57==1)) U ((i0.u25.p77==...179
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(EX(((i4.u19.p56==1) * !(E(!(EG(!((i6.i0.u21.p62==1)))) U !(E(TRUE U !((i3.u10.p30==0)))))))...252
(forward)formula 2,0,53.6936,1086132,1,0,1.61412e+06,4161,3831,4.3222e+06,375,24016,3383244
FORMULA FireWire-PT-08-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(EG(E((i0.u0.p3==1) U !(EF((i6.i1.u33.p98==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E((i0.u0.p3==1) U !(E(TRUE U (i6.i1.u33.p98==1)))))] != FALSE
(forward)formula 3,1,60.3472,1233904,1,0,1.85063e+06,4225,3877,4.8806e+06,375,24833,3946281
FORMULA FireWire-PT-08-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1241872 ms.

BK_STOP 1779804953633

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ 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="FireWire-PT-08"
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 FireWire-PT-08, 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 r130-smll-177955809000201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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