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.r098-tall-177955695400241.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 DiscoveryGPU-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.0K Mar 6 16:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 16:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 6 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 6 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 46K 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 DiscoveryGPU-PT-06b-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-12
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-13
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-14
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779594449917

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 03:47:31] [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-24 03:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:47:31] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2026-05-24 03:47:31] [INFO ] Transformed 184 places.
[2026-05-24 03:47:31] [INFO ] Transformed 194 transitions.
[2026-05-24 03:47:31] [INFO ] Found NUPN structural information;
[2026-05-24 03:47:31] [INFO ] Parsed PT model containing 184 places and 194 transitions and 503 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 86 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 180 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 173 transition count 187
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 173 transition count 187
Applied a total of 18 rules in 30 ms. Remains 173 /184 variables (removed 11) and now considering 187/194 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15396167747073546535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5679577211857144558.kers'
[2026-05-24 03:47:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15396167747073546535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5679577211857144558.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 187 rows 173 cols 486 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-24 03:47:31] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5679577211857144558.kers
Total runtime 4 ms.
[2026-05-24 03:47:31] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-24 03:47:31] [INFO ] Invariant cache hit.
[2026-05-24 03:47:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2026-05-24 03:47:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 5/169 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/356 variables, 169/177 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 11/188 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 4/360 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 192 constraints, problems are : Problem set: 0 solved, 186 unsolved in 15769 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 5/169 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/356 variables, 169/188 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 182/370 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 4/360 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 4/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45903ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 45917ms
Starting structural reductions in LTL mode, iteration 1 : 173/184 places, 187/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46393 ms. Remains : 173/184 places, 187/194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Applied a total of 0 rules in 4 ms. Remains 173 /173 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2026-05-24 03:48:17] [INFO ] Invariant cache hit.
[2026-05-24 03:48:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 03:48:17] [INFO ] Invariant cache hit.
[2026-05-24 03:48:17] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 173/173 places, 187/187 transitions.
Support contains 86 out of 173 places after structural reductions.
[2026-05-24 03:48:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 03:48:18] [INFO ] Flatten gal took : 35 ms
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 03:48:18] [INFO ] Flatten gal took : 15 ms
[2026-05-24 03:48:18] [INFO ] Input system was already deterministic with 187 transitions.
Support contains 82 out of 173 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (201 resets) in 1023 ms. (39 steps per ms) remains 1/63 properties
BEST_FIRST walk for 1365 steps (0 resets) in 10 ms. (124 steps per ms) remains 0/1 properties
[2026-05-24 03:48:18] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:48:18] [INFO ] Flatten gal took : 10 ms
[2026-05-24 03:48:18] [INFO ] Input system was already deterministic with 187 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 304 edges and 173 vertex of which 154 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Graph (complete) has 304 edges and 173 vertex of which 157 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 156 transition count 144
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 123 transition count 144
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 67 place count 123 transition count 133
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 89 place count 112 transition count 133
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 104 transition count 125
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 104 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 104 transition count 124
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 107 place count 103 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 101 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 101 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 99 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 99 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 97 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 97 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 95 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 95 transition count 114
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 155 place count 79 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 78 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 78 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 77 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 77 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 76 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 76 transition count 94
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 76 transition count 94
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 74 transition count 92
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 85 edges and 72 vertex of which 68 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 67 edges and 68 vertex of which 22 / 68 are part of one of the 11 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 186 place count 57 transition count 69
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 31 rules applied. Total rules applied 217 place count 39 transition count 56
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 219 place count 38 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 37 transition count 55
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 222 place count 35 transition count 51
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 35 transition count 51
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 34 transition count 49
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 34 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 34 transition count 48
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 6 with 2 rules applied. Total rules applied 229 place count 33 transition count 47
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 235 place count 27 transition count 41
Applied a total of 235 rules in 71 ms. Remains 27 /173 variables (removed 146) and now considering 41/187 (removed 146) transitions.
[2026-05-24 03:48:18] [INFO ] Flow matrix only has 32 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8482463951893184536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2458491479559430602.kers'
[2026-05-24 03:48:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8482463951893184536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2458491479559430602.kers]
Normalized transition count is 31 out of 32 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 31 rows 27 cols 54 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-05-24 03:48:18] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2458491479559430602.kers
Total runtime 0 ms.
[2026-05-24 03:48:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 03:48:18] [INFO ] Flow matrix only has 32 transitions (discarded 9 similar events)
[2026-05-24 03:48:18] [INFO ] Invariant cache hit.
[2026-05-24 03:48:18] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-24 03:48:18] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2026-05-24 03:48:18] [INFO ] Flow matrix only has 32 transitions (discarded 9 similar events)
[2026-05-24 03:48:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 31/51 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 7/58 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 0/58 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/59 variables, and 27 constraints, problems are : Problem set: 0 solved, 29 unsolved in 303 ms.
Refiners :[State Equation: 27/27 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 31/51 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 7/58 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/59 variables, and 56 constraints, problems are : Problem set: 0 solved, 29 unsolved in 275 ms.
Refiners :[State Equation: 27/27 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 583ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/173 places, 41/187 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 716 ms. Remains : 27/173 places, 41/187 transitions.
[2026-05-24 03:48:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:48:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:48:19] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-24 03:48:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:48:19] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:48:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12413642119674012238.gal : 1 ms
[2026-05-24 03:48:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality8623668009185370332.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12413642119674012238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8623668009185370332.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,25272,0.021367,3856,2,56,5,261,6,0,125,206,0


Converting to forward existential form...Done !
original formula: AG(EF((EF((p21==0)) + ((AF((p146==0)) * !(E((p131==1) U ((p13==0)||(p71==1))))) * (p108==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U (p21==0)) + ((!(EG(!((p146==0)))) * !(E((p131==1) U ((p13==0)||(p71==1)...185
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t10, t13, t14, t16, t21, t22, t23, t40, Intersection with reachable at each step ena...208
(forward)formula 0,1,0.037598,4852,1,0,119,5354,107,64,709,6169,151
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 166 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 31 place count 142 transition count 163
Iterating global reduction 1 with 24 rules applied. Total rules applied 55 place count 142 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 137 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 137 transition count 158
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 70 place count 132 transition count 153
Iterating global reduction 1 with 5 rules applied. Total rules applied 75 place count 132 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 128 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 128 transition count 149
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 124 transition count 141
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 124 transition count 141
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 120 transition count 137
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 120 transition count 137
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 118 transition count 135
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 118 transition count 135
Applied a total of 103 rules in 14 ms. Remains 118 /173 variables (removed 55) and now considering 135/187 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10741854630449347611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17876546899438077541.kers'
[2026-05-24 03:48:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10741854630449347611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17876546899438077541.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 118 cols 358 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 03:48:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17876546899438077541.kers
Total runtime 0 ms.
[2026-05-24 03:48:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 03:48:19] [INFO ] Invariant cache hit.
[2026-05-24 03:48:19] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-24 03:48:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/252 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 1/253 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/253 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 127 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/252 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 133/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/253 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 262 constraints, problems are : Problem set: 0 solved, 134 unsolved in 14524 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20857ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 20859ms
Starting structural reductions in LTL mode, iteration 1 : 118/173 places, 135/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21000 ms. Remains : 118/173 places, 135/187 transitions.
[2026-05-24 03:48:40] [INFO ] Flatten gal took : 11 ms
[2026-05-24 03:48:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:48:40] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-24 03:48:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:48:40] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:48:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality6518074084592877976.gal : 2 ms
[2026-05-24 03:48:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13826235863096181917.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/CTLCardinality6518074084592877976.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13826235863096181917.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.14206e+09,27.6423,653616,2,68950,5,1.96745e+06,6,0,605,4.21605e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 03:49:10] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:49:10] [INFO ] Applying decomposition
[2026-05-24 03:49:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16738490035972538176.txt' '-o' '/tmp/graph16738490035972538176.bin' '-w' '/tmp/graph16738490035972538176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16738490035972538176.bin' '-l' '-1' '-v' '-w' '/tmp/graph16738490035972538176.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:49:10] [INFO ] Decomposing Gal with order
[2026-05-24 03:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:49:10] [INFO ] Removed a total of 42 redundant transitions.
[2026-05-24 03:49:10] [INFO ] Flatten gal took : 93 ms
[2026-05-24 03:49:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2026-05-24 03:49:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10724028202767779227.gal : 13 ms
[2026-05-24 03:49:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality17143033400536464503.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/CTLCardinality10724028202767779227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17143033400536464503.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,1.14206e+09,16.5745,412548,8643,176,630553,4504,329,2.35536e+06,61,40028,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Graph (complete) has 304 edges and 173 vertex of which 154 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 153 transition count 139
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 117 transition count 139
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 73 place count 117 transition count 128
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 95 place count 106 transition count 128
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 104 place count 97 transition count 119
Iterating global reduction 2 with 9 rules applied. Total rules applied 113 place count 97 transition count 119
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 113 place count 97 transition count 118
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 115 place count 96 transition count 118
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 93 transition count 115
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 93 transition count 115
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 90 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 90 transition count 111
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 87 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 87 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 85 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 85 transition count 104
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 169 place count 69 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 68 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 68 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 67 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 66 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 66 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 64 transition count 82
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 75 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 63 edges and 58 vertex of which 24 / 58 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 2 with 23 rules applied. Total rules applied 200 place count 46 transition count 58
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 231 place count 27 transition count 46
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 235 place count 23 transition count 38
Iterating global reduction 4 with 4 rules applied. Total rules applied 239 place count 23 transition count 38
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 243 place count 19 transition count 30
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 19 transition count 30
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 251 place count 15 transition count 22
Iterating global reduction 4 with 4 rules applied. Total rules applied 255 place count 15 transition count 22
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 259 place count 11 transition count 18
Iterating global reduction 4 with 4 rules applied. Total rules applied 263 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 264 place count 11 transition count 17
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 268 place count 8 transition count 14
Applied a total of 268 rules in 51 ms. Remains 8 /173 variables (removed 165) and now considering 14/187 (removed 173) transitions.
[2026-05-24 03:49:40] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8161291576771509287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8806779713352887509.kers'
[2026-05-24 03:49:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8161291576771509287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8806779713352887509.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 03:49:40] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8806779713352887509.kers
Total runtime 0 ms.
[2026-05-24 03:49:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 03:49:40] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 03:49:40] [INFO ] Invariant cache hit.
[2026-05-24 03:49:41] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2026-05-24 03:49:41] [INFO ] Redundant transitions in 1 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 03:49:41] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2026-05-24 03:49:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 161 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 94 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 289ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/173 places, 14/187 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 467 ms. Remains : 8/173 places, 14/187 transitions.
[2026-05-24 03:49:41] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:49:41] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:49:41] [INFO ] Input system was already deterministic with 14 transitions.
[2026-05-24 03:49:41] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:49:41] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:49:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality4392527233603981455.gal : 1 ms
[2026-05-24 03:49:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality8903983554629737239.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/CTLCardinality4392527233603981455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8903983554629737239.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,147,0.00242,3788,2,19,5,105,6,0,39,92,0


Converting to forward existential form...Done !
original formula: EG((p13==0))
=> equivalent forward existential formula: [FwdG(Init,(p13==0))] != FALSE
Hit Full ! (commute/partial/dont) 12/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,1,0.003928,4060,1,0,8,315,19,4,189,319,8
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 166 transition count 187
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 34 place count 139 transition count 160
Iterating global reduction 1 with 27 rules applied. Total rules applied 61 place count 139 transition count 160
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 133 transition count 154
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 133 transition count 154
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 129 transition count 150
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 129 transition count 150
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 125 transition count 146
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 125 transition count 146
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 93 place count 121 transition count 138
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 121 transition count 138
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 101 place count 117 transition count 134
Iterating global reduction 1 with 4 rules applied. Total rules applied 105 place count 117 transition count 134
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 109 place count 113 transition count 130
Iterating global reduction 1 with 4 rules applied. Total rules applied 113 place count 113 transition count 130
Applied a total of 113 rules in 25 ms. Remains 113 /173 variables (removed 60) and now considering 130/187 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5756637247900514934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14700580481789428448.kers'
[2026-05-24 03:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5756637247900514934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14700580481789428448.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 113 cols 350 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 03:49:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14700580481789428448.kers
Total runtime 1 ms.
[2026-05-24 03:49:41] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-24 03:49:41] [INFO ] Invariant cache hit.
[2026-05-24 03:49:41] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 03:49:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/242 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 1/243 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 121 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6090 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/242 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 128/248 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 1/243 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 10 (OVERLAPS) 0/243 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 250 constraints, problems are : Problem set: 0 solved, 129 unsolved in 9288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15417ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 15418ms
Starting structural reductions in LTL mode, iteration 1 : 113/173 places, 130/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15672 ms. Remains : 113/173 places, 130/187 transitions.
[2026-05-24 03:49:57] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:49:57] [INFO ] Flatten gal took : 15 ms
[2026-05-24 03:49:57] [INFO ] Input system was already deterministic with 130 transitions.
[2026-05-24 03:49:57] [INFO ] Flatten gal took : 15 ms
[2026-05-24 03:49:57] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:49:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality6885086487933139938.gal : 2 ms
[2026-05-24 03:49:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality13977413697230617510.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/CTLCardinality6885086487933139938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13977413697230617510.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,6.11331e+08,11.0555,279264,2,31278,5,959961,6,0,580,1.6302e+06,0


Converting to forward existential form...Done !
original formula: EF((EX((AX(EF((p54==1))) + EG((p64==0)))) + ((p56==0)&&(p27==1))))
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * !(EX(!(E(TRUE U (p54==1))))))] != FALSE + [FwdG(EY(FwdU(Init,TRUE)),(p64==0))] != FALS...212
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t14, t15, t17, t23, t26, t27, t29, t35, t38, t39, t41, t47, t53, t55, t57, t...311
Detected timeout of ITS tools.
[2026-05-24 03:50:27] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:50:27] [INFO ] Applying decomposition
[2026-05-24 03:50:27] [INFO ] Flatten gal took : 4 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/graph17093573160884967778.txt' '-o' '/tmp/graph17093573160884967778.bin' '-w' '/tmp/graph17093573160884967778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17093573160884967778.bin' '-l' '-1' '-v' '-w' '/tmp/graph17093573160884967778.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:50:27] [INFO ] Decomposing Gal with order
[2026-05-24 03:50:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:50:27] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-24 03:50:27] [INFO ] Flatten gal took : 17 ms
[2026-05-24 03:50:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 3 ms.
[2026-05-24 03:50:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13237277245663714739.gal : 14 ms
[2026-05-24 03:50:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11908169686979893548.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/CTLCardinality13237277245663714739.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11908169686979893548.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,6.11331e+08,5.82463,165020,3210,109,216331,2327,306,1.45313e+06,42,15624,0


Converting to forward existential form...Done !
original formula: EF((EX((AX(EF((i4.u11.p54==1))) + EG((i5.u16.p64==0)))) + ((i4.u12.p56==0)&&(i1.u7.p27==1))))
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * !(EX(!(E(TRUE U (i4.u11.p54==1))))))] != FALSE + [FwdG(EY(FwdU(Init,TRUE)),(i5.u16.p64...239
Reverse transition relation is NOT exact ! Due to transitions t124, u38.t4, u38.t5, i1.u2.t84, i2.t77, i2.t66, i2.t38, i2.t26, i2.t14, i2.u3.t82, i2.u9.t67...464
(forward)formula 0,1,29.4504,746432,1,0,768434,3099,1684,7.27937e+06,244,26092,395682
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-03 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 : 173/173 places, 187/187 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 165 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 33 place count 140 transition count 162
Iterating global reduction 1 with 25 rules applied. Total rules applied 58 place count 140 transition count 162
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 134 transition count 156
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 134 transition count 156
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 129 transition count 151
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 129 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 125 transition count 147
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 125 transition count 147
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 122 transition count 141
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 122 transition count 141
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 97 place count 119 transition count 138
Iterating global reduction 1 with 3 rules applied. Total rules applied 100 place count 119 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 116 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 116 transition count 135
Applied a total of 106 rules in 19 ms. Remains 116 /173 variables (removed 57) and now considering 135/187 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3485899670315249835.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17717596262298614965.kers'
[2026-05-24 03:50:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3485899670315249835.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17717596262298614965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 116 cols 360 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-24 03:50:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17717596262298614965.kers
Total runtime 7 ms.
[2026-05-24 03:50:57] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 03:50:57] [INFO ] Invariant cache hit.
[2026-05-24 03:50:57] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-24 03:50:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 135/251 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 7/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 125 constraints, problems are : Problem set: 0 solved, 134 unsolved in 5240 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/251 variables, 116/125 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 134/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 259 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11674ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 11675ms
Starting structural reductions in LTL mode, iteration 1 : 116/173 places, 135/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11873 ms. Remains : 116/173 places, 135/187 transitions.
[2026-05-24 03:51:08] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:51:08] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:51:08] [INFO ] Input system was already deterministic with 135 transitions.
[2026-05-24 03:51:08] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:51:08] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:51:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality11036693033618724009.gal : 1 ms
[2026-05-24 03:51:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality12965472809381716291.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/CTLCardinality11036693033618724009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12965472809381716291.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,9.45227e+08,15.4749,407928,2,35943,5,1.33928e+06,6,0,600,2.3828e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 03:51:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:51:38] [INFO ] Applying decomposition
[2026-05-24 03:51:38] [INFO ] Flatten gal took : 4 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/graph13395357255320798141.txt' '-o' '/tmp/graph13395357255320798141.bin' '-w' '/tmp/graph13395357255320798141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13395357255320798141.bin' '-l' '-1' '-v' '-w' '/tmp/graph13395357255320798141.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:51:38] [INFO ] Decomposing Gal with order
[2026-05-24 03:51:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:51:39] [INFO ] Removed a total of 46 redundant transitions.
[2026-05-24 03:51:39] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2026-05-24 03:51:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality13696346367351738749.gal : 2 ms
[2026-05-24 03:51:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality9388241173818791570.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/CTLCardinality13696346367351738749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9388241173818791570.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,9.45227e+08,22.4158,534492,4413,242,878130,11126,322,3.44458e+06,58,100904,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 167 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 30 place count 143 transition count 163
Iterating global reduction 1 with 24 rules applied. Total rules applied 54 place count 143 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 139 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 139 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 136 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 136 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 135 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 135 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 134 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 134 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 133 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 133 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 132 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 132 transition count 151
Applied a total of 76 rules in 19 ms. Remains 132 /173 variables (removed 41) and now considering 151/187 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10412998509658845481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5760081539498635571.kers'
[2026-05-24 03:52:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10412998509658845481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5760081539498635571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 151 rows 132 cols 406 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 03:52:09] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5760081539498635571.kers
Total runtime 2 ms.
[2026-05-24 03:52:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 03:52:09] [INFO ] Invariant cache hit.
[2026-05-24 03:52:09] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2026-05-24 03:52:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 151/281 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 2/283 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 140 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/281 variables, 130/138 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 148/286 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 2/283 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/283 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 290 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21115ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21115ms
Starting structural reductions in LTL mode, iteration 1 : 132/173 places, 151/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21304 ms. Remains : 132/173 places, 151/187 transitions.
[2026-05-24 03:52:30] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:52:30] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:52:30] [INFO ] Input system was already deterministic with 151 transitions.
[2026-05-24 03:52:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:52:30] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:52:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality2178892106553047663.gal : 1 ms
[2026-05-24 03:52:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9093029740359097551.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/CTLCardinality2178892106553047663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9093029740359097551.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.02537e+09,13.108,307068,2,31780,5,869804,6,0,674,1.82818e+06,0


Converting to forward existential form...Done !
original formula: (AX(EF(((p160==0)&&(p122==1)))) * A((((((!(((p4==1)||(p133==1))) * AF((p127==0))) + E(((p2==0)&&(p26==1)) U E((p131==1) U (p42==1)))) * A...324
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((p160==0)&&(p122==1)))))] = FALSE * ((([(EY((((FwdU(Init,!(((p10==0)||(p88==1)))) * !(...1108
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t12, t15, t16, t18, t30, t31, t33, t40, t48, t49, t52, t57, t60, t63, t64, t66, t...330
Detected timeout of ITS tools.
[2026-05-24 03:53:00] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:53:00] [INFO ] Applying decomposition
[2026-05-24 03:53:00] [INFO ] Flatten gal took : 4 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/graph2015689040926160830.txt' '-o' '/tmp/graph2015689040926160830.bin' '-w' '/tmp/graph2015689040926160830.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2015689040926160830.bin' '-l' '-1' '-v' '-w' '/tmp/graph2015689040926160830.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:53:00] [INFO ] Decomposing Gal with order
[2026-05-24 03:53:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:53:00] [INFO ] Removed a total of 54 redundant transitions.
[2026-05-24 03:53:00] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:53:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2026-05-24 03:53:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality16548831672157819233.gal : 2 ms
[2026-05-24 03:53:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality8377500337266808368.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/CTLCardinality16548831672157819233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8377500337266808368.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.02537e+09,4.08682,130420,3462,65,213124,1342,356,760757,44,8076,0


Converting to forward existential form...Done !
original formula: (AX(EF(((i5.u42.p160==0)&&(i7.u34.p122==1)))) * A((((((!(((i1.i0.u2.p4==1)||(i15.u38.p133==1))) * AF((i14.u36.p127==0))) + E(((i0.u1.p2==...487
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((i5.u42.p160==0)&&(i7.u34.p122==1)))))] = FALSE * ((([(EY((((FwdU(Init,!(((i18.u6.p10=...1545
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Reverse transition relation is NOT exact ! Due to transitions t141, t143, i2.u4.t97, i3.u5.t95, i4.u12.t80, i5.t72, i5.t57, i5.t40, i5.t12, i5.u9.t87, i5.u...503
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Graph (complete) has 304 edges and 173 vertex of which 154 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.2 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 153 transition count 141
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 119 transition count 141
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 69 place count 119 transition count 130
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 91 place count 108 transition count 130
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 100 place count 99 transition count 121
Iterating global reduction 2 with 9 rules applied. Total rules applied 109 place count 99 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 109 place count 99 transition count 120
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 111 place count 98 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 94 transition count 116
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 94 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 90 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 90 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 86 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 86 transition count 104
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 84 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 84 transition count 102
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 169 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 68 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 68 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 172 place count 67 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 173 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 66 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 66 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 64 transition count 81
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 74 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 59 edges and 58 vertex of which 22 / 58 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 200 place count 47 transition count 58
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 229 place count 29 transition count 47
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 232 place count 26 transition count 41
Iterating global reduction 4 with 3 rules applied. Total rules applied 235 place count 26 transition count 41
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 238 place count 23 transition count 35
Iterating global reduction 4 with 3 rules applied. Total rules applied 241 place count 23 transition count 35
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 244 place count 20 transition count 29
Iterating global reduction 4 with 3 rules applied. Total rules applied 247 place count 20 transition count 29
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 249 place count 18 transition count 27
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 18 transition count 27
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 253 place count 18 transition count 25
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 18 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 257 place count 16 transition count 23
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 260 place count 13 transition count 20
Applied a total of 260 rules in 30 ms. Remains 13 /173 variables (removed 160) and now considering 20/187 (removed 167) transitions.
[2026-05-24 03:53:30] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1419748715921563778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16997241809175691480.kers'
[2026-05-24 03:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1419748715921563778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16997241809175691480.kers]
Normalized transition count is 15 out of 16 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 13 cols 26 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 03:53:30] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16997241809175691480.kers
Total runtime 0 ms.
[2026-05-24 03:53:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 03:53:30] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2026-05-24 03:53:30] [INFO ] Invariant cache hit.
[2026-05-24 03:53:30] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2026-05-24 03:53:30] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-24 03:53:30] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2026-05-24 03:53:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/28 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 13 unsolved in 105 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/24 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/28 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/29 variables, and 26 constraints, problems are : Problem set: 0 solved, 13 unsolved in 111 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 218ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/173 places, 20/187 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 299 ms. Remains : 13/173 places, 20/187 transitions.
[2026-05-24 03:53:30] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:53:30] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:53:30] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-24 03:53:30] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:53:30] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:53:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality11741928809556320582.gal : 0 ms
[2026-05-24 03:53:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15658808471279259501.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/CTLCardinality11741928809556320582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15658808471279259501.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,1050,0.007254,3828,2,27,5,141,6,0,63,117,0


Converting to forward existential form...Done !
original formula: AF(AG((((p139==0)&&(p143==1))&&(p16==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p139==0)&&(p143==1))&&(p16==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t11, t19, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,0,0.012276,4112,1,0,39,904,61,23,366,892,50
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 167 transition count 187
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 27 place count 146 transition count 166
Iterating global reduction 1 with 21 rules applied. Total rules applied 48 place count 146 transition count 166
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 142 transition count 162
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 142 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 140 transition count 160
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 140 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 138 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 138 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 136 transition count 154
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 136 transition count 154
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 134 transition count 152
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 134 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 132 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 132 transition count 150
Applied a total of 76 rules in 7 ms. Remains 132 /173 variables (removed 41) and now considering 150/187 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3270655629024593451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2106621089470957068.kers'
[2026-05-24 03:53:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3270655629024593451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2106621089470957068.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 150 rows 132 cols 401 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-24 03:53:30] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2106621089470957068.kers
Total runtime 3 ms.
[2026-05-24 03:53:30] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 03:53:30] [INFO ] Invariant cache hit.
[2026-05-24 03:53:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2026-05-24 03:53:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 150/280 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 6/138 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 2/282 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 140 constraints, problems are : Problem set: 0 solved, 149 unsolved in 7643 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/280 variables, 130/138 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 147/285 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 2/282 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 0/282 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 290 constraints, problems are : Problem set: 0 solved, 149 unsolved in 17514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25172ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 25173ms
Starting structural reductions in LTL mode, iteration 1 : 132/173 places, 150/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25317 ms. Remains : 132/173 places, 150/187 transitions.
[2026-05-24 03:53:56] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:53:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:53:56] [INFO ] Input system was already deterministic with 150 transitions.
[2026-05-24 03:53:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:53:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:53:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality5057793333795935602.gal : 0 ms
[2026-05-24 03:53:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10217457162374354415.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/CTLCardinality5057793333795935602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10217457162374354415.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.36755e+09,14.5457,373236,2,39526,5,1.16132e+06,6,0,672,2.23938e+06,0


Converting to forward existential form...Done !
original formula: (EX(((((AX(((p47==0)&&((p83==0)||(p172==1)))) * (p101==0)) + (p106==0)) + ((p18==1) + EG((p1==0)))) + (p140==1))) * EF(((EX(((p163==0)&&(...228
=> equivalent forward existential formula: [(EY(((FwdU((Init * EX(((((!(EX(!(((p47==0)&&((p83==0)||(p172==1)))))) * (p101==0)) + (p106==0)) + ((p18==1) + E...286
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t18, t20, t22, t28, t31, t32, t34, t40, t43, t44, t46, t47, t53, t59, t61, t6...337
Detected timeout of ITS tools.
[2026-05-24 03:54:26] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:54:26] [INFO ] Applying decomposition
[2026-05-24 03:54:26] [INFO ] Flatten gal took : 4 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/graph3913221378778081667.txt' '-o' '/tmp/graph3913221378778081667.bin' '-w' '/tmp/graph3913221378778081667.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3913221378778081667.bin' '-l' '-1' '-v' '-w' '/tmp/graph3913221378778081667.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:54:26] [INFO ] Decomposing Gal with order
[2026-05-24 03:54:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:54:26] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-24 03:54:26] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:54:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 2 ms.
[2026-05-24 03:54:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality9989357458973733383.gal : 2 ms
[2026-05-24 03:54:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality6072059262002856177.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/CTLCardinality9989357458973733383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6072059262002856177.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.36755e+09,2.75175,98692,4938,118,160011,2304,347,576722,53,16256,0


Converting to forward existential form...Done !
original formula: (EX(((((AX(((i6.u12.p47==0)&&((i7.u17.p83==0)||(u44.p172==1)))) * (i6.u26.p101==0)) + (i3.u27.p106==0)) + ((i2.u6.p18==1) + EG((i1.u1.p1=...330
=> equivalent forward existential formula: [(EY(((FwdU((Init * EX(((((!(EX(!(((i6.u12.p47==0)&&((i7.u17.p83==0)||(u44.p172==1)))))) * (i6.u26.p101==0)) + (...388
Reverse transition relation is NOT exact ! Due to transitions t140, u44.t4, u44.t5, u44.t7, i0.u4.t92, i0.u13.t77, i0.u45.t2, i2.u6.t94, i3.t70, i3.t53, i3...526
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 165 transition count 187
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 35 place count 138 transition count 160
Iterating global reduction 1 with 27 rules applied. Total rules applied 62 place count 138 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 133 transition count 155
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 133 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 130 transition count 152
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 127 transition count 149
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 127 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 124 transition count 143
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 124 transition count 143
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 122 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 122 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 120 transition count 139
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 120 transition count 139
Applied a total of 98 rules in 18 ms. Remains 120 /173 variables (removed 53) and now considering 139/187 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5135752897452234647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12246317768217533680.kers'
[2026-05-24 03:54:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5135752897452234647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12246317768217533680.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 120 cols 376 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-24 03:54:56] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12246317768217533680.kers
Total runtime 3 ms.
[2026-05-24 03:54:56] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 03:54:56] [INFO ] Invariant cache hit.
[2026-05-24 03:54:56] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-24 03:54:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 139/259 variables, 120/122 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 128 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/259 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 138/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 266 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11594ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 11595ms
Starting structural reductions in LTL mode, iteration 1 : 120/173 places, 139/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11754 ms. Remains : 120/173 places, 139/187 transitions.
[2026-05-24 03:55:08] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:55:08] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:55:08] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-24 03:55:08] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:08] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:55:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7140283652088001710.gal : 1 ms
[2026-05-24 03:55:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality3180845577464948231.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/CTLCardinality7140283652088001710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3180845577464948231.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,7.30544e+08,9.66837,215748,2,25662,5,682463,6,0,620,1.26204e+06,0


Converting to forward existential form...Done !
original formula: EX(AF(((!(A((p43==1) U (p147==0))) * (p12==0)) * (AG((p141==1)) * ((p47==0)||(p18==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((!(!((E(!((p147==0)) U (!((p43==1)) * !((p147==0)))) + EG(!((p147==0)))))) * (p12==0)) * (!...218
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t17, t19, t21, t27, t30, t31, t33, t39, t42, t43, t45, t51, t54, t56, t58, t...328
Detected timeout of ITS tools.
[2026-05-24 03:55:38] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:55:38] [INFO ] Applying decomposition
[2026-05-24 03:55:38] [INFO ] Flatten gal took : 4 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/graph8177035976325606217.txt' '-o' '/tmp/graph8177035976325606217.bin' '-w' '/tmp/graph8177035976325606217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8177035976325606217.bin' '-l' '-1' '-v' '-w' '/tmp/graph8177035976325606217.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:55:38] [INFO ] Decomposing Gal with order
[2026-05-24 03:55:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:55:38] [INFO ] Removed a total of 52 redundant transitions.
[2026-05-24 03:55:38] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:55:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2026-05-24 03:55:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4188306894859394885.gal : 1 ms
[2026-05-24 03:55:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality6586005026458734212.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/CTLCardinality4188306894859394885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6586005026458734212.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,7.30544e+08,8.34808,211328,2133,113,452780,6228,316,1.42756e+06,44,55659,0


Converting to forward existential form...Done !
original formula: EX(AF(((!(A((i5.u14.p43==1) U (u35.p147==0))) * (u3.p12==0)) * (AG((i0.u33.p141==1)) * ((i5.u12.p47==0)||(i2.u5.p18==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((!(!((E(!((u35.p147==0)) U (!((i5.u14.p43==1)) * !((u35.p147==0)))) + EG(!((u35.p147==0))))...260
Reverse transition relation is NOT exact ! Due to transitions t96, t99, t130, t133, t135, u3.t86, u35.t17, u40.t4, u40.t5, i2.u5.t88, i3.u8.t90, i4.u11.t75...479
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Graph (complete) has 304 edges and 173 vertex of which 155 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 154 transition count 142
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 120 transition count 142
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 69 place count 120 transition count 132
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 89 place count 110 transition count 132
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 97 place count 102 transition count 124
Iterating global reduction 2 with 8 rules applied. Total rules applied 105 place count 102 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 105 place count 102 transition count 123
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 107 place count 101 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 98 transition count 120
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 98 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 95 transition count 116
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 95 transition count 116
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 92 transition count 111
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 92 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 90 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 90 transition count 109
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 157 place count 76 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 75 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 75 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 74 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 74 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 73 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 73 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 164 place count 73 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 71 transition count 89
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 85 edges and 69 vertex of which 65 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 62 edges and 65 vertex of which 22 / 65 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 2 with 22 rules applied. Total rules applied 188 place count 54 transition count 66
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 31 rules applied. Total rules applied 219 place count 36 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 221 place count 35 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 222 place count 34 transition count 52
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 226 place count 30 transition count 44
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 30 transition count 44
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 234 place count 26 transition count 36
Iterating global reduction 6 with 4 rules applied. Total rules applied 238 place count 26 transition count 36
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 240 place count 24 transition count 32
Iterating global reduction 6 with 2 rules applied. Total rules applied 242 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 244 place count 22 transition count 30
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 22 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 250 place count 20 transition count 28
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 6 with 2 rules applied. Total rules applied 252 place count 19 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 19 transition count 26
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 6 with 2 rules applied. Total rules applied 255 place count 18 transition count 25
Applied a total of 255 rules in 24 ms. Remains 18 /173 variables (removed 155) and now considering 25/187 (removed 162) transitions.
[2026-05-24 03:56:08] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9295833174404035117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13662739197065021961.kers'
[2026-05-24 03:56:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9295833174404035117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13662739197065021961.kers]
Normalized transition count is 20 out of 21 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 20 rows 18 cols 40 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-24 03:56:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13662739197065021961.kers
Total runtime 1 ms.
[2026-05-24 03:56:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-24 03:56:08] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2026-05-24 03:56:08] [INFO ] Invariant cache hit.
[2026-05-24 03:56:08] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2026-05-24 03:56:08] [INFO ] Redundant transitions in 1 ms returned []
Running 22 sub problems to find dead transitions.
[2026-05-24 03:56:08] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2026-05-24 03:56:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/39 variables, and 18 constraints, problems are : Problem set: 0 solved, 22 unsolved in 193 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 40 constraints, problems are : Problem set: 0 solved, 22 unsolved in 192 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 389ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/173 places, 25/187 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 477 ms. Remains : 18/173 places, 25/187 transitions.
[2026-05-24 03:56:08] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:56:08] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:08] [INFO ] Input system was already deterministic with 25 transitions.
[2026-05-24 03:56:08] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:08] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13015204482977516998.gal : 0 ms
[2026-05-24 03:56:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality3048739594419399651.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/CTLCardinality13015204482977516998.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3048739594419399651.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,1823,0.004483,3944,2,66,5,552,6,0,91,472,0


Converting to forward existential form...Done !
original formula: (AF((((p140==0)||(p92==1)) + (EF((p135==0)) + AG(((p7!=1)||(p114!=1)))))) * AF((p4==1)))
=> equivalent forward existential formula: ([FwdG(Init,!((((p140==0)||(p92==1)) + (E(TRUE U (p135==0)) + !(E(TRUE U !(((p7!=1)||(p114!=1)))))))))] = FALSE ...189
Hit Full ! (commute/partial/dont) 23/0/2
(forward)formula 0,0,0.008275,4216,1,0,9,1429,20,3,419,1019,8
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Graph (complete) has 304 edges and 173 vertex of which 154 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 153 transition count 140
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 118 transition count 140
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 71 place count 118 transition count 129
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 93 place count 107 transition count 129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 102 place count 98 transition count 120
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 98 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 111 place count 98 transition count 119
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 113 place count 97 transition count 119
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 93 transition count 115
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 93 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 89 transition count 110
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 89 transition count 110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 85 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 85 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 82 transition count 100
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 82 transition count 100
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 175 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 65 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 65 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 178 place count 64 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 179 place count 64 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 180 place count 63 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 63 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 61 transition count 78
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 71 edges and 59 vertex of which 55 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 59 edges and 55 vertex of which 24 / 55 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 20 rules applied. Total rules applied 203 place count 43 transition count 57
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 29 rules applied. Total rules applied 232 place count 27 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 26 transition count 44
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 238 place count 21 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 243 place count 21 transition count 34
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 248 place count 16 transition count 24
Iterating global reduction 5 with 5 rules applied. Total rules applied 253 place count 16 transition count 24
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 257 place count 12 transition count 16
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 12 transition count 16
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 265 place count 8 transition count 12
Iterating global reduction 5 with 4 rules applied. Total rules applied 269 place count 8 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 270 place count 8 transition count 11
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 5 with 2 rules applied. Total rules applied 272 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 274 place count 5 transition count 8
Applied a total of 274 rules in 20 ms. Remains 5 /173 variables (removed 168) and now considering 8/187 (removed 179) transitions.
[2026-05-24 03:56:08] [INFO ] Flow matrix only has 6 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-8573815295961279175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10557992791400161743.kers'
[2026-05-24 03:56:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8573815295961279175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10557992791400161743.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 9 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 03:56:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10557992791400161743.kers
Total runtime 0 ms.
[2026-05-24 03:56:08] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-24 03:56:08] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 03:56:08] [INFO ] Invariant cache hit.
[2026-05-24 03:56:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2026-05-24 03:56:08] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 03:56:08] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 03:56:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 42 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/173 places, 8/187 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 153 ms. Remains : 5/173 places, 8/187 transitions.
[2026-05-24 03:56:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:09] [INFO ] Input system was already deterministic with 8 transitions.
[2026-05-24 03:56:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:56:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality7765534714806062685.gal : 0 ms
[2026-05-24 03:56:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality507691563757710457.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/CTLCardinality7765534714806062685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality507691563757710457.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 -...282
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,90,0.004963,3776,2,14,5,132,6,0,25,143,0


Converting to forward existential form...Done !
original formula: EG((p54==0))
=> equivalent forward existential formula: [FwdG(Init,(p54==0))] != FALSE
Hit Full ! (commute/partial/dont) 6/0/2
(forward)formula 0,1,0.006491,4044,1,0,9,217,19,3,123,234,8
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 165 transition count 187
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 35 place count 138 transition count 160
Iterating global reduction 1 with 27 rules applied. Total rules applied 62 place count 138 transition count 160
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 131 transition count 153
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 131 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 127 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 127 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 124 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 124 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 121 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 121 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 118 transition count 137
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 118 transition count 137
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 115 transition count 134
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 115 transition count 134
Applied a total of 108 rules in 5 ms. Remains 115 /173 variables (removed 58) and now considering 134/187 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18097657926349346112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-664009018390275745.kers'
[2026-05-24 03:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18097657926349346112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-664009018390275745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 115 cols 360 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-24 03:56:09] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-664009018390275745.kers
Total runtime 1 ms.
[2026-05-24 03:56:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 03:56:09] [INFO ] Invariant cache hit.
[2026-05-24 03:56:09] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2026-05-24 03:56:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 134/249 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 123 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/249 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 133/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 256 constraints, problems are : Problem set: 0 solved, 133 unsolved in 5725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10658ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 10659ms
Starting structural reductions in LTL mode, iteration 1 : 115/173 places, 134/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10795 ms. Remains : 115/173 places, 134/187 transitions.
[2026-05-24 03:56:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:56:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:56:19] [INFO ] Input system was already deterministic with 134 transitions.
[2026-05-24 03:56:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:56:19] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:56:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8166896223822396743.gal : 1 ms
[2026-05-24 03:56:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1029025660916906039.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/CTLCardinality8166896223822396743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1029025660916906039.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,6.53783e+08,15.1015,332964,2,34546,5,1.07044e+06,6,0,595,2.02753e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-24 03:56:49] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:56:49] [INFO ] Applying decomposition
[2026-05-24 03:56:49] [INFO ] Flatten gal took : 2 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/graph5189175927941901530.txt' '-o' '/tmp/graph5189175927941901530.bin' '-w' '/tmp/graph5189175927941901530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5189175927941901530.bin' '-l' '-1' '-v' '-w' '/tmp/graph5189175927941901530.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:56:49] [INFO ] Decomposing Gal with order
[2026-05-24 03:56:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:56:49] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-24 03:56:49] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:56:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2026-05-24 03:56:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality15001384300354621154.gal : 1 ms
[2026-05-24 03:56:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality7834803644884954038.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/CTLCardinality15001384300354621154.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7834803644884954038.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,6.53783e+08,10.2509,299168,3042,62,525471,967,344,2.01378e+06,44,4682,0


Converting to forward existential form...Done !
original formula: (AF(EX(AG(!(A(((i2.i0.u18.p63==0)||(i2.i0.u4.p67==1)) U (i2.i1.u30.p122==1)))))) + EG((((((i11.u35.p137==0)&&(i6.u15.p55==1))&&((i11.u35....235
=> equivalent forward existential formula: [FwdG((Init * !(EG((((((i11.u35.p137==0)&&(i6.u15.p55==1))&&((i11.u35.p138==0)&&(i5.u9.p26==1))) * !(EG(!(!(E(TR...380
Reverse transition relation is NOT exact ! Due to transitions u41.t4, u41.t5, i2.t85, i2.i0.t58, i2.i0.u4.t56, i2.i1.t29, i2.i1.t99, i2.i1.t101, i2.i1.u5.t...511
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 165 transition count 187
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 35 place count 138 transition count 160
Iterating global reduction 1 with 27 rules applied. Total rules applied 62 place count 138 transition count 160
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 133 transition count 155
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 133 transition count 155
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 130 transition count 152
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 130 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 127 transition count 149
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 127 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 124 transition count 143
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 124 transition count 143
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 121 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 121 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 118 transition count 137
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 118 transition count 137
Applied a total of 102 rules in 6 ms. Remains 118 /173 variables (removed 55) and now considering 137/187 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16594182627710993919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10443818748456270759.kers'
[2026-05-24 03:57:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16594182627710993919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10443818748456270759.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 137 rows 118 cols 369 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 03:57:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10443818748456270759.kers
Total runtime 1 ms.
[2026-05-24 03:57:20] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-24 03:57:20] [INFO ] Invariant cache hit.
[2026-05-24 03:57:20] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2026-05-24 03:57:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 137/255 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 126 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/255 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 136/262 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 262 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11734ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 11735ms
Starting structural reductions in LTL mode, iteration 1 : 118/173 places, 137/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12017 ms. Remains : 118/173 places, 137/187 transitions.
[2026-05-24 03:57:32] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:57:32] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:57:32] [INFO ] Input system was already deterministic with 137 transitions.
[2026-05-24 03:57:32] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:57:32] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:57:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15011891426170446567.gal : 0 ms
[2026-05-24 03:57:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality9057035458428604182.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/CTLCardinality15011891426170446567.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9057035458428604182.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,6.85644e+08,10.8673,243832,2,28357,5,778653,6,0,609,1.45734e+06,0


Converting to forward existential form...Done !
original formula: EX(AG(EF(((p12==0)||(p146==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U ((p12==0)||(p146==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t11, t17, t19, t21, t27, t30, t31, t33, t39, t42, t43, t45, t51, t54, t55, t57, t...323
Detected timeout of ITS tools.
[2026-05-24 03:58:02] [INFO ] Flatten gal took : 8 ms
[2026-05-24 03:58:02] [INFO ] Applying decomposition
[2026-05-24 03:58:02] [INFO ] Flatten gal took : 3 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/graph7574966278311510228.txt' '-o' '/tmp/graph7574966278311510228.bin' '-w' '/tmp/graph7574966278311510228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7574966278311510228.bin' '-l' '-1' '-v' '-w' '/tmp/graph7574966278311510228.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:58:02] [INFO ] Decomposing Gal with order
[2026-05-24 03:58:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:58:02] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-24 03:58:02] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2026-05-24 03:58:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality14787935473124308606.gal : 1 ms
[2026-05-24 03:58:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality5897156406284635783.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/CTLCardinality14787935473124308606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5897156406284635783.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,6.85644e+08,14.9068,372388,3209,115,621522,6695,326,2.41307e+06,51,58917,0


Converting to forward existential form...Done !
original formula: EX(AG(EF(((u5.p12==0)||(i0.u34.p146==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U ((u5.p12==0)||(i0.u34.p146==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t130, t132, u5.t84, u39.t4, u39.t5, i0.u12.t69, i0.u34.t17, i0.u34.t135, i0.u40.t2, i3.u4.t86...487
(forward)formula 0,1,26.5473,414288,1,0,621522,6695,1797,3.61618e+06,282,58917,485731
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Graph (complete) has 304 edges and 173 vertex of which 156 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 155 transition count 142
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 121 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 119 transition count 140
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 73 place count 119 transition count 129
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 95 place count 108 transition count 129
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 104 place count 99 transition count 120
Iterating global reduction 3 with 9 rules applied. Total rules applied 113 place count 99 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 113 place count 99 transition count 119
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 98 transition count 119
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 94 transition count 115
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 94 transition count 115
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 90 transition count 110
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 90 transition count 110
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 86 transition count 103
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 86 transition count 103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 142 place count 83 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 145 place count 83 transition count 100
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 177 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 66 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 64 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 62 transition count 78
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 72 edges and 60 vertex of which 56 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 59 edges and 56 vertex of which 22 / 56 are part of one of the 11 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 3 with 22 rules applied. Total rules applied 207 place count 45 transition count 55
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 236 place count 27 transition count 44
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 240 place count 23 transition count 36
Iterating global reduction 5 with 4 rules applied. Total rules applied 244 place count 23 transition count 36
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 248 place count 19 transition count 28
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 19 transition count 28
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 256 place count 15 transition count 20
Iterating global reduction 5 with 4 rules applied. Total rules applied 260 place count 15 transition count 20
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 264 place count 11 transition count 16
Iterating global reduction 5 with 4 rules applied. Total rules applied 268 place count 11 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 269 place count 11 transition count 15
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 271 place count 10 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 273 place count 8 transition count 12
Applied a total of 273 rules in 20 ms. Remains 8 /173 variables (removed 165) and now considering 12/187 (removed 175) transitions.
[2026-05-24 03:58:28] [INFO ] Flow matrix only has 10 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-9756570238807382630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7061598110096638004.kers'
[2026-05-24 03:58:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9756570238807382630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7061598110096638004.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 16 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 03:58:28] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7061598110096638004.kers
Total runtime 1 ms.
[2026-05-24 03:58:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-24 03:58:28] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 03:58:28] [INFO ] Invariant cache hit.
[2026-05-24 03:58:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-24 03:58:28] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 03:58:28] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
[2026-05-24 03:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/17 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/17 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 139ms
Starting structural reductions in SI_CTL mode, iteration 1 : 8/173 places, 12/187 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 213 ms. Remains : 8/173 places, 12/187 transitions.
[2026-05-24 03:58:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:58:29] [INFO ] Flatten gal took : 1 ms
[2026-05-24 03:58:29] [INFO ] Input system was already deterministic with 12 transitions.
[2026-05-24 03:58:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:58:29] [INFO ] Flatten gal took : 0 ms
[2026-05-24 03:58:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16061229378988609900.gal : 0 ms
[2026-05-24 03:58:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality15407057912650058039.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/CTLCardinality16061229378988609900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15407057912650058039.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,147,0.002684,3784,2,19,5,106,6,0,37,88,0


Converting to forward existential form...Done !
original formula: EG(((p99==0)||(p104==1)))
=> equivalent forward existential formula: [FwdG(Init,((p99==0)||(p104==1)))] != FALSE
Hit Full ! (commute/partial/dont) 8/0/4
(forward)formula 0,1,0.004493,4056,1,0,10,252,19,4,181,248,8
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 187/187 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 166 transition count 187
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 33 place count 140 transition count 161
Iterating global reduction 1 with 26 rules applied. Total rules applied 59 place count 140 transition count 161
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 134 transition count 155
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 134 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 130 transition count 151
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 130 transition count 151
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 127 transition count 148
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 127 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 124 transition count 142
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 124 transition count 142
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 121 transition count 139
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 121 transition count 139
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 100 place count 118 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 103 place count 118 transition count 136
Applied a total of 103 rules in 6 ms. Remains 118 /173 variables (removed 55) and now considering 136/187 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1228815796913270424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13650143324040957950.kers'
[2026-05-24 03:58:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1228815796913270424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13650143324040957950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 118 cols 366 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-24 03:58:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13650143324040957950.kers
Total runtime 1 ms.
[2026-05-24 03:58:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 03:58:29] [INFO ] Invariant cache hit.
[2026-05-24 03:58:29] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2026-05-24 03:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (OVERLAPS) 136/253 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 6/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 1/254 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 126 constraints, problems are : Problem set: 0 solved, 135 unsolved in 6448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/253 variables, 117/125 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 134/259 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 1/254 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/254 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 261 constraints, problems are : Problem set: 0 solved, 135 unsolved in 10407 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16866ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 16866ms
Starting structural reductions in LTL mode, iteration 1 : 118/173 places, 136/187 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17032 ms. Remains : 118/173 places, 136/187 transitions.
[2026-05-24 03:58:46] [INFO ] Flatten gal took : 7 ms
[2026-05-24 03:58:46] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:58:46] [INFO ] Input system was already deterministic with 136 transitions.
[2026-05-24 03:58:46] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:58:46] [INFO ] Flatten gal took : 2 ms
[2026-05-24 03:58:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality10248325851931005696.gal : 0 ms
[2026-05-24 03:58:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6085209053839952636.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/CTLCardinality10248325851931005696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6085209053839952636.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,7.24094e+08,15.249,366460,2,39645,5,1.17108e+06,6,0,606,2.2317e+06,0


Converting to forward existential form...Done !
original formula: AX(A(((p37==0)||(p121==1)) U (p21==1)))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!((p21==1))) * (!(((p37==0)||(p121==1))) * !((p21==1))))] = FALSE * [FwdG(EY(Init),!((p21==1)))...165
Hit Full ! (commute/partial/dont) 134/0/2
Detected timeout of ITS tools.
[2026-05-24 03:59:16] [INFO ] Flatten gal took : 5 ms
[2026-05-24 03:59:16] [INFO ] Applying decomposition
[2026-05-24 03:59:16] [INFO ] Flatten gal took : 3 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/graph7724323380447123271.txt' '-o' '/tmp/graph7724323380447123271.bin' '-w' '/tmp/graph7724323380447123271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7724323380447123271.bin' '-l' '-1' '-v' '-w' '/tmp/graph7724323380447123271.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:59:16] [INFO ] Decomposing Gal with order
[2026-05-24 03:59:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:59:16] [INFO ] Removed a total of 48 redundant transitions.
[2026-05-24 03:59:16] [INFO ] Flatten gal took : 13 ms
[2026-05-24 03:59:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-24 03:59:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality17827007126513752055.gal : 2 ms
[2026-05-24 03:59:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15860195117184548515.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/CTLCardinality17827007126513752055.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15860195117184548515.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,7.24094e+08,9.50682,288160,3321,109,453482,6024,331,2.03015e+06,46,50332,0


Converting to forward existential form...Done !
original formula: AX(A(((i14.u11.p37==0)||(i1.u4.p121==1)) U (i5.u8.p21==1)))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!((i5.u8.p21==1))) * (!(((i14.u11.p37==0)||(i1.u4.p121==1))) * !((i5.u8.p21==1))))] = FALSE * [...197
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,29.0914,581376,1,0,480364,6024,1309,6.04392e+06,194,50332,331192
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-24 03:59:45] [INFO ] Flatten gal took : 4 ms
[2026-05-24 03:59:45] [INFO ] Flatten gal took : 3 ms
[2026-05-24 03:59:45] [INFO ] Applying decomposition
[2026-05-24 03:59:45] [INFO ] Flatten gal took : 3 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/graph1990101317237582096.txt' '-o' '/tmp/graph1990101317237582096.bin' '-w' '/tmp/graph1990101317237582096.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1990101317237582096.bin' '-l' '-1' '-v' '-w' '/tmp/graph1990101317237582096.weights' '-q' '0' '-e' '0.001'
[2026-05-24 03:59:45] [INFO ] Decomposing Gal with order
[2026-05-24 03:59:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 03:59:45] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 03:59:45] [INFO ] Flatten gal took : 6 ms
[2026-05-24 03:59:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-24 03:59:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality6434745077102222087.gal : 2 ms
[2026-05-24 03:59:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality1889810890707504271.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/CTLCardinality6434745077102222087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1889810890707504271.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 6 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,4.31232e+09,0.686763,28752,2143,55,52591,359,406,76097,65,1355,0


Converting to forward existential form...Done !
original formula: (AF(((A(EF((i4.u9.p8!=1)) U (AX((i0.u41.p114==1)) * ((i0.u32.p113!=1) + A(((i0.u32.p87==0)||(i20.u52.p149==1)) U (i16.u45.p125==1))))) * ...359
=> equivalent forward existential formula: ([FwdG(Init,!(((!((E(!((!(EX(!((i0.u41.p114==1)))) * ((i0.u32.p113!=1) + !((E(!((i16.u45.p125==1)) U (!(((i0.u32...896
Reverse transition relation is NOT exact ! Due to transitions t174, i2.u4.t105, i2.u4.t121, i3.t117, i4.u9.t111, i4.u9.t119, i6.i0.u15.t94, i6.i0.u15.t101,...663
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,75.2346,2005496,1,0,4.0035e+06,658,2705,5.66142e+06,334,2497,5932975
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF((EF((i22.u59.p173==1)) * AG(((i14.u40.p111==0)||(i16.u42.p128==1))))) + AX(!(E((AX((i13.u37.p103==1)) * AF((i21.i0.u54.p154==1))) U (...233
=> equivalent forward existential formula: ([((FwdU(EY((Init * !(!(EG(!((E(TRUE U (i22.u59.p173==1)) * !(E(TRUE U !(((i14.u40.p111==0)||(i16.u42.p128==1)))...610
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-24 04:01:23] [INFO ] Applying decomposition
[2026-05-24 04:01:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:01:23] [INFO ] Decomposing Gal with order
[2026-05-24 04:01:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:01:23] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-24 04:01:23] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:01:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 8 ms.
[2026-05-24 04:01:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12783806076268570052.gal : 2 ms
[2026-05-24 04:01:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality10431049423886249145.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/CTLCardinality12783806076268570052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10431049423886249145.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 5 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,4.31232e+09,7.264,205800,418,1474,250276,114876,211,803032,224,1.2572e+06,0


Converting to forward existential form...Done !
original formula: (AF((EF((i1.u13.p173==1)) * AG(((i0.i0.i0.u9.p111==0)||(i0.i0.u10.p128==1))))) + AX(!(E((AX((i0.i0.i0.u9.p103==1)) * AF((i0.u11.p154==1))...271
=> equivalent forward existential formula: ([((FwdU(EY((Init * !(!(EG(!((E(TRUE U (i1.u13.p173==1)) * !(E(TRUE U !(((i0.i0.i0.u9.p111==0)||(i0.i0.u10.p128=...697
Reverse transition relation is NOT exact ! Due to transitions t174, i0.u11.t15, i0.u11.t21, i0.u11.t25, i0.u11.t28, i0.u11.t30, i0.u11.t176, i0.i0.u10.t33,...831
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 2
(forward)formula 0,0,54.4669,1234900,1,0,1.33145e+06,886232,2552,4.44956e+06,1485,8.47671e+06,416759
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX(EF(((i0.u11.p160==0)&&(i0.i0.u10.p122==1)))) * A((((((!(((i0.i0.i0.i0.u21.p4==1)||(i0.i0.u10.p133==1))) * AF((i0.i0.u10.p127==0))) + ...586
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((i0.u11.p160==0)&&(i0.i0.u10.p122==1)))))] = FALSE * ((([(EY((((FwdU(Init,!(((i0.i0.i0...1834
(forward)formula 1,1,82.818,1786472,1,0,1.96123e+06,1.36906e+06,2689,6.32352e+06,1502,1.18074e+07,588355
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(((((AX(((i0.i0.i0.i0.i0.u7.p47==0)&&((i0.i0.i0.i0.u8.p83==0)||(i1.u13.p172==1)))) * (i0.i0.i0.u9.p101==0)) + (i0.i0.i0.u9.p106==0)) +...414
=> equivalent forward existential formula: [(EY(((FwdU((Init * EX(((((!(EX(!(((i0.i0.i0.i0.i0.u7.p47==0)&&((i0.i0.i0.i0.u8.p83==0)||(i1.u13.p172==1)))))) *...472
(forward)formula 2,1,93.0734,2013292,1,0,2.25924e+06,1.46246e+06,2857,7.24824e+06,1678,1.30127e+07,735556
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(AF(((!(A((i0.i0.i0.i0.i0.u7.p43==1) U (i0.u11.p147==0))) * (i0.i0.i0.i0.i0.u6.p12==0)) * (AG((i0.u11.p141==1)) * ((i0.i0.i0.i0.i0.u7.p...194
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((!(!((E(!((i0.u11.p147==0)) U (!((i0.i0.i0.i0.i0.u7.p43==1)) * !((i0.u11.p147==0)))) + EG(!...318
(forward)formula 3,0,100.435,2113788,1,0,2.36309e+06,1.53665e+06,2890,7.55763e+06,1682,1.36666e+07,785605
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(EX(AG(!(A(((i0.i0.i0.i0.u8.p63==0)||(i0.i0.i0.i0.u8.p67==1)) U (i0.i0.u10.p122==1)))))) + EG((((((i0.i0.u10.p137==0)&&(i0.i0.i0.i0.i0...283
=> equivalent forward existential formula: [FwdG((Init * !(EG((((((i0.i0.u10.p137==0)&&(i0.i0.i0.i0.i0.u7.p55==1))&&((i0.i0.u10.p138==0)&&(i0.i0.i0.i0.i0.u...428
(forward)formula 4,1,132.655,2279900,1,0,2.64446e+06,1.58147e+06,541,8.34616e+06,779,1.41853e+07,70630
FORMULA DiscoveryGPU-PT-06b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 966005 ms.

BK_STOP 1779595417127

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r098-tall-177955695400241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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