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.r354-tall-178024402700001.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 LastZero-COL-N08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402700001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.0K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 15K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_pt
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 5 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 28K Jun 10 17:28 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 LastZero-COL-N08-CTLCardinality-2024-00
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-01
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-02
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-03
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-04
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-05
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-06
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-07
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-08
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-09
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-10
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-11
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-12
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-13
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-14
FORMULA_NAME LastZero-COL-N08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781118168796

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-COL-N08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202604301425
[2026-06-10 19:02:49] [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-06-10 19:02:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 19:02:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-06-10 19:02:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-06-10 19:02:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 544 ms
[2026-06-10 19:02:50] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 180 PT places and 891.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2026-06-10 19:02:50] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 11 arcs in 4 ms.
[2026-06-10 19:02:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA LastZero-COL-N08-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 2 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
FORMULA LastZero-COL-N08-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-COL-N08-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40012 steps (2104 resets) in 733 ms. (54 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4004 steps (124 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 52 ms. (75 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 59 ms. (66 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 60 ms. (65 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (124 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (128 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9056132784428566084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11549792845788470063.kers'
[2026-06-10 19:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9056132784428566084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11549792845788470063.kers]
Normalized transition count is 2 out of 3 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 2 rows 2 cols 3 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-06-10 19:02:51] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11549792845788470063.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 2 constraints, problems are : Problem set: 21 solved, 0 unsolved in 192 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 21 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 21 atomic propositions for a total of 10 simplifications.
[2026-06-10 19:02:51] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-06-10 19:02:51] [INFO ] Flatten gal took : 15 ms
FORMULA LastZero-COL-N08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-10 19:02:51] [INFO ] Flatten gal took : 1 ms
Domain [ID(9), ID(9)] of place array breaks symmetries in sort ID
[2026-06-10 19:02:51] [INFO ] Unfolded HLPN to a Petri net with 180 places and 857 transitions 2699 arcs in 29 ms.
[2026-06-10 19:02:51] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 82 places in 4 ms
Reduce places removed 82 places and 545 transitions.
Reduce places removed 1 places and 0 transitions.
Support contains 44 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 312/312 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 312
Applied a total of 1 rules in 14 ms. Remains 96 /97 variables (removed 1) and now considering 312/312 (removed 0) transitions.
[2026-06-10 19:02:51] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5470323566479122830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11513508127019715907.kers'
[2026-06-10 19:02:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5470323566479122830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11513508127019715907.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 95 cols 734 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-10 19:02:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11513508127019715907.kers
Total runtime 5 ms.
[2026-06-10 19:02:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-06-10 19:02:51] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 19:02:51] [INFO ] Invariant cache hit.
[2026-06-10 19:02:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-10 19:02:52] [INFO ] Implicit Places using invariants and state equation in 422 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 568 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 95/97 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 597 ms. Remains : 95/97 places, 312/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2026-06-10 19:02:52] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12560490233030327711.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12050709037478899859.kers'
[2026-06-10 19:02:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12560490233030327711.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12050709037478899859.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 284 rows 94 cols 726 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-06-10 19:02:52] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12050709037478899859.kers
Total runtime 2 ms.
[2026-06-10 19:02:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-06-10 19:02:52] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 19:02:52] [INFO ] Invariant cache hit.
[2026-06-10 19:02:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-06-10 19:02:52] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2026-06-10 19:02:52] [INFO ] Flow matrix only has 284 transitions (discarded 28 similar events)
[2026-06-10 19:02:52] [INFO ] Invariant cache hit.
[2026-06-10 19:02:52] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 2 (OVERLAPS) 284/378 variables, 94/101 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 72/173 constraints. Problems are: Problem set: 203 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 0/173 constraints. Problems are: Problem set: 203 solved, 101 unsolved
Problem TDEAD37 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/379 variables, 1/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/174 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 174 constraints, problems are : Problem set: 204 solved, 100 unsolved in 9292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 204 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 284/378 variables, 94/101 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 72/173 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 100/273 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/273 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 1/379 variables, 1/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/379 variables, 0/274 constraints. Problems are: Problem set: 204 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 274 constraints, problems are : Problem set: 204 solved, 100 unsolved in 7119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 100/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16502ms problems are : Problem set: 204 solved, 100 unsolved
Search for dead transitions found 204 dead transitions in 16507ms
Found 204 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 204 transitions
Dead transitions reduction (with SMT) removed 204 transitions
Starting structural reductions in LTL mode, iteration 1 : 95/95 places, 108/312 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 88 transition count 101
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 88 transition count 101
Applied a total of 14 rules in 8 ms. Remains 88 /95 variables (removed 7) and now considering 101/108 (removed 7) transitions.
[2026-06-10 19:03:09] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5255645157974911484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3589702177277397257.kers'
[2026-06-10 19:03:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5255645157974911484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3589702177277397257.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 87 cols 186 entries
Finished phase 1 with 72 SingleSign rule and 1 generalized
[2026-06-10 19:03:09] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3589702177277397257.kers
Total runtime 0 ms.
[2026-06-10 19:03:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-10 19:03:09] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:09] [INFO ] Invariant cache hit.
[2026-06-10 19:03:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:09] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/95 places, 101/312 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17013 ms. Remains : 88/95 places, 101/312 transitions.
Support contains 44 out of 88 places after structural reductions.
[2026-06-10 19:03:09] [INFO ] Flatten gal took : 13 ms
[2026-06-10 19:03:09] [INFO ] Flatten gal took : 11 ms
[2026-06-10 19:03:09] [INFO ] Input system was already deterministic with 101 transitions.
RANDOM walk for 40000 steps (1600 resets) in 1060 ms. (37 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40003 steps (293 resets) in 263 ms. (151 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (292 resets) in 230 ms. (173 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (293 resets) in 255 ms. (156 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (294 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (374 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (294 resets) in 190 ms. (209 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (372 resets) in 159 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (293 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (373 resets) in 191 ms. (208 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (292 resets) in 106 ms. (373 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (372 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (372 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (372 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (371 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
[2026-06-10 19:03:10] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:10] [INFO ] Invariant cache hit.
[2026-06-10 19:03:10] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 28/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 6/78 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/79 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Real declared 80/168 variables, and 24 constraints, problems are : Problem set: 14 solved, 0 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/36 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 14 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 14 atomic propositions for a total of 9 simplifications.
[2026-06-10 19:03:11] [INFO ] Flatten gal took : 6 ms
[2026-06-10 19:03:11] [INFO ] Flatten gal took : 6 ms
[2026-06-10 19:03:11] [INFO ] Input system was already deterministic with 101 transitions.
Computed a total of 88 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 88 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA LastZero-COL-N08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 69 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 69 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 64 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 64 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 59 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 59 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 55 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 55 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 51 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 51 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 48 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 48 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 45 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 45 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 43 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 43 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 41 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 41 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 40 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 40 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 39 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 39 transition count 31
Applied a total of 98 rules in 14 ms. Remains 39 /88 variables (removed 49) and now considering 31/101 (removed 70) transitions.
[2026-06-10 19:03:11] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18171223528663562660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4207026502746535729.kers'
[2026-06-10 19:03:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18171223528663562660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4207026502746535729.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 24 rows 32 cols 47 entries
Finished phase 1 with 17 SingleSign rule and 7 generalized
[2026-06-10 19:03:11] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4207026502746535729.kers
Total runtime 0 ms.
[2026-06-10 19:03:11] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-06-10 19:03:11] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:11] [INFO ] Invariant cache hit.
[2026-06-10 19:03:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:11] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2026-06-10 19:03:11] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:11] [INFO ] Invariant cache hit.
[2026-06-10 19:03:11] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 62 constraints, problems are : Problem set: 0 solved, 23 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 85 constraints, problems are : Problem set: 0 solved, 23 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 641ms
Starting structural reductions in LTL mode, iteration 1 : 39/88 places, 31/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 39/88 places, 31/101 transitions.
[2026-06-10 19:03:12] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:12] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:12] [INFO ] Input system was already deterministic with 31 transitions.
[2026-06-10 19:03:12] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:12] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2897112728985711145.gal : 2 ms
[2026-06-10 19:03:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15162565469348897988.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2897112728985711145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15162565469348897988.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,9841,0.014406,3932,2,123,5,504,6,0,158,355,0


Converting to forward existential form...Done !
original formula: EG(A(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))>1) U AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(FALSE)))) U (!(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(...242
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, Intersection with reachable at each step enable...204
(forward)formula 0,0,0.053365,6208,1,0,139,13771,87,68,980,14485,136
FORMULA LastZero-COL-N08-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:12] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4248394152087588274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3382618648109678671.kers'
[2026-06-10 19:03:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4248394152087588274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3382618648109678671.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 87 cols 186 entries
Finished phase 1 with 72 SingleSign rule and 1 generalized
[2026-06-10 19:03:12] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3382618648109678671.kers
Total runtime 1 ms.
[2026-06-10 19:03:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-06-10 19:03:12] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:12] [INFO ] Invariant cache hit.
[2026-06-10 19:03:12] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:12] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-06-10 19:03:12] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:12] [INFO ] Invariant cache hit.
[2026-06-10 19:03:12] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 171 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 93/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3338 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8363ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8365ms
Finished structural reductions in LTL mode , in 1 iterations and 8527 ms. Remains : 88/88 places, 101/101 transitions.
[2026-06-10 19:03:20] [INFO ] Flatten gal took : 7 ms
[2026-06-10 19:03:20] [INFO ] Flatten gal took : 5 ms
[2026-06-10 19:03:20] [INFO ] Input system was already deterministic with 101 transitions.
[2026-06-10 19:03:20] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:20] [INFO ] Flatten gal took : 5 ms
[2026-06-10 19:03:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality12131793286380129967.gal : 3 ms
[2026-06-10 19:03:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18201462023715539238.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/CTLCardinality12131793286380129967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18201462023715539238.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,40910,0.021079,4632,2,868,5,2295,6,0,382,1137,0


Converting to forward existential form...Done !
original formula: !(A(EX(TRUE) U EX((((((((tmp_10+tmp_19)+(tmp_20+tmp_28))+((tmp_29+tmp_30)+(tmp_37+tmp_38)))+(((tmp_39+tmp_40)+(tmp_46+tmp_47))+((tmp_48+t...365
=> equivalent forward existential formula: ([((FwdU(Init,!(EX((((((((tmp_10+tmp_19)+(tmp_20+tmp_28))+((tmp_29+tmp_30)+(tmp_37+tmp_38)))+(((tmp_39+tmp_40)+(...1112
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54...346
(forward)formula 0,0,0.299771,18200,1,0,278,75602,227,112,2857,57539,242
FORMULA LastZero-COL-N08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 69 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 69 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 64 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 64 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 59 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 59 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 55 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 55 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 51 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 51 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 48 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 48 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 45 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 45 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 43 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 43 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 41 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 41 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 40 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 40 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 39 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 39 transition count 31
Applied a total of 98 rules in 20 ms. Remains 39 /88 variables (removed 49) and now considering 31/101 (removed 70) transitions.
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8068335761680656510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12382819616179307489.kers'
[2026-06-10 19:03:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8068335761680656510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12382819616179307489.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 24 rows 32 cols 47 entries
Finished phase 1 with 17 SingleSign rule and 7 generalized
[2026-06-10 19:03:21] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12382819616179307489.kers
Total runtime 0 ms.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 62 constraints, problems are : Problem set: 0 solved, 23 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 85 constraints, problems are : Problem set: 0 solved, 23 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 612ms
Starting structural reductions in LTL mode, iteration 1 : 39/88 places, 31/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 39/88 places, 31/101 transitions.
[2026-06-10 19:03:21] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:21] [INFO ] Flatten gal took : 3 ms
[2026-06-10 19:03:21] [INFO ] Input system was already deterministic with 31 transitions.
[2026-06-10 19:03:21] [INFO ] Flatten gal took : 1 ms
[2026-06-10 19:03:21] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality343366880684571979.gal : 1 ms
[2026-06-10 19:03:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality10794402772058226852.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/CTLCardinality343366880684571979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10794402772058226852.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,9841,0.006521,4028,2,123,5,504,6,0,158,355,0


Converting to forward existential form...Done !
original formula: AX(EX(TRUE))
=> equivalent forward existential formula: [(EY(Init) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, t16, t17, t18, t19, t20, t21, t22, t23, Intersection with reachable at each step enable...204
(forward)formula 0,1,0.018819,4792,1,0,82,6006,77,36,919,3951,69
FORMULA LastZero-COL-N08-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 69 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 69 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 64 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 64 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 59 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 59 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 55 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 55 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 51 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 51 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 48 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 48 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 45 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 45 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 43 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 43 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 41 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 41 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 40 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 40 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 39 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 39 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 38 transition count 30
Applied a total of 100 rules in 22 ms. Remains 38 /88 variables (removed 50) and now considering 30/101 (removed 71) transitions.
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13551226506453794023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16694890347195212114.kers'
[2026-06-10 19:03:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13551226506453794023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16694890347195212114.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 23 rows 30 cols 44 entries
Finished phase 1 with 16 SingleSign rule and 7 generalized
[2026-06-10 19:03:21] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16694890347195212114.kers
Total runtime 0 ms.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:21] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2026-06-10 19:03:21] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2026-06-10 19:03:21] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2026-06-10 19:03:21] [INFO ] Invariant cache hit.
[2026-06-10 19:03:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 23/61 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 23/61 variables, 38/53 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/61 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 83 constraints, problems are : Problem set: 0 solved, 22 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 612ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/88 places, 30/101 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 712 ms. Remains : 38/88 places, 30/101 transitions.
[2026-06-10 19:03:22] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:22] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:22] [INFO ] Input system was already deterministic with 30 transitions.
[2026-06-10 19:03:22] [INFO ] Flatten gal took : 1 ms
[2026-06-10 19:03:22] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality8993794959407011634.gal : 0 ms
[2026-06-10 19:03:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12360133825344539957.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/CTLCardinality8993794959407011634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12360133825344539957.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,7654,0.00598,4016,2,120,5,508,6,0,153,361,0


Converting to forward existential form...Done !
original formula: AF(EG(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))<1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))<1...168
Reverse transition relation is NOT exact ! Due to transitions t13, t14, t15, t16, t17, t18, t19, t20, t28, t29, Intersection with reachable at each step e...210
dead was empty
(forward)formula 0,1,0.044834,6244,1,0,188,14070,81,82,953,13586,185
FORMULA LastZero-COL-N08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:22] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13014595603682006172.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4457742008514017049.kers'
[2026-06-10 19:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13014595603682006172.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4457742008514017049.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 80 rows 87 cols 186 entries
Finished phase 1 with 72 SingleSign rule and 1 generalized
[2026-06-10 19:03:22] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4457742008514017049.kers
Total runtime 1 ms.
[2026-06-10 19:03:22] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-06-10 19:03:22] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:22] [INFO ] Invariant cache hit.
[2026-06-10 19:03:22] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:22] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2026-06-10 19:03:22] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:22] [INFO ] Invariant cache hit.
[2026-06-10 19:03:22] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 171 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 1/88 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 80/168 variables, 88/135 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 36/171 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 93/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/168 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 264 constraints, problems are : Problem set: 0 solved, 93 unsolved in 3474 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8530ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 8531ms
Finished structural reductions in LTL mode , in 1 iterations and 8676 ms. Remains : 88/88 places, 101/101 transitions.
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 9 ms
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 5 ms
[2026-06-10 19:03:31] [INFO ] Input system was already deterministic with 101 transitions.
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1132846433344309644.gal : 1 ms
[2026-06-10 19:03:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality335936983219240051.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/CTLCardinality1132846433344309644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality335936983219240051.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,40910,0.020215,4620,2,868,5,2295,6,0,382,1137,0


Converting to forward existential form...Done !
original formula: EG(E(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))<=((((((tmp_10+tmp_19)+(tmp_20+tmp_28)...454
=> equivalent forward existential formula: [FwdG(Init,E(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))<=(((...497
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54...346
dead was empty
(forward)formula 0,0,0.297485,18164,1,0,277,71592,223,109,4217,54486,242
FORMULA LastZero-COL-N08-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:31] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:31] [INFO ] Invariant cache hit.
[2026-06-10 19:03:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-06-10 19:03:31] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:31] [INFO ] Invariant cache hit.
[2026-06-10 19:03:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 88/88 places, 101/101 transitions.
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 6 ms
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:31] [INFO ] Input system was already deterministic with 101 transitions.
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:31] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality3126954333910537501.gal : 1 ms
[2026-06-10 19:03:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality10492339136765192474.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/CTLCardinality3126954333910537501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10492339136765192474.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,40910,0.020231,4640,2,868,5,2295,6,0,382,1137,0


Converting to forward existential form...Done !
original formula: EF((AF(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(process_7+process_8)))>=8)) * ((EG((((((((tmp_10+tmp_19)+(...595
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !(EG(!(((((process_1+process_2)+(process_3+process_4))+((process_5+process_6)+(proces...958
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54...346
Hit Full ! (commute/partial/dont) 29/0/72
(forward)formula 0,1,0.513484,29188,1,0,361,138046,232,180,3214,127896,382
FORMULA LastZero-COL-N08-CTLCardinality-2024-09 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 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:32] [INFO ] Invariant cache hit.
[2026-06-10 19:03:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:32] [INFO ] Invariant cache hit.
[2026-06-10 19:03:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:32] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 88/88 places, 101/101 transitions.
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 6 ms
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 5 ms
[2026-06-10 19:03:32] [INFO ] Input system was already deterministic with 101 transitions.
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 3 ms
[2026-06-10 19:03:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality16876665873819089979.gal : 1 ms
[2026-06-10 19:03:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality8024336865769576397.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/CTLCardinality16876665873819089979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8024336865769576397.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,40910,0.02246,4648,2,868,5,2295,6,0,382,1137,0


Converting to forward existential form...Done !
original formula: (EF(EX(TRUE)) * EF((((((((((tmp_10+tmp_19)+(tmp_20+tmp_28))+((tmp_29+tmp_30)+(tmp_37+tmp_38)))+(((tmp_39+tmp_40)+(tmp_46+tmp_47))+((tmp_4...796
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U EX(TRUE))),TRUE) * (((((((((tmp_10+tmp_19)+(tmp_20+tmp_28))+((tmp_29+tmp_30)+(tmp_37+tmp...854
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54...346
(forward)formula 0,1,0.220685,15480,1,0,254,58396,224,108,3463,40661,217
FORMULA LastZero-COL-N08-CTLCardinality-2024-10 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 : 88/88 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:32] [INFO ] Invariant cache hit.
[2026-06-10 19:03:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 80 transitions (discarded 21 similar events)
[2026-06-10 19:03:32] [INFO ] Invariant cache hit.
[2026-06-10 19:03:32] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-06-10 19:03:32] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-06-10 19:03:32] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 88/88 places, 101/101 transitions.
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 5 ms
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:32] [INFO ] Input system was already deterministic with 101 transitions.
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 3 ms
[2026-06-10 19:03:32] [INFO ] Flatten gal took : 7 ms
[2026-06-10 19:03:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality1644646261658469014.gal : 1 ms
[2026-06-10 19:03:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5872759530674540945.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/CTLCardinality1644646261658469014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5872759530674540945.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,40910,0.02426,4644,2,868,5,2295,6,0,382,1137,0


Converting to forward existential form...Done !
original formula: E((((((((tmp_10+tmp_19)+(tmp_20+tmp_28))+((tmp_29+tmp_30)+(tmp_37+tmp_38)))+(((tmp_39+tmp_40)+(tmp_46+tmp_47))+((tmp_48+tmp_49)+(tmp_50+t...679
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(((((((tmp_10+tmp_19)+(tmp_20+tmp_28))+((tmp_29+tmp_30)+(tmp_37+tmp_38)))+(((tmp_39+tmp_40)+(tm...732
Hit Full ! (commute/partial/dont) 29/0/72
(forward)formula 0,1,0.057472,5504,1,0,9,3898,16,1,1660,1872,6
FORMULA LastZero-COL-N08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 69 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 69 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 64 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 64 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 59 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 59 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 55 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 55 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 51 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 51 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 48 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 48 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 45 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 45 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 43 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 43 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 41 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 41 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 40 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 40 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 39 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 39 transition count 31
Applied a total of 98 rules in 13 ms. Remains 39 /88 variables (removed 49) and now considering 31/101 (removed 70) transitions.
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-820869004716243730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13922322469918353048.kers'
[2026-06-10 19:03:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-820869004716243730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13922322469918353048.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 0 ms.
// Phase 1: matrix 24 rows 32 cols 47 entries
Finished phase 1 with 17 SingleSign rule and 7 generalized
[2026-06-10 19:03:32] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13922322469918353048.kers
Total runtime 0 ms.
[2026-06-10 19:03:32] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:32] [INFO ] Invariant cache hit.
[2026-06-10 19:03:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2026-06-10 19:03:32] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:32] [INFO ] Invariant cache hit.
[2026-06-10 19:03:32] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 62 constraints, problems are : Problem set: 0 solved, 23 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 24/63 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/63 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 85 constraints, problems are : Problem set: 0 solved, 23 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 627ms
Starting structural reductions in LTL mode, iteration 1 : 39/88 places, 31/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 39/88 places, 31/101 transitions.
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 3 ms
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:33] [INFO ] Input system was already deterministic with 31 transitions.
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 1 ms
[2026-06-10 19:03:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality14748441067237615367.gal : 1 ms
[2026-06-10 19:03:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7235367049129485019.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/CTLCardinality14748441067237615367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7235367049129485019.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,9841,0.006241,4028,2,123,5,504,6,0,158,355,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.006683,4028,1,0,6,504,7,1,243,355,1
FORMULA LastZero-COL-N08-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 101/101 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 94
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 75 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 75 transition count 82
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 69 transition count 76
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 69 transition count 76
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 64 transition count 66
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 64 transition count 66
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 59 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 59 transition count 61
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 55 transition count 53
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 55 transition count 53
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 51 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 51 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 48 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 48 transition count 43
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 45 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 45 transition count 40
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 43 transition count 36
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 43 transition count 36
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 41 transition count 34
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 41 transition count 34
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 40 transition count 32
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 40 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 39 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 39 transition count 31
Applied a total of 98 rules in 7 ms. Remains 39 /88 variables (removed 49) and now considering 31/101 (removed 70) transitions.
[2026-06-10 19:03:33] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:33] [INFO ] Invariant cache hit.
[2026-06-10 19:03:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-06-10 19:03:33] [INFO ] Flow matrix only has 24 transitions (discarded 7 similar events)
[2026-06-10 19:03:33] [INFO ] Invariant cache hit.
[2026-06-10 19:03:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-06-10 19:03:33] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 39/88 places, 31/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 39/88 places, 31/101 transitions.
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 2 ms
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 1 ms
[2026-06-10 19:03:33] [INFO ] Input system was already deterministic with 31 transitions.
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 1 ms
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 1 ms
[2026-06-10 19:03:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality178327390382556457.gal : 0 ms
[2026-06-10 19:03:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality4019293195379796775.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/CTLCardinality178327390382556457.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4019293195379796775.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,9841,0.008431,4028,2,123,5,504,6,0,158,355,0


Converting to forward existential form...Done !
original formula: AX(AX(AX(FALSE)))
=> equivalent forward existential formula: [(EY(EY(EY(Init))) * !(FALSE))] = FALSE
(forward)formula 0,0,0.00985,4028,1,0,8,584,7,1,266,429,3
FORMULA LastZero-COL-N08-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-06-10 19:03:33] [INFO ] Flatten gal took : 4 ms
[2026-06-10 19:03:33] [INFO ] Flatten gal took : 4 ms
Total runtime 43891 ms.

BK_STOP 1781118213906

--------------------
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="LastZero-COL-N08"
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 LastZero-COL-N08, 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 r354-tall-178024402700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-COL-N08.tgz
mv LastZero-COL-N08 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 ;