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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 8.5K Mar 6 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 6 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 6 16:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 6 16:13 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.8K Mar 15 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Mar 6 16:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Mar 6 16:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:11 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 28K 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-08a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-12
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-13
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-14
FORMULA_NAME DiscoveryGPU-PT-08a-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779595510696

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-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 04:05:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 04:05:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:05:12] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2026-05-24 04:05:12] [INFO ] Transformed 83 places.
[2026-05-24 04:05:12] [INFO ] Transformed 113 transitions.
[2026-05-24 04:05:12] [INFO ] Found NUPN structural information;
[2026-05-24 04:05:12] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 80 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 80 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 80 transition count 102
Applied a total of 14 rules in 21 ms. Remains 80 /83 variables (removed 3) and now considering 102/113 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8742250047135298398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17876039482615050200.kers'
[2026-05-24 04:05:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8742250047135298398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17876039482615050200.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 102 rows 78 cols 198 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-24 04:05:12] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17876039482615050200.kers
Total runtime 1 ms.
[2026-05-24 04:05:12] [INFO ] Implicit Places using invariants in 188 ms returned []
[2026-05-24 04:05:12] [INFO ] Invariant cache hit.
[2026-05-24 04:05:12] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:05:12] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-24 04:05:12] [INFO ] Invariant cache hit.
[2026-05-24 04:05:12] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/182 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 64/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 146 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 102/182 variables, 80/82 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 64/146 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 101/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 247 constraints, problems are : Problem set: 0 solved, 101 unsolved in 2841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5984ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 5998ms
Starting structural reductions in LTL mode, iteration 1 : 80/83 places, 102/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6394 ms. Remains : 80/83 places, 102/113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2026-05-24 04:05:18] [INFO ] Invariant cache hit.
[2026-05-24 04:05:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 04:05:18] [INFO ] Invariant cache hit.
[2026-05-24 04:05:18] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 04:05:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 80/80 places, 102/102 transitions.
Support contains 66 out of 80 places after structural reductions.
[2026-05-24 04:05:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-24 04:05:18] [INFO ] Flatten gal took : 25 ms
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 04:05:18] [INFO ] Flatten gal took : 9 ms
[2026-05-24 04:05:18] [INFO ] Input system was already deterministic with 102 transitions.
Support contains 64 out of 80 places (down from 66) after GAL structural reductions.
RANDOM walk for 40000 steps (458 resets) in 1034 ms. (38 steps per ms) remains 3/64 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (61 resets) in 101 ms. (392 steps per ms) remains 2/3 properties
[2026-05-24 04:05:19] [INFO ] Invariant cache hit.
[2026-05-24 04:05:19] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/39 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 50/89 variables, 24/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 38/127 variables, 16/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 22/149 variables, 11/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 6/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/161 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/161 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 9/170 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/170 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/170 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/174 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/174 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/174 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/176 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/176 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/176 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/178 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/178 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/180 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/180 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/180 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 2/182 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/182 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 80/80 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 26/39 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 8 (OVERLAPS) 50/89 variables, 24/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 18/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 1/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Int declared 127/182 variables, and 91 constraints, problems are : Problem set: 2 solved, 0 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/80 constraints, ReadFeed: 35/64 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2026-05-24 04:05:19] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:05:19] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:05:19] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 68 transition count 90
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 65 transition count 87
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 65 transition count 87
Applied a total of 30 rules in 7 ms. Remains 65 /80 variables (removed 15) and now considering 87/102 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-391401871280096508.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8072059919805432219.kers'
[2026-05-24 04:05:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-391401871280096508.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8072059919805432219.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 87 rows 63 cols 172 entries
Finished phase 1 with 63 SingleSign rule and 0 generalized
[2026-05-24 04:05:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8072059919805432219.kers
Total runtime 0 ms.
[2026-05-24 04:05:19] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 04:05:19] [INFO ] Invariant cache hit.
[2026-05-24 04:05:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 04:05:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [64]
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 : 64/80 places, 87/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 64/80 places, 87/102 transitions.
[2026-05-24 04:05:19] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:05:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:19] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-24 04:05:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:19] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality10772967480146407399.gal : 2 ms
[2026-05-24 04:05:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12071279869877580298.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/CTLCardinality10772967480146407399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12071279869877580298.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12853e+08,0.287461,15996,2,4247,5,77707,6,0,334,47256,0


Converting to forward existential form...Done !
original formula: (AX((p23==1)) + AG((((p20==1) + A((((p25==1)||(p38==0))||(p78==1)) U AF(((p16==0)||(p62==1))))) + EX(EX(((p20==0)||(p50==1)))))))
=> equivalent forward existential formula: ([FwdG((FwdU(((FwdU((Init * !(!(EX(!((p23==1)))))),TRUE) * !(EX(EX(((p20==0)||(p50==1)))))) * !((p20==1))),!(!(E...404
Reverse transition relation is NOT exact ! Due to transitions t12, t17, t21, t23, t25, t27, t29, t32, t73, t76, t78, t79, t80, t81, t82, t83, t84, t85, t86...255
(forward)formula 0,1,2.6299,94868,1,0,248,474021,218,136,2078,609421,329
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 77 transition count 99
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 77 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 74 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 71 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 71 transition count 93
Applied a total of 18 rules in 6 ms. Remains 71 /80 variables (removed 9) and now considering 93/102 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13536606379123412123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6407696663074700612.kers'
[2026-05-24 04:05:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13536606379123412123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6407696663074700612.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 93 rows 69 cols 183 entries
Finished phase 1 with 69 SingleSign rule and 0 generalized
[2026-05-24 04:05:22] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6407696663074700612.kers
Total runtime 1 ms.
[2026-05-24 04:05:22] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 04:05:22] [INFO ] Invariant cache hit.
[2026-05-24 04:05:22] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 04:05:22] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 93/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 70/80 places, 93/102 transitions.
[2026-05-24 04:05:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:22] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-24 04:05:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:22] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality15436772935639772858.gal : 2 ms
[2026-05-24 04:05:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality1163907281721061091.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/CTLCardinality15436772935639772858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1163907281721061091.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.53965e+08,0.142153,10636,2,1992,5,40337,6,0,363,25862,0


Converting to forward existential form...Done !
original formula: (EX(AG((((p62==0)&&(p1==1)) + AG((p52==0))))) + (!(A((E((p18==1) U (p10==1)) + (p67==1)) U ((AF(((p42==0)||(p35==1))) * (A((p81==1) U ((p...266
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !((((p62==0)&&(p1==1)) + !(E(TRUE U !((p52==0)))))))))] != FALSE + [FwdG((Init * !(!((E...1029
Reverse transition relation is NOT exact ! Due to transitions t23, t27, t29, t32, t72, t75, t79, t81, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, In...250
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,17.6934,534300,1,0,1375,2.87977e+06,264,813,2321,4.18086e+06,1696
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 81 edges and 73 vertex of which 59 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 64 edges and 59 vertex of which 32 / 59 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 43 transition count 75
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 37 place count 35 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 29 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 29 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 23 transition count 35
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 23 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 66 place count 18 transition count 25
Iterating global reduction 2 with 5 rules applied. Total rules applied 71 place count 18 transition count 25
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 13 transition count 20
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 13 transition count 20
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 82 place count 13 transition count 19
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 84 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 9 transition count 15
Applied a total of 87 rules in 29 ms. Remains 9 /80 variables (removed 71) and now considering 15/102 (removed 87) transitions.
[2026-05-24 04:05:40] [INFO ] Flow matrix only has 11 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-12917385777649813242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5763902927882228314.kers'
[2026-05-24 04:05:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12917385777649813242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5763902927882228314.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 9 cols 17 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-24 04:05:40] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5763902927882228314.kers
Total runtime 0 ms.
[2026-05-24 04:05:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-24 04:05:40] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2026-05-24 04:05:40] [INFO ] Invariant cache hit.
[2026-05-24 04:05:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-24 04:05:40] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-24 04:05:40] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
[2026-05-24 04:05:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/19 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 86 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/19 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 77 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 166ms
Starting structural reductions in SI_CTL mode, iteration 1 : 9/80 places, 15/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 246 ms. Remains : 9/80 places, 15/102 transitions.
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:05:40] [INFO ] Input system was already deterministic with 15 transitions.
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9873518410980518273.gal : 0 ms
[2026-05-24 04:05:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5017503111434747464.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/CTLCardinality9873518410980518273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5017503111434747464.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,546,0.002921,3808,2,22,5,193,6,0,43,209,0


Converting to forward existential form...Done !
original formula: AG(EF(((p17==0)||(p21==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p17==0)||(p21==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t12, t14, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,1,0.005405,4084,1,0,34,557,46,16,229,538,38
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 71 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 71 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 69 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 69 transition count 91
Applied a total of 22 rules in 6 ms. Remains 69 /80 variables (removed 11) and now considering 91/102 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5472529333955060833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12128649719162655524.kers'
[2026-05-24 04:05:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5472529333955060833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12128649719162655524.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 91 rows 67 cols 179 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:05:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12128649719162655524.kers
Total runtime 0 ms.
[2026-05-24 04:05:40] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 04:05:40] [INFO ] Invariant cache hit.
[2026-05-24 04:05:40] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 04:05:40] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 117 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/80 places, 91/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 68/80 places, 91/102 transitions.
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:40] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:40] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality5096088029024098624.gal : 1 ms
[2026-05-24 04:05:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5775457432400592377.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/CTLCardinality5096088029024098624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5775457432400592377.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.38575e+08,0.240961,14660,2,3624,5,65022,6,0,353,40753,0


Converting to forward existential form...Done !
original formula: ((A(AF(!(((((p23!=1) + A(((p29==0)||(p69==1)) U (p39==0))) * ((p71==0)||(p72==1))) * !(((p44==0)||(p24==1)))))) U (p12==1)) + EX((AG((p55...210
=> equivalent forward existential formula: (([((Init * !(EG(!((p12==1))))) * !(E(!((p12==1)) U (!(!(EG(!(!(((((p23!=1) + !((E(!((p39==0)) U (!(((p29==0)||(...448
Reverse transition relation is NOT exact ! Due to transitions t24, t26, t30, t33, t35, t74, t76, t77, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, In...250
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.3227,393920,1,0,767,2.26554e+06,237,425,2270,2.83318e+06,934
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 96
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 68 transition count 90
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 68 transition count 90
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 66 transition count 88
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 66 transition count 88
Applied a total of 28 rules in 6 ms. Remains 66 /80 variables (removed 14) and now considering 88/102 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1293728932845627672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8402191324086321745.kers'
[2026-05-24 04:05:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1293728932845627672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8402191324086321745.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 88 rows 64 cols 173 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-24 04:05:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8402191324086321745.kers
Total runtime 0 ms.
[2026-05-24 04:05:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 04:05:53] [INFO ] Invariant cache hit.
[2026-05-24 04:05:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 04:05:53] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/80 places, 88/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 196 ms. Remains : 65/80 places, 88/102 transitions.
[2026-05-24 04:05:53] [INFO ] Flatten gal took : 13 ms
[2026-05-24 04:05:53] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:53] [INFO ] Input system was already deterministic with 88 transitions.
[2026-05-24 04:05:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:05:53] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:05:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality816985037122783006.gal : 0 ms
[2026-05-24 04:05:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality4623922790065383988.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/CTLCardinality816985037122783006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4623922790065383988.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.16537e+08,0.370102,19600,2,5161,5,99216,6,0,338,61258,0


Converting to forward existential form...Done !
original formula: EF(((EX((p31==0)) * EG(((p28==0)&&(p23==1)))) * (p75==0)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * (p75==0)) * EX((p31==0))),((p28==0)&&(p23==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t17, t21, t23, t27, t29, t32, t34, t78, t79, t80, t81, t82, t83, t84, t85, t86, t87, In...250
Hit Full ! (commute/partial/dont) 83/5/5
(forward)formula 0,1,2.29763,82520,1,0,135,399302,203,86,2103,506460,192
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 58 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 60 edges and 58 vertex of which 30 / 58 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 43 transition count 76
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 33 place count 37 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 36 transition count 60
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 40 place count 30 transition count 48
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 30 transition count 48
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 52 place count 24 transition count 36
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 24 transition count 36
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 20 transition count 28
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 20 transition count 28
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 70 place count 16 transition count 24
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 16 transition count 24
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 75 place count 16 transition count 23
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 77 place count 15 transition count 22
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 11 transition count 18
Applied a total of 81 rules in 8 ms. Remains 11 /80 variables (removed 69) and now considering 18/102 (removed 84) transitions.
[2026-05-24 04:05:55] [INFO ] Flow matrix only has 14 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-6218437569850228701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4585215031487248749.kers'
[2026-05-24 04:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6218437569850228701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4585215031487248749.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 11 cols 23 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-24 04:05:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4585215031487248749.kers
Total runtime 0 ms.
[2026-05-24 04:05:55] [INFO ] Implicit Places using invariants in 13 ms returned []
[2026-05-24 04:05:55] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2026-05-24 04:05:55] [INFO ] Invariant cache hit.
[2026-05-24 04:05:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 04:05:55] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2026-05-24 04:05:55] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
[2026-05-24 04:05:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 11 unsolved in 96 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/24 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 22 constraints, problems are : Problem set: 0 solved, 11 unsolved in 130 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Starting structural reductions in SI_CTL mode, iteration 1 : 11/80 places, 18/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 283 ms. Remains : 11/80 places, 18/102 transitions.
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:56] [INFO ] Input system was already deterministic with 18 transitions.
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:05:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17894759987191251827.gal : 0 ms
[2026-05-24 04:05:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5772243743301089768.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/CTLCardinality17894759987191251827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5772243743301089768.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,1350,0.00333,3872,2,35,5,396,6,0,54,346,0


Converting to forward existential form...Done !
original formula: EF((AF(AG(((p7==0)||(p78==1)))) + EF((p52==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((p7==0)||(p78==1)))))))))] != FALSE + [(FwdU(FwdU(Init,TRUE),TRUE) * (...174
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t14, t16, t17, Intersection with reachable at each step enabled. (destroyed/reverse...183
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.008314,4156,1,0,48,1546,61,30,323,1576,62
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 67 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 67 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 64 transition count 86
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 64 transition count 86
Applied a total of 32 rules in 7 ms. Remains 64 /80 variables (removed 16) and now considering 86/102 (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-14707323104286505829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14610894239185774110.kers'
[2026-05-24 04:05:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14707323104286505829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14610894239185774110.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 86 rows 62 cols 170 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-24 04:05:56] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14610894239185774110.kers
Total runtime 0 ms.
[2026-05-24 04:05:56] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 04:05:56] [INFO ] Invariant cache hit.
[2026-05-24 04:05:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 04:05:56] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/80 places, 86/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 171 ms. Remains : 63/80 places, 86/102 transitions.
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 5 ms
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:56] [INFO ] Input system was already deterministic with 86 transitions.
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality6631116288662112514.gal : 0 ms
[2026-05-24 04:05:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1535848392973557602.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/CTLCardinality6631116288662112514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1535848392973557602.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.04554e+08,0.224069,13792,2,3214,5,62505,6,0,329,37589,0


Converting to forward existential form...Done !
original formula: AG(AX(E(((p66==0)&&((p34==0)||(p72==1))) U ((p4==0)||(p47==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(((p66==0)&&((p34==0)||(p72==1))) U ((p4==0)||(p47==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t22, t24, t26, t28, t29, t31, t33, t68, t73, t77, t78, t79, t80, t81, t82, t83, t84, t85, In...250
(forward)formula 0,0,1.78163,61048,1,0,136,273715,192,86,1937,409070,190
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 62 transition count 84
Applied a total of 27 rules in 17 ms. Remains 62 /80 variables (removed 18) and now considering 84/102 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14855109520018347977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18336455421573519742.kers'
[2026-05-24 04:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14855109520018347977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18336455421573519742.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 84 rows 60 cols 165 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 04:05:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18336455421573519742.kers
Total runtime 0 ms.
[2026-05-24 04:05:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 04:05:58] [INFO ] Invariant cache hit.
[2026-05-24 04:05:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 04:05:58] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/80 places, 84/102 transitions.
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 61 transition count 84
Applied a total of 3 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (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-10072955689100081663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16941747016635120721.kers'
[2026-05-24 04:05:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10072955689100081663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16941747016635120721.kers]
Normalized transition count is 83 out of 84 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 83 rows 60 cols 163 entries
Finished phase 1 with 60 SingleSign rule and 0 generalized
[2026-05-24 04:05:58] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16941747016635120721.kers
Total runtime 0 ms.
[2026-05-24 04:05:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 04:05:58] [INFO ] Invariant cache hit.
[2026-05-24 04:05:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 04:05:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/80 places, 84/102 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 234 ms. Remains : 61/80 places, 84/102 transitions.
[2026-05-24 04:05:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:58] [INFO ] Input system was already deterministic with 84 transitions.
[2026-05-24 04:05:58] [INFO ] Flatten gal took : 6 ms
[2026-05-24 04:05:58] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality731191170601056037.gal : 1 ms
[2026-05-24 04:05:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10833934300498779109.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/CTLCardinality731191170601056037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10833934300498779109.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,3.93216e+07,0.093692,8296,2,1608,5,28635,6,0,320,14857,0


Converting to forward existential form...Done !
original formula: E(((AF(!(E(AG((p70==0)) U EG(((p81==0)||(p64==1)))))) + (p17==0)) + (p39==1)) U AG((AG(EF((p49==1))) * !(AG(((p2==1)&&(p80==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,((!(EG(!(!(E(!(E(TRUE U !((p70==0)))) U EG(((p81==0)||(p64==1)))))))) + (p17==0)) + (p39==1))) * !(E...256
Reverse transition relation is NOT exact ! Due to transitions t18, t20, t21, t23, t26, t28, t29, t68, t72, t73, t74, t75, t76, t77, t78, t79, t80, Interse...245
(forward)formula 0,0,0.705821,31436,1,0,125,150696,190,81,1854,137578,188
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Graph (complete) has 225 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 61 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 63 edges and 61 vertex of which 30 / 61 are part of one of the 15 SCC in 1 ms
Free SCC test removed 15 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 46 transition count 78
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 39 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 38 transition count 62
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 40 place count 34 transition count 54
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 34 transition count 54
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 48 place count 30 transition count 46
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 30 transition count 46
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 56 place count 26 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 26 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 22 transition count 34
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 22 transition count 34
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 69 place count 22 transition count 33
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 22 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 21 transition count 32
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 75 place count 17 transition count 28
Applied a total of 75 rules in 20 ms. Remains 17 /80 variables (removed 63) and now considering 28/102 (removed 74) transitions.
[2026-05-24 04:05:59] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10347271039147274242.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11209821418976789337.kers'
[2026-05-24 04:05:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10347271039147274242.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11209821418976789337.kers]
Normalized transition count is 21 out of 22 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 21 rows 17 cols 35 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-24 04:05:59] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11209821418976789337.kers
Total runtime 1 ms.
[2026-05-24 04:05:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-24 04:05:59] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2026-05-24 04:05:59] [INFO ] Invariant cache hit.
[2026-05-24 04:05:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-24 04:05:59] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2026-05-24 04:05:59] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2026-05-24 04:05:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 4/38 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/39 variables, and 17 constraints, problems are : Problem set: 0 solved, 21 unsolved in 191 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 21/34 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 4/38 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/39 variables, and 38 constraints, problems are : Problem set: 0 solved, 21 unsolved in 176 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 368ms
Starting structural reductions in SI_CTL mode, iteration 1 : 17/80 places, 28/102 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 452 ms. Remains : 17/80 places, 28/102 transitions.
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:59] [INFO ] Input system was already deterministic with 28 transitions.
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 0 ms
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 1 ms
[2026-05-24 04:05:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7378985385856335253.gal : 1 ms
[2026-05-24 04:05:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12031723825281566204.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/CTLCardinality7378985385856335253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12031723825281566204.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,4410,0.005192,3868,2,35,5,179,6,0,82,150,0


Converting to forward existential form...Done !
original formula: EG((EF(EG(((p13!=0)&&(p68!=1)))) + ((p62!=0)&&(p42!=1))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U EG(((p13!=0)&&(p68!=1)))) + ((p62!=0)&&(p42!=1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroye...192
(forward)formula 0,1,0.023111,4896,1,0,115,4736,81,84,463,8138,145
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 72 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 72 transition count 94
Applied a total of 16 rules in 2 ms. Remains 72 /80 variables (removed 8) and now considering 94/102 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16296831969362951799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14314615437606460186.kers'
[2026-05-24 04:05:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16296831969362951799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14314615437606460186.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 94 rows 70 cols 185 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-24 04:05:59] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14314615437606460186.kers
Total runtime 0 ms.
[2026-05-24 04:05:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-24 04:05:59] [INFO ] Invariant cache hit.
[2026-05-24 04:05:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2026-05-24 04:05:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 111 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 71/80 places, 94/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 71/80 places, 94/102 transitions.
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 4 ms
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:05:59] [INFO ] Input system was already deterministic with 94 transitions.
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:59] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:05:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality4926165694674430344.gal : 1 ms
[2026-05-24 04:05:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7550784116483606953.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/CTLCardinality4926165694674430344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7550784116483606953.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.6245e+08,0.347809,17368,2,4309,5,83861,6,0,368,52120,0


Converting to forward existential form...Done !
original formula: (!(A((AF((p29==0)) * !(E(((p65==0)||(p58==1)) U ((p79==0)||(p32==1))))) U AG(((p15==1) * AF((p30==1)))))) * !(E((EX((((p67==0)||(p73==1))...295
=> equivalent forward existential formula: ([((Init * !(EG(!(!(E(TRUE U !(((p15==1) * !(EG(!((p30==1)))))))))))) * !(E(!(!(E(TRUE U !(((p15==1) * !(EG(!((p...521
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t26, t30, t35, t74, t76, t78, t82, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93,...254
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,23.1846,591740,1,0,785,3.17265e+06,236,508,2318,4.14695e+06,876
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 102/102 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 70 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 70 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 69 transition count 91
Applied a total of 22 rules in 3 ms. Remains 69 /80 variables (removed 11) and now considering 91/102 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14124969277044988412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17907404132835956994.kers'
[2026-05-24 04:06:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14124969277044988412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17907404132835956994.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 91 rows 67 cols 179 entries
Finished phase 1 with 67 SingleSign rule and 0 generalized
[2026-05-24 04:06:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17907404132835956994.kers
Total runtime 1 ms.
[2026-05-24 04:06:23] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-24 04:06:23] [INFO ] Invariant cache hit.
[2026-05-24 04:06:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 04:06:23] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/80 places, 91/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 68/80 places, 91/102 transitions.
[2026-05-24 04:06:23] [INFO ] Flatten gal took : 17 ms
[2026-05-24 04:06:23] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:06:23] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-24 04:06:23] [INFO ] Flatten gal took : 2 ms
[2026-05-24 04:06:23] [INFO ] Flatten gal took : 3 ms
[2026-05-24 04:06:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality18184956547392560931.gal : 1 ms
[2026-05-24 04:06:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality8076942798158157609.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/CTLCardinality18184956547392560931.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8076942798158157609.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.40467e+08,0.21479,13480,2,3266,5,59813,6,0,353,36824,0


Converting to forward existential form...Done !
original formula: EG(E(!((EF((p22==1)) * AX((p47==1)))) U ((A(AF((p79==1)) U (((p3==0)||(p59==1))&&(p21==1))) * A((p33==1) U ((p23==0)||(p30==1)))) * E(((p...186
=> equivalent forward existential formula: [FwdG(Init,E(!((E(TRUE U (p22==1)) * !(EX(!((p47==1)))))) U ((!((E(!((((p3==0)||(p59==1))&&(p21==1))) U (!(!(EG(...407
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t19, t23, t25, t29, t36, t75, t78, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90...255
(forward)formula 0,1,27.3575,797892,1,0,1315,4.30361e+06,238,710,2161,6.02759e+06,1445
FORMULA DiscoveryGPU-PT-08a-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-24 04:06:50] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:06:50] [INFO ] Flatten gal took : 5 ms
Total runtime 99052 ms.

BK_STOP 1779595610970

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

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

Sequence of Actions to be Executed by the VM

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

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

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