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-177955695500297.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-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695500297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.7K Mar 6 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 6 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 16:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:37 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.9K Mar 15 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 6 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 6 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 6 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:12 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 36K 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-10a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-12
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-13
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-14
FORMULA_NAME DiscoveryGPU-PT-10a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779598373367

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 04:52:54] [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 04:52:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:52:54] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2026-05-24 04:52:54] [INFO ] Transformed 103 places.
[2026-05-24 04:52:54] [INFO ] Transformed 141 transitions.
[2026-05-24 04:52:54] [INFO ] Found NUPN structural information;
[2026-05-24 04:52:54] [INFO ] Parsed PT model containing 103 places and 141 transitions and 453 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 101 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 14 place count 101 transition count 129
Applied a total of 14 rules in 23 ms. Remains 101 /103 variables (removed 2) and now considering 129/141 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4334833009166840791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9335247100983021830.kers'
[2026-05-24 04:52:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4334833009166840791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9335247100983021830.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 129 rows 99 cols 249 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-24 04:52:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9335247100983021830.kers
Total runtime 1 ms.
[2026-05-24 04:52:55] [INFO ] Implicit Places using invariants in 198 ms returned []
[2026-05-24 04:52:55] [INFO ] Invariant cache hit.
[2026-05-24 04:52:55] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 04:52:55] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2026-05-24 04:52:55] [INFO ] Invariant cache hit.
[2026-05-24 04:52:55] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 80/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/230 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 183 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 80/183 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 128/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 311 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4178 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8965ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 8980ms
Starting structural reductions in LTL mode, iteration 1 : 101/103 places, 129/141 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9414 ms. Remains : 101/103 places, 129/141 transitions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 101 /101 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2026-05-24 04:53:04] [INFO ] Invariant cache hit.
[2026-05-24 04:53:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 04:53:04] [INFO ] Invariant cache hit.
[2026-05-24 04:53:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 04:53:04] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 101/101 places, 129/129 transitions.
Support contains 74 out of 101 places after structural reductions.
[2026-05-24 04:53:04] [INFO ] Flatten gal took : 24 ms
[2026-05-24 04:53:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 04:53:04] [INFO ] Flatten gal took : 11 ms
[2026-05-24 04:53:04] [INFO ] Input system was already deterministic with 129 transitions.
Support contains 69 out of 101 places (down from 74) after GAL structural reductions.
RANDOM walk for 40000 steps (372 resets) in 825 ms. (48 steps per ms) remains 2/58 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (37 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2026-05-24 04:53:04] [INFO ] Invariant cache hit.
[2026-05-24 04:53:04] [INFO ] State equation strengthened by 80 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/12 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 6 (OVERLAPS) 25/37 variables, 13/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 11/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 34/71 variables, 12/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/71 variables, 12/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/71 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 26/97 variables, 12/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/97 variables, 12/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/97 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 23/120 variables, 11/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 9/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 30/150 variables, 11/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/150 variables, 11/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/150 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 28/178 variables, 11/136 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/178 variables, 8/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/178 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 14/192 variables, 7/151 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/192 variables, 7/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 14/206 variables, 7/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/206 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 12/218 variables, 6/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/218 variables, 6/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/218 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 12/230 variables, 6/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/230 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/230 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 183 constraints, problems are : Problem set: 1 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Int declared 8/230 variables, and 8 constraints, problems are : Problem set: 2 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/101 constraints, ReadFeed: 2/80 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2026-05-24 04:53:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 04:53:05] [INFO ] Flatten gal took : 8 ms
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 04:53:05] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:53:05] [INFO ] Input system was already deterministic with 129 transitions.
Support contains 66 out of 101 places (down from 67) after GAL structural reductions.
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 282 edges and 101 vertex of which 93 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Graph (complete) has 282 edges and 101 vertex of which 94 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 101 edges and 91 vertex of which 82 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 74 edges and 82 vertex of which 36 / 82 are part of one of the 18 SCC in 1 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 64 transition count 105
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 38 place count 57 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 56 transition count 86
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 53 transition count 80
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 53 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 50 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 50 transition count 74
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 48 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 48 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 46 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 46 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 46 transition count 67
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 3 with 2 rules applied. Total rules applied 62 place count 45 transition count 66
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 69 place count 38 transition count 59
Applied a total of 69 rules in 62 ms. Remains 38 /101 variables (removed 63) and now considering 59/129 (removed 70) transitions.
[2026-05-24 04:53:05] [INFO ] Flow matrix only has 47 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12208459564642810614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14926546262991297090.kers'
[2026-05-24 04:53:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12208459564642810614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14926546262991297090.kers]
Normalized transition count is 46 out of 47 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 38 cols 79 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-24 04:53:05] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14926546262991297090.kers
Total runtime 0 ms.
[2026-05-24 04:53:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 04:53:05] [INFO ] Flow matrix only has 47 transitions (discarded 12 similar events)
[2026-05-24 04:53:05] [INFO ] Invariant cache hit.
[2026-05-24 04:53:05] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2026-05-24 04:53:05] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2026-05-24 04:53:05] [INFO ] Flow matrix only has 47 transitions (discarded 12 similar events)
[2026-05-24 04:53:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 46/76 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 8/84 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 38 constraints, problems are : Problem set: 0 solved, 44 unsolved in 621 ms.
Refiners :[State Equation: 38/38 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 46/76 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 44/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 8/84 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 483 ms.
Refiners :[State Equation: 38/38 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1120ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/101 places, 59/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1319 ms. Remains : 38/101 places, 59/129 transitions.
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:53:06] [INFO ] Input system was already deterministic with 59 transitions.
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:53:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4110826933094357613.gal : 1 ms
[2026-05-24 04:53:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality7048498757961634333.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/CTLCardinality4110826933094357613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7048498757961634333.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,2.87885e+06,0.012434,3960,2,72,5,364,6,0,180,298,0


Converting to forward existential form...Done !
original formula: AG(EF((((p22!=0)&&(p99!=1)) + (((A(((p62==0)||(p17==1)) U ((p98==0)||(p46==1))) * (p27==1)) * ((p52==1)&&((p92==0)||(p43==1)))) * ((p71==...172
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p22!=0)&&(p99!=1)) + (((!((E(!(((p98==0)||(p46==1))) U (!(((p62==0)||(p17==1))...301
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t42, t44, t45, t48, t49, t50, t51, t52, t53, t54, t55, t58, Intersection with reach...229
(forward)formula 0,0,0.04911,5832,1,0,185,11297,141,98,1033,13715,226
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 87 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 87 transition count 115
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 82 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 82 transition count 110
Applied a total of 38 rules in 7 ms. Remains 82 /101 variables (removed 19) and now considering 110/129 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10750415192560158989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3010793731749494445.kers'
[2026-05-24 04:53:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10750415192560158989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3010793731749494445.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 110 rows 80 cols 218 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-24 04:53:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3010793731749494445.kers
Total runtime 0 ms.
[2026-05-24 04:53:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 04:53:06] [INFO ] Invariant cache hit.
[2026-05-24 04:53:06] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-24 04:53:06] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/101 places, 110/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 157 ms. Remains : 81/101 places, 110/129 transitions.
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:06] [INFO ] Input system was already deterministic with 110 transitions.
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:53:06] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5184730345566580203.gal : 1 ms
[2026-05-24 04:53:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5931075574356892293.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/CTLCardinality5184730345566580203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5931075574356892293.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.19651e+10,1.54038,59740,2,15019,5,360739,6,0,423,213857,0


Converting to forward existential form...Done !
original formula: E(AG((EX(!(((p0==0)||(p99==1)))) + (AG(((p13==1)||(p57==1))) * ((p62==0)||(p29==1))))) U ((!(EG((((p101==0)||(p42==1))||(p26==0)))) + AG(...267
=> equivalent forward existential formula: (([(FwdU(Init,!(E(TRUE U !((EX(!(((p0==0)||(p99==1)))) + (!(E(TRUE U !(((p13==1)||(p57==1))))) * ((p62==0)||(p29...772
Reverse transition relation is NOT exact ! Due to transitions t5, t20, t23, t27, t31, t33, t37, t38, t44, t92, t94, t96, t99, t100, t101, t102, t103, t104,...285
Detected timeout of ITS tools.
[2026-05-24 04:53:36] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:53:36] [INFO ] Applying decomposition
[2026-05-24 04:53:36] [INFO ] Flatten gal took : 9 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/graph14946829543044096261.txt' '-o' '/tmp/graph14946829543044096261.bin' '-w' '/tmp/graph14946829543044096261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14946829543044096261.bin' '-l' '-1' '-v' '-w' '/tmp/graph14946829543044096261.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:53:37] [INFO ] Decomposing Gal with order
[2026-05-24 04:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:53:37] [INFO ] Removed a total of 57 redundant transitions.
[2026-05-24 04:53:37] [INFO ] Flatten gal took : 53 ms
[2026-05-24 04:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 6 ms.
[2026-05-24 04:53:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10130759292244125751.gal : 2 ms
[2026-05-24 04:53:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15303476093682283744.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/CTLCardinality10130759292244125751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15303476093682283744.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.19651e+10,0.088852,8560,434,81,9732,1168,191,20737,43,6013,0


Converting to forward existential form...Done !
original formula: E(AG((EX(!(((u2.p0==0)||(i0.u23.p99==1)))) + (AG(((i3.u4.p13==1)||(i7.u14.p57==1))) * ((i8.u15.p62==0)||(i4.u7.p29==1))))) U ((!(EG((((i0...363
=> equivalent forward existential formula: (([(FwdU(Init,!(E(TRUE U !((EX(!(((u2.p0==0)||(i0.u23.p99==1)))) + (!(E(TRUE U !(((i3.u4.p13==1)||(i7.u14.p57==1...976
Reverse transition relation is NOT exact ! Due to transitions t5, t20, t27, t31, t38, t44, t92, t94, t96, i0.u0.t105, i0.u22.t99, i2.t37, i2.t33, i2.u1.t10...369
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
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,5.4685,175408,1,0,303429,10349,1128,680346,210,106530,209994
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Graph (complete) has 282 edges and 101 vertex of which 94 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 94 transition count 114
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 23 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 80 transition count 108
Applied a total of 29 rules in 23 ms. Remains 80 /101 variables (removed 21) and now considering 108/129 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9278338585819872484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12143926170075864173.kers'
[2026-05-24 04:53:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9278338585819872484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12143926170075864173.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 211 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:53:42] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12143926170075864173.kers
Total runtime 0 ms.
[2026-05-24 04:53:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 04:53:42] [INFO ] Invariant cache hit.
[2026-05-24 04:53:42] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-24 04:53:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 161 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/101 places, 108/129 transitions.
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 108
Applied a total of 2 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13147640348646052442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11339636148635643691.kers'
[2026-05-24 04:53:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13147640348646052442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11339636148635643691.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 211 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:53:42] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11339636148635643691.kers
Total runtime 0 ms.
[2026-05-24 04:53:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 04:53:42] [INFO ] Invariant cache hit.
[2026-05-24 04:53:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 04:53:42] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 79/101 places, 108/129 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 333 ms. Remains : 79/101 places, 108/129 transitions.
[2026-05-24 04:53:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:42] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-24 04:53:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:42] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2515988801520159036.gal : 1 ms
[2026-05-24 04:53:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11079156714114913947.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/CTLCardinality2515988801520159036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11079156714114913947.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,3.93216e+09,0.181147,12248,2,2492,5,53983,6,0,413,24730,0


Converting to forward existential form...Done !
original formula: EF(EG((A(!((((p72==0)||(p31==1))&&(p30==1))) U !((((p2==0)||(p49==1))||((p65==0)||(p74==1))))) + ((p74==1) * !(A((p88==1) U ((p74==0)||(p...168
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!((E(!(!((((p2==0)||(p49==1))||((p65==0)||(p74==1))))) U (!(!((((p72==0)||(p31==1))&&(p30...408
Reverse transition relation is NOT exact ! Due to transitions t24, t28, t32, t35, t37, t39, t83, t88, t93, t94, t95, t96, t97, t98, t99, t100, t101, t102, ...272
(forward)formula 0,1,10.5831,334500,1,0,595,1.85545e+06,256,325,2409,2.31097e+06,726
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 93 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 93 transition count 121
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 86 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 80 transition count 108
Applied a total of 42 rules in 16 ms. Remains 80 /101 variables (removed 21) and now considering 108/129 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14681937346051812297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-948500459613582603.kers'
[2026-05-24 04:53:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14681937346051812297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-948500459613582603.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 214 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:53:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-948500459613582603.kers
Total runtime 0 ms.
[2026-05-24 04:53:53] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:53:53] [INFO ] Invariant cache hit.
[2026-05-24 04:53:53] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-24 04:53:53] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 108/129 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 79/101 places, 108/129 transitions.
[2026-05-24 04:53:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:53] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-24 04:53:53] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:53:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:53:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality18386702725491111268.gal : 1 ms
[2026-05-24 04:53:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality3979960297963456111.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/CTLCardinality18386702725491111268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3979960297963456111.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.02498e+10,1.11394,46328,2,11767,5,297068,6,0,413,141475,0


Converting to forward existential form...Done !
original formula: E(EX((p72==1)) U E((p12!=1) U (AG((((p44==0)||(p46==1))||(p17==1))) + EG(AG(((p74==0)||(p77==1)))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,EX((p72==1))),(p12!=1)) * !(E(TRUE U !((((p44==0)||(p46==1))||(p17==1))))))] != FALSE + [FwdG(...242
Reverse transition relation is NOT exact ! Due to transitions t25, t29, t31, t35, t36, t38, t40, t42, t86, t90, t92, t97, t98, t99, t100, t101, t102, t103,...279
Hit Full ! (commute/partial/dont) 106/0/2
(forward)formula 0,1,10.4847,306568,1,0,163,1.74046e+06,250,104,2597,1.56398e+06,237
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Graph (complete) has 282 edges and 101 vertex of which 93 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 100 edges and 90 vertex of which 70 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Graph (trivial) has 77 edges and 70 vertex of which 38 / 70 are part of one of the 19 SCC in 0 ms
Free SCC test removed 19 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 91
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 43 place count 42 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 41 transition count 71
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 53 place count 32 transition count 53
Iterating global reduction 3 with 9 rules applied. Total rules applied 62 place count 32 transition count 53
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 71 place count 23 transition count 35
Iterating global reduction 3 with 9 rules applied. Total rules applied 80 place count 23 transition count 35
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 88 place count 15 transition count 19
Iterating global reduction 3 with 8 rules applied. Total rules applied 96 place count 15 transition count 19
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 7 transition count 11
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 7 transition count 10
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 3 with 2 rules applied. Total rules applied 115 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 4 transition count 7
Applied a total of 117 rules in 17 ms. Remains 4 /101 variables (removed 97) and now considering 7/129 (removed 122) transitions.
[2026-05-24 04:54:04] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2133129709306324614.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11758768283119010774.kers'
[2026-05-24 04:54:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2133129709306324614.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11758768283119010774.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 4 cols 9 entries
Finished phase 1 with 4 SingleSign rule and 0 generalized
[2026-05-24 04:54:04] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11758768283119010774.kers
Total runtime 0 ms.
[2026-05-24 04:54:04] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 04:54:04] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 04:54:04] [INFO ] Invariant cache hit.
[2026-05-24 04:54:04] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2026-05-24 04:54:04] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 04:54:04] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2026-05-24 04:54:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/9 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 4 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[State Equation: 4/4 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/9 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/101 places, 7/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 4/101 places, 7/129 transitions.
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:54:04] [INFO ] Input system was already deterministic with 7 transitions.
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:54:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality410193179860974127.gal : 0 ms
[2026-05-24 04:54:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6715540630249899614.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/CTLCardinality410193179860974127.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6715540630249899614.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,175,0.002802,3828,2,16,5,254,6,0,22,324,0


Converting to forward existential form...Done !
original formula: EF(AG((p78==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p78==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.00436,4096,1,0,23,254,34,11,122,324,22
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 94 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 94 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 89 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 89 transition count 117
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 85 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 85 transition count 113
Applied a total of 32 rules in 6 ms. Remains 85 /101 variables (removed 16) and now considering 113/129 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2362281830017712600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14302752788546431626.kers'
[2026-05-24 04:54:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2362281830017712600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14302752788546431626.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 113 rows 83 cols 222 entries
Finished phase 1 with 83 SingleSign rule and 0 generalized
[2026-05-24 04:54:04] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14302752788546431626.kers
Total runtime 0 ms.
[2026-05-24 04:54:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 04:54:04] [INFO ] Invariant cache hit.
[2026-05-24 04:54:04] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-24 04:54:04] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/101 places, 113/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 84/101 places, 113/129 transitions.
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:54:04] [INFO ] Input system was already deterministic with 113 transitions.
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:54:04] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:54:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12716660651956452793.gal : 1 ms
[2026-05-24 04:54:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality5078017538238356857.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/CTLCardinality12716660651956452793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5078017538238356857.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.37793e+10,0.903769,36584,2,9004,5,207815,6,0,436,131424,0


Converting to forward existential form...Done !
original formula: (A(!(((p17==1) + E((AF((p60==1)) * ((p43==0)||(p57==1))) U ((p39==0)||(p95==1))))) U ((((!(((((p13==1)||(p71==0))||((p81==1)||(p70==1))) ...472
=> equivalent forward existential formula: [(EY((Init * !(!((E(!(((((!(((((p13==1)||(p71==0))||((p81==1)||(p70==1))) * (((!(EX(!((p75==1)))) + (p20==0)) + ...1055
Reverse transition relation is NOT exact ! Due to transitions t11, t14, t21, t24, t28, t34, t38, t39, t43, t100, t101, t102, t103, t104, t105, t106, t107, ...284
Detected timeout of ITS tools.
[2026-05-24 04:54:34] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:54:34] [INFO ] Applying decomposition
[2026-05-24 04:54:34] [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/graph16526313727707270021.txt' '-o' '/tmp/graph16526313727707270021.bin' '-w' '/tmp/graph16526313727707270021.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16526313727707270021.bin' '-l' '-1' '-v' '-w' '/tmp/graph16526313727707270021.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:54:34] [INFO ] Decomposing Gal with order
[2026-05-24 04:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:54:34] [INFO ] Removed a total of 54 redundant transitions.
[2026-05-24 04:54:34] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 2 ms.
[2026-05-24 04:54:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12389548637496837835.gal : 1 ms
[2026-05-24 04:54:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7128660081743358347.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/CTLCardinality12389548637496837835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7128660081743358347.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.37793e+10,0.078583,8148,420,72,8848,907,200,19183,50,3817,0


Converting to forward existential form...Done !
original formula: (A(!(((i2.u4.p17==1) + E((AF((u12.p60==1)) * ((i1.u2.p43==0)||(u12.p57==1))) U ((u8.p39==0)||(i4.u21.p95==1))))) U ((((!(((((i2.u3.p13==1...650
=> equivalent forward existential formula: [(EY((Init * !(!((E(!(((((!(((((i2.u3.p13==1)||(i9.u15.p71==0))||((i10.u18.p81==1)||(u14.p70==1))) * (((!(EX(!((...1423
Reverse transition relation is NOT exact ! Due to transitions t21, t24, u8.t104, i1.t11, i1.u2.t14, i1.u2.t107, i1.u9.t109, i1.u11.t103, i2.u3.t105, i4.t43...394
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,1.99625,92264,1,0,151535,5229,1283,555079,261,22839,148767
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 84 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 84 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 78 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 78 transition count 106
Applied a total of 46 rules in 4 ms. Remains 78 /101 variables (removed 23) and now considering 106/129 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14365059788411432716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13604836671969285065.kers'
[2026-05-24 04:54:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14365059788411432716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13604836671969285065.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 106 rows 76 cols 210 entries
Finished phase 1 with 76 SingleSign rule and 0 generalized
[2026-05-24 04:54:36] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13604836671969285065.kers
Total runtime 0 ms.
[2026-05-24 04:54:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 04:54:36] [INFO ] Invariant cache hit.
[2026-05-24 04:54:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:54:37] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 198 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/101 places, 106/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 77 /77 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 77/101 places, 106/129 transitions.
[2026-05-24 04:54:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:54:37] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:54:37] [INFO ] Input system was already deterministic with 106 transitions.
[2026-05-24 04:54:37] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:54:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:54:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality17047116531988282591.gal : 1 ms
[2026-05-24 04:54:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality11063779397352595535.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/CTLCardinality17047116531988282591.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11063779397352595535.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,8.86886e+09,1.4733,54972,2,14980,5,333319,6,0,403,194127,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((A((p66==0) U (p24==0)) * EF((p2==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((!((E(!((p24==0)) U (!((p66==0)) * !((p24==0)))) + EG(!((p24==0))))) * E(TRUE U (p2...176
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t32, t35, t37, t39, t41, t88, t90, t95, t96, t97, t98, t99, t100, t101, t...277
Detected timeout of ITS tools.
[2026-05-24 04:55:07] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:55:07] [INFO ] Applying decomposition
[2026-05-24 04:55:07] [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/graph10301075792930392913.txt' '-o' '/tmp/graph10301075792930392913.bin' '-w' '/tmp/graph10301075792930392913.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10301075792930392913.bin' '-l' '-1' '-v' '-w' '/tmp/graph10301075792930392913.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:55:07] [INFO ] Decomposing Gal with order
[2026-05-24 04:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:55:07] [INFO ] Removed a total of 58 redundant transitions.
[2026-05-24 04:55:07] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2026-05-24 04:55:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8814603682926837170.gal : 1 ms
[2026-05-24 04:55:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality2914324457245557779.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/CTLCardinality8814603682926837170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2914324457245557779.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,8.86886e+09,0.072095,7592,282,62,6303,654,173,21271,41,3735,0


Converting to forward existential form...Done !
original formula: AF(EX(AG((A((i8.u15.p66==0) U (i4.u7.p24==0)) * EF((i1.u1.p2==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(E(TRUE U !((!((E(!((i4.u7.p24==0)) U (!((i8.u15.p66==0)) * !((i4.u7.p24==0)))) + EG(!((i4.u7.p...207
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t35, t39, t41, t88, t90, i0.u0.t101, i0.u17.t96, i1.u2.t100, i2.t37, i2.t...355
Using 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
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,8.07808,168216,1,0,223436,2220,1054,1.19297e+06,208,27008,116564
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Graph (complete) has 282 edges and 101 vertex of which 94 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 101 edges and 91 vertex of which 73 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 72 edges and 73 vertex of which 34 / 73 are part of one of the 17 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 56 transition count 93
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 42 place count 46 transition count 76
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 49 place count 39 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 56 place count 39 transition count 62
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 33 transition count 50
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 33 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 28 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 28 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 23 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 23 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 23 transition count 33
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 2 with 2 rules applied. Total rules applied 92 place count 22 transition count 32
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 22 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 20 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 20 transition count 30
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 17 transition count 27
Applied a total of 101 rules in 15 ms. Remains 17 /101 variables (removed 84) and now considering 27/129 (removed 102) transitions.
[2026-05-24 04:55:15] [INFO ] Flow matrix only has 23 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-1213699972145734271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4016460589327455008.kers'
[2026-05-24 04:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1213699972145734271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4016460589327455008.kers]
Normalized transition count is 22 out of 23 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 22 rows 17 cols 39 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 04:55:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4016460589327455008.kers
Total runtime 0 ms.
[2026-05-24 04:55:15] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 04:55:15] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2026-05-24 04:55:15] [INFO ] Invariant cache hit.
[2026-05-24 04:55:15] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2026-05-24 04:55:15] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2026-05-24 04:55:15] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2026-05-24 04:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 22/34 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 5/39 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/40 variables, and 17 constraints, problems are : Problem set: 0 solved, 19 unsolved in 149 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 22/34 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 15/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 5/39 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/40 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 187 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 351ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/101 places, 27/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 422 ms. Remains : 17/101 places, 27/129 transitions.
[2026-05-24 04:55:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:55:15] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:55:15] [INFO ] Input system was already deterministic with 27 transitions.
[2026-05-24 04:55:15] [INFO ] Flatten gal took : 13 ms
[2026-05-24 04:55:15] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:55:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality14518125446211725835.gal : 1 ms
[2026-05-24 04:55:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8862666105560730221.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/CTLCardinality14518125446211725835.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8862666105560730221.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,13860,0.00617,3972,2,66,5,687,6,0,85,763,0


Converting to forward existential form...Done !
original formula: (E((p9==1) U EG((p51==0))) * EF(((p86==1) * EG(((p4==0)&&(p29==1))))))
=> equivalent forward existential formula: [FwdG((FwdU((Init * E((p9==1) U EG((p51==0)))),TRUE) * (p86==1)),((p4==0)&&(p29==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t10, t21, t22, t23, t26, Intersection with reachable at each step enabled. (destroye...192
Hit Full ! (commute/partial/dont) 21/6/6
(forward)formula 0,1,0.039667,5772,1,0,204,10394,85,113,531,14590,237
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 92 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 92 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 83 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 83 transition count 111
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 76 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 76 transition count 104
Applied a total of 50 rules in 5 ms. Remains 76 /101 variables (removed 25) and now considering 104/129 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15424281969245631085.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8678501140456290347.kers'
[2026-05-24 04:55:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15424281969245631085.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8678501140456290347.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 104 rows 74 cols 206 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-24 04:55:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8678501140456290347.kers
Total runtime 1 ms.
[2026-05-24 04:55:15] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 04:55:15] [INFO ] Invariant cache hit.
[2026-05-24 04:55:15] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 04:55:16] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 219 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/101 places, 104/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 75/101 places, 104/129 transitions.
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:55:16] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:55:16] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:55:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality14438996409484309764.gal : 1 ms
[2026-05-24 04:55:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13255759502413891950.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/CTLCardinality14438996409484309764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13255759502413891950.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,7.61686e+09,1.72322,64848,2,15892,5,405648,6,0,393,220389,0


Converting to forward existential form...Done !
original formula: EX(EF((EG(AX((p96==1))) * (p36==0))))
=> equivalent forward existential formula: [FwdG((FwdU(EY(Init),TRUE) * (p36==0)),!(EX(!((p96==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t27, t29, t31, t33, t34, t36, t38, t40, t93, t94, t95, t96, t97, t98, t99, t100, t1...270
(forward)formula 0,1,9.80604,276584,1,0,156,1.32274e+06,233,103,2455,1.70918e+06,227
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 93 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 93 transition count 121
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 86 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 86 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 80 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 80 transition count 108
Applied a total of 42 rules in 9 ms. Remains 80 /101 variables (removed 21) and now considering 108/129 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1566947549497854555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10230092698378908481.kers'
[2026-05-24 04:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1566947549497854555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10230092698378908481.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 108 rows 78 cols 214 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:55:25] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10230092698378908481.kers
Total runtime 0 ms.
[2026-05-24 04:55:26] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 04:55:26] [INFO ] Invariant cache hit.
[2026-05-24 04:55:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-24 04:55:26] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 79/101 places, 108/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 79/101 places, 108/129 transitions.
[2026-05-24 04:55:26] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:55:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:55:26] [INFO ] Input system was already deterministic with 108 transitions.
[2026-05-24 04:55:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:55:26] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:55:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality555802940942751661.gal : 1 ms
[2026-05-24 04:55:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9550655647738914855.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/CTLCardinality555802940942751661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9550655647738914855.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,1.02498e+10,1.39538,56560,2,14795,5,348983,6,0,413,196662,0


Converting to forward existential form...Done !
original formula: (AG(A((p44==1) U A(((p87==0)||(p80==1)) U ((p44==0)||(p62==1))))) + AF(AX(((EF((p5==1)) * AG((p24==0))) * EX(((p101==0)||(p32==1)))))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!((E(!(!((E(!(((p44==0)||(p62==1))) U (!(((p87==0)||(p80==1))) * !(((p44==0)||(p62=...565
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t29, t33, t35, t36, t38, t42, t88, t91, t94, t97, t98, t99, t100, t101, t102, t103,...279
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-24 04:55:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:55:56] [INFO ] Applying decomposition
[2026-05-24 04:55:56] [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/graph16073142405482956952.txt' '-o' '/tmp/graph16073142405482956952.bin' '-w' '/tmp/graph16073142405482956952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16073142405482956952.bin' '-l' '-1' '-v' '-w' '/tmp/graph16073142405482956952.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:55:56] [INFO ] Decomposing Gal with order
[2026-05-24 04:55:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:55:56] [INFO ] Removed a total of 58 redundant transitions.
[2026-05-24 04:55:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:55:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 2 ms.
[2026-05-24 04:55:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality15109557026316493817.gal : 1 ms
[2026-05-24 04:55:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16036363482626969826.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/CTLCardinality15109557026316493817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16036363482626969826.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.02498e+10,0.085389,8356,354,61,8913,880,183,19800,41,4368,0


Converting to forward existential form...Done !
original formula: (AG(A((i6.u11.p44==1) U A(((i10.u21.p87==0)||(i9.u19.p80==1)) U ((i6.u11.p44==0)||(i8.u15.p62==1))))) + AF(AX(((EF((i1.u2.p5==1)) * AG((i...213
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!((E(!(!((E(!(((i6.u11.p44==0)||(i8.u15.p62==1))) U (!(((i10.u21.p87==0)||(i9.u19.p...767
Reverse transition relation is NOT exact ! Due to transitions t25, t27, t33, t35, t38, t42, t88, t91, t94, i0.t36, i0.t29, i0.u6.t104, i0.u13.t99, i1.u0.t1...358
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,4.05659,139940,1,0,249695,3918,1127,609688,217,31258,184615
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 93 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 93 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 85 transition count 113
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 85 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 79 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 79 transition count 107
Applied a total of 44 rules in 7 ms. Remains 79 /101 variables (removed 22) and now considering 107/129 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16167995123470369641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12984892142388686639.kers'
[2026-05-24 04:56:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16167995123470369641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12984892142388686639.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 107 rows 77 cols 211 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-24 04:56:00] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12984892142388686639.kers
Total runtime 1 ms.
[2026-05-24 04:56:00] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 04:56:00] [INFO ] Invariant cache hit.
[2026-05-24 04:56:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-24 04:56:00] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/101 places, 107/129 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 78/101 places, 107/129 transitions.
[2026-05-24 04:56:00] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:56:00] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:56:00] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-24 04:56:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:56:00] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:56:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality304766547627562639.gal : 1 ms
[2026-05-24 04:56:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13275014892603704988.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/CTLCardinality304766547627562639.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13275014892603704988.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.19287e+09,1.26665,51224,2,13370,5,312453,6,0,407,174195,0


Converting to forward existential form...Done !
original formula: AG((((!(E(((p0==0)||(p60==1)) U ((p22==0)||(p46==1)))) + AX(((p19==0)||(p17==1)))) + ((p22==0)||((p44==0)&&(p0==1)))) + ((((p89==0)&&(p21...207
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !(((((p89==0)&&(p21==1))&&((p80==0)&&(p39==1)))&&((p49==0)||(p7==1))))) * !(((p22==0)|...270
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t28, t30, t32, t34, t37, t39, t41, t95, t96, t97, t98, t99, t100, t101, t102, t103,...273
(forward)formula 0,0,8.76038,251608,1,0,165,1.24619e+06,240,110,2433,1.57593e+06,235
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 101/101 places, 129/129 transitions.
Graph (complete) has 282 edges and 101 vertex of which 94 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 101 edges and 91 vertex of which 73 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 18 output transitions
Drop transitions (Output transitions of discarded places.) removed 18 transitions
Graph (trivial) has 82 edges and 73 vertex of which 40 / 73 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 53 transition count 92
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 47 place count 42 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 34 transition count 56
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 34 transition count 56
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 26 transition count 40
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 26 transition count 40
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 18 transition count 24
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 18 transition count 24
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 10 transition count 16
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 10 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 10 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 2 with 1 rules applied. Total rules applied 113 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 7 transition count 12
Applied a total of 116 rules in 8 ms. Remains 7 /101 variables (removed 94) and now considering 12/129 (removed 117) transitions.
[2026-05-24 04:56:09] [INFO ] Flow matrix only has 9 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-1790991234811461935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12644610639394253209.kers'
[2026-05-24 04:56:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1790991234811461935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12644610639394253209.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 04:56:09] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12644610639394253209.kers
Total runtime 0 ms.
[2026-05-24 04:56:09] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 04:56:09] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 04:56:09] [INFO ] Invariant cache hit.
[2026-05-24 04:56:09] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 04:56:09] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 04:56:09] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
[2026-05-24 04:56:09] [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) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 58 ms.
Refiners :[State Equation: 7/7 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) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/15 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 68 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in SI_CTL mode, iteration 1 : 7/101 places, 12/129 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 181 ms. Remains : 7/101 places, 12/129 transitions.
[2026-05-24 04:56:09] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:56:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:56:09] [INFO ] Input system was already deterministic with 12 transitions.
RANDOM walk for 119 steps (1 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-10a-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-24 04:56:09] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:56:09] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:56:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9271518040997759716.gal : 0 ms
[2026-05-24 04:56:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11084267018355986137.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9271518040997759716.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11084267018355986137.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 04:56:09] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:56:09] [INFO ] Flatten gal took : 2 ms
Total runtime 195054 ms.

BK_STOP 1779598569628

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

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

Sequence of Actions to be Executed by the VM

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

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

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