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.r338-smll-178021499200233.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 ErlangenMainframeV2-PT-bP04C04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499200233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.5K May 27 09:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 09:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 27 10:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.8K May 27 09:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 27 09:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 27 09:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 09:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 222K May 26 18:17 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 ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-00
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-01
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-02
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-03
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-04
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-05
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-06
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-07
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-08
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-09
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-10
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-11
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-12
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-13
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-14
FORMULA_NAME ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1780372650898

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV2-PT-bP04C04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-06-02 03:57:32] [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-02 03:57:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-02 03:57:33] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2026-06-02 03:57:33] [INFO ] Transformed 239 places.
[2026-06-02 03:57:33] [INFO ] Transformed 511 transitions.
[2026-06-02 03:57:33] [INFO ] Found NUPN structural information;
[2026-06-02 03:57:33] [INFO ] Parsed PT model containing 239 places and 511 transitions and 3954 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 239 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 511/511 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 207 transition count 479
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 207 transition count 479
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 74 place count 197 transition count 469
Iterating global reduction 0 with 10 rules applied. Total rules applied 84 place count 197 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 195 transition count 441
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 195 transition count 441
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 194 transition count 387
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 194 transition count 387
Applied a total of 90 rules in 98 ms. Remains 194 /239 variables (removed 45) and now considering 387/511 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6148453340209028420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17386809457225852850.kers'
[2026-06-02 03:57:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6148453340209028420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17386809457225852850.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 387 rows 194 cols 2788 entries
Finished phase 1 with 175 SingleSign rule and 3 generalized
[2026-06-02 03:57:33] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17386809457225852850.kers
Total runtime 5 ms.
[2026-06-02 03:57:34] [INFO ] Implicit Places using invariants in 650 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 707 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/239 places, 387/511 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 840 ms. Remains : 193/239 places, 387/511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-264298789402904565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11003615637477462705.kers'
[2026-06-02 03:57:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-264298789402904565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11003615637477462705.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 387 rows 193 cols 2626 entries
Finished phase 1 with 175 SingleSign rule and 3 generalized
[2026-06-02 03:57:34] [INFO ] Computed 15 invariants in 4 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11003615637477462705.kers
Total runtime 5 ms.
[2026-06-02 03:57:34] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-06-02 03:57:34] [INFO ] Invariant cache hit.
[2026-06-02 03:57:34] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2026-06-02 03:57:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/580 variables, 193/220 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/580 variables, and 220 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/193 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (OVERLAPS) 387/580 variables, 193/220 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 386/606 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 17/623 constraints. Problems are: Problem set: 0 solved, 386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/580 variables, and 623 constraints, problems are : Problem set: 0 solved, 386 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60935ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Finished structural reductions in LTL mode , in 1 iterations and 61746 ms. Remains : 193/193 places, 387/387 transitions.
Support contains 72 out of 193 places after structural reductions.
[2026-06-02 03:58:36] [INFO ] Flatten gal took : 174 ms
[2026-06-02 03:58:36] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-06-02 03:58:36] [INFO ] Flatten gal took : 100 ms
[2026-06-02 03:58:36] [INFO ] Input system was already deterministic with 387 transitions.
Support contains 65 out of 193 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3640 ms. (10 steps per ms) remains 11/41 properties
BEST_FIRST walk for 40000 steps (8 resets) in 528 ms. (75 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 213 ms. (186 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
[2026-06-02 03:58:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/143 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 50/193 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 387/580 variables, 193/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/580 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 208 constraints, problems are : Problem set: 0 solved, 4 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/71 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 72/143 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 50/193 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 387/580 variables, 193/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/580 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 213 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 193/193 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 2 properties in 730 ms.
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 387/387 transitions.
Graph (trivial) has 165 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 10 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 186 transition count 324
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 66 rules applied. Total rules applied 117 place count 136 transition count 308
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 125 place count 128 transition count 308
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 125 place count 128 transition count 295
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 151 place count 115 transition count 295
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 168 place count 98 transition count 252
Iterating global reduction 3 with 17 rules applied. Total rules applied 185 place count 98 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 185 place count 98 transition count 248
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 193 place count 94 transition count 248
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 200 place count 87 transition count 168
Ensure Unique test removed 2 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 209 place count 85 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 213 place count 81 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 217 place count 81 transition count 104
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 271 place count 54 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 273 place count 52 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 275 place count 52 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 287 place count 46 transition count 94
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 297 place count 46 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 298 place count 45 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 299 place count 45 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 303 place count 45 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 305 place count 44 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 323 place count 44 transition count 73
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 331 place count 44 transition count 65
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 347 place count 36 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 354 place count 36 transition count 50
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 36 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 35 transition count 52
Applied a total of 356 rules in 170 ms. Remains 35 /193 variables (removed 158) and now considering 52/387 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 35/193 places, 52/387 transitions.
RANDOM walk for 2905 steps (0 resets) in 46 ms. (61 steps per ms) remains 0/2 properties
[2026-06-02 03:58:41] [INFO ] Flatten gal took : 70 ms
[2026-06-02 03:58:41] [INFO ] Flatten gal took : 69 ms
[2026-06-02 03:58:41] [INFO ] Input system was already deterministic with 387 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 164 transition count 332
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 164 transition count 332
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 72 place count 150 transition count 272
Iterating global reduction 0 with 14 rules applied. Total rules applied 86 place count 150 transition count 272
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 142 transition count 218
Ensure Unique test removed 1 places
Iterating global reduction 0 with 9 rules applied. Total rules applied 103 place count 141 transition count 218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 108 place count 136 transition count 173
Iterating global reduction 0 with 5 rules applied. Total rules applied 113 place count 136 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 115 place count 134 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 117 place count 134 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 118 place count 133 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 133 transition count 170
Applied a total of 119 rules in 22 ms. Remains 133 /193 variables (removed 60) and now considering 170/387 (removed 217) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15535521593776405110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1837803603558734844.kers'
[2026-06-02 03:58:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15535521593776405110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1837803603558734844.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 133 cols 554 entries
Finished phase 1 with 117 SingleSign rule and 2 generalized
[2026-06-02 03:58:41] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1837803603558734844.kers
Total runtime 1 ms.
[2026-06-02 03:58:41] [INFO ] Implicit Places using invariants in 105 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 132/193 places, 170/387 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 132/193 places, 170/387 transitions.
[2026-06-02 03:58:41] [INFO ] Flatten gal took : 13 ms
[2026-06-02 03:58:41] [INFO ] Flatten gal took : 11 ms
[2026-06-02 03:58:41] [INFO ] Input system was already deterministic with 170 transitions.
[2026-06-02 03:58:41] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:58:41] [INFO ] Flatten gal took : 10 ms
[2026-06-02 03:58:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality7090650088555377863.gal : 8 ms
[2026-06-02 03:58:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7736289262887853627.ctl : 6 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/CTLCardinality7090650088555377863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7736289262887853627.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(((E(AG((p107==1)) U !(A((p41==1) U (p33==1)))) + (p84==1)) + EX((((p208==0)&&(p129==1))&&(p170==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EX((((p208==0)&&(p129==1))&&(p170==1))))) * !((p84==1))) * !(E(!(E(TRUE U !((p107==1))))...240
Reverse transition relation is NOT exact ! Due to transitions t13, t17, t20, t25, t40, t49, t71, t72, t75, t82, t88, t90, t92, t94, t95, t96, t98, t99, t10...342
(forward)formula 0,0,4.87241,117032,1,0,334,573543,380,160,4767,535716,410
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 159 transition count 327
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 159 transition count 327
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 86 place count 141 transition count 252
Iterating global reduction 0 with 18 rules applied. Total rules applied 104 place count 141 transition count 252
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 114 place count 131 transition count 183
Ensure Unique test removed 3 places
Iterating global reduction 0 with 13 rules applied. Total rules applied 127 place count 128 transition count 183
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 134 place count 121 transition count 154
Iterating global reduction 0 with 7 rules applied. Total rules applied 141 place count 121 transition count 154
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 144 place count 118 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 147 place count 118 transition count 150
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 148 place count 117 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 117 transition count 149
Applied a total of 149 rules in 14 ms. Remains 117 /193 variables (removed 76) and now considering 149/387 (removed 238) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15033520843781858850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5277062256044156718.kers'
[2026-06-02 03:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15033520843781858850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5277062256044156718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 149 rows 117 cols 422 entries
Finished phase 1 with 104 SingleSign rule and 1 generalized
[2026-06-02 03:58:46] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5277062256044156718.kers
Total runtime 1 ms.
[2026-06-02 03:58:46] [INFO ] Implicit Places using invariants in 66 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/193 places, 149/387 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 116/193 places, 149/387 transitions.
[2026-06-02 03:58:46] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:58:46] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:58:46] [INFO ] Input system was already deterministic with 149 transitions.
[2026-06-02 03:58:46] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:58:46] [INFO ] Flatten gal took : 5 ms
[2026-06-02 03:58:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality15728161830455996879.gal : 4 ms
[2026-06-02 03:58:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality16345061868490927771.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/CTLCardinality15728161830455996879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16345061868490927771.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.50295e+09,0.123328,7692,2,1513,5,16378,6,0,615,15793,0


Converting to forward existential form...Done !
original formula: EF(AX((p165==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((p165==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t19, t27, t67, t77, t86, t88, t90, t92, t93, t94, t96, t97, t99, t100, t103, t132, ...273
(forward)formula 0,0,0.597336,21608,1,0,229,97444,315,126,3665,76323,305
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Graph (trivial) has 161 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 185 transition count 335
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 61 rules applied. Total rules applied 105 place count 142 transition count 317
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 115 place count 133 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 132 transition count 316
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 116 place count 132 transition count 306
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 136 place count 122 transition count 306
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 152 place count 106 transition count 264
Iterating global reduction 4 with 16 rules applied. Total rules applied 168 place count 106 transition count 264
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 168 place count 106 transition count 262
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 104 transition count 262
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 180 place count 96 transition count 214
Ensure Unique test removed 3 places
Iterating global reduction 4 with 11 rules applied. Total rules applied 191 place count 93 transition count 214
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 196 place count 88 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 201 place count 88 transition count 114
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 251 place count 63 transition count 89
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 253 place count 61 transition count 85
Iterating global reduction 4 with 2 rules applied. Total rules applied 255 place count 61 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 262 place count 61 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 270 place count 57 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 271 place count 57 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 272 place count 56 transition count 73
Applied a total of 272 rules in 62 ms. Remains 56 /193 variables (removed 137) and now considering 73/387 (removed 314) transitions.
[2026-06-02 03:58:47] [INFO ] Flow matrix only has 65 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17248963531959789273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8387074301417680311.kers'
[2026-06-02 03:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17248963531959789273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8387074301417680311.kers]
Normalized transition count is 64 out of 65 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 64 rows 54 cols 208 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-06-02 03:58:47] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8387074301417680311.kers
Total runtime 0 ms.
[2026-06-02 03:58:47] [INFO ] Implicit Places using invariants in 54 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 55/193 places, 73/387 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 72
Applied a total of 2 rules in 5 ms. Remains 54 /55 variables (removed 1) and now considering 72/73 (removed 1) transitions.
[2026-06-02 03:58:47] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-410518872987308067.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13563498562952289689.kers'
[2026-06-02 03:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-410518872987308067.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13563498562952289689.kers]
Normalized transition count is 63 out of 64 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 63 rows 52 cols 205 entries
Finished phase 1 with 42 SingleSign rule and 1 generalized
[2026-06-02 03:58:47] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13563498562952289689.kers
Total runtime 0 ms.
[2026-06-02 03:58:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-06-02 03:58:47] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2026-06-02 03:58:47] [INFO ] Invariant cache hit.
[2026-06-02 03:58:47] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/193 places, 72/387 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 253 ms. Remains : 54/193 places, 72/387 transitions.
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:58:47] [INFO ] Input system was already deterministic with 72 transitions.
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 3 ms
[2026-06-02 03:58:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality989448723326454253.gal : 1 ms
[2026-06-02 03:58:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11482708999685756605.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/CTLCardinality989448723326454253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11482708999685756605.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.63116e+06,0.034423,4856,2,434,5,3969,6,0,285,3566,0


Converting to forward existential form...Done !
original formula: E((((!((!((p236==1)||(p120==1)))||(p66==1)))||(p214==0))||(p238==1)) U ((p67==1) + EF(AG(((p118==0)||(p45==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,(((!((!((p236==1)||(p120==1)))||(p66==1)))||(p214==0))||(p238==1))) * (p67==1))] != FALSE + [(FwdU(...290
Hit Full ! (commute/partial/dont) 58/0/14
(forward)formula 0,1,0.090151,6684,1,0,8,12776,15,1,598,14462,4
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 170 transition count 356
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 170 transition count 356
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 58 place count 158 transition count 327
Iterating global reduction 0 with 12 rules applied. Total rules applied 70 place count 158 transition count 327
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 152 transition count 254
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 83 place count 151 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 89 place count 145 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 95 place count 145 transition count 187
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 97 place count 143 transition count 184
Iterating global reduction 0 with 2 rules applied. Total rules applied 99 place count 143 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 100 place count 142 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 142 transition count 183
Applied a total of 101 rules in 21 ms. Remains 142 /193 variables (removed 51) and now considering 183/387 (removed 204) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10288502673446028892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4155960470361963208.kers'
[2026-06-02 03:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10288502673446028892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4155960470361963208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 183 rows 142 cols 636 entries
Finished phase 1 with 125 SingleSign rule and 3 generalized
[2026-06-02 03:58:47] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4155960470361963208.kers
Total runtime 1 ms.
[2026-06-02 03:58:47] [INFO ] Implicit Places using invariants in 86 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/193 places, 183/387 transitions.
Applied a total of 0 rules in 2 ms. Remains 141 /141 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 141/193 places, 183/387 transitions.
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:58:47] [INFO ] Input system was already deterministic with 183 transitions.
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:58:47] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:58:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality8983038064435142199.gal : 2 ms
[2026-06-02 03:58:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4981527268626880035.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/CTLCardinality8983038064435142199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4981527268626880035.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,8.63512e+09,1.18749,33620,2,8712,5,109911,6,0,749,128183,0


Converting to forward existential form...Done !
original formula: E(E((AF((p0==1)) + !(((!(((p53==0)||(p185==1))&&(p200==1)))||((p31==0)&&(((p100==1)||(p137==0))||(p112==1)))))) U AF((A((p113==1) U (p166...328
=> equivalent forward existential formula: [(FwdU(Init,E((!(EG(!((p0==1)))) + !(((!(((p53==0)||(p185==1))&&(p200==1)))||((p31==0)&&(((p100==1)||(p137==0))|...469
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t14, t19, t20, t22, t32, t36, t37, t40, t49, t52, t57, t70, t77, t80, t83, t8...382
Detected timeout of ITS tools.
[2026-06-02 03:59:17] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:59:17] [INFO ] Applying decomposition
[2026-06-02 03:59:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4795294503324216229.txt' '-o' '/tmp/graph4795294503324216229.bin' '-w' '/tmp/graph4795294503324216229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4795294503324216229.bin' '-l' '-1' '-v' '-w' '/tmp/graph4795294503324216229.weights' '-q' '0' '-e' '0.001'
[2026-06-02 03:59:17] [INFO ] Decomposing Gal with order
[2026-06-02 03:59:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 03:59:18] [INFO ] Removed a total of 183 redundant transitions.
[2026-06-02 03:59:18] [INFO ] Flatten gal took : 89 ms
[2026-06-02 03:59:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 16 ms.
[2026-06-02 03:59:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality6589736087065503256.gal : 6 ms
[2026-06-02 03:59:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality9569228970604233286.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/CTLCardinality6589736087065503256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9569228970604233286.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.63512e+09,0.211571,8964,499,103,8637,849,556,18993,117,2693,0


Converting to forward existential form...Done !
original formula: E(E((AF((i0.u0.p0==1)) + !(((!(((i1.i0.u8.p53==0)||(i8.u36.p185==1))&&(i8.u38.p200==1)))||((i5.i1.u4.p31==0)&&(((i3.u16.p100==1)||(i6.i0....497
=> equivalent forward existential formula: [(FwdU(Init,E((!(EG(!((i0.u0.p0==1)))) + !(((!(((i1.i0.u8.p53==0)||(i8.u36.p185==1))&&(i8.u38.p200==1)))||((i5.i...658
Reverse transition relation is NOT exact ! Due to transitions t77, t98, t107, t118, t119, t121, t122, i1.t3, i1.i0.t106, i1.i0.u8.t2, i1.i1.u9.t168, i2.t10...594
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,6.07069,156584,1,0,249738,2421,3667,689884,664,5616,391476
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Graph (trivial) has 170 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 185 transition count 331
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 63 rules applied. Total rules applied 111 place count 138 transition count 315
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 121 place count 129 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 128 transition count 314
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 122 place count 128 transition count 304
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 142 place count 118 transition count 304
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 162 place count 98 transition count 258
Iterating global reduction 4 with 20 rules applied. Total rules applied 182 place count 98 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 182 place count 98 transition count 255
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 188 place count 95 transition count 255
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 199 place count 84 transition count 168
Ensure Unique test removed 4 places
Iterating global reduction 4 with 15 rules applied. Total rules applied 214 place count 80 transition count 168
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 220 place count 74 transition count 98
Iterating global reduction 4 with 6 rules applied. Total rules applied 226 place count 74 transition count 98
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 276 place count 49 transition count 73
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 280 place count 45 transition count 66
Iterating global reduction 4 with 4 rules applied. Total rules applied 284 place count 45 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 291 place count 45 transition count 59
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 299 place count 41 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 300 place count 40 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 302 place count 38 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 306 place count 38 transition count 50
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 308 place count 38 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 310 place count 36 transition count 48
Applied a total of 310 rules in 53 ms. Remains 36 /193 variables (removed 157) and now considering 48/387 (removed 339) transitions.
[2026-06-02 03:59:24] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8945079434344909074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13789213779952855756.kers'
[2026-06-02 03:59:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8945079434344909074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13789213779952855756.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 41 rows 32 cols 100 entries
Finished phase 1 with 27 SingleSign rule and 0 generalized
[2026-06-02 03:59:24] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13789213779952855756.kers
Total runtime 0 ms.
[2026-06-02 03:59:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-06-02 03:59:24] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
[2026-06-02 03:59:24] [INFO ] Invariant cache hit.
[2026-06-02 03:59:24] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2026-06-02 03:59:24] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2026-06-02 03:59:24] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
[2026-06-02 03:59:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/77 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/78 variables, and 45 constraints, problems are : Problem set: 0 solved, 32 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 5/36 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 32/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/78 variables, and 77 constraints, problems are : Problem set: 0 solved, 32 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1488ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 1488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 36/193 places, 48/387 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1650 ms. Remains : 36/193 places, 48/387 transitions.
[2026-06-02 03:59:25] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:25] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:25] [INFO ] Input system was already deterministic with 48 transitions.
[2026-06-02 03:59:25] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:25] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality15114802480750412646.gal : 0 ms
[2026-06-02 03:59:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality9246667481595509398.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/CTLCardinality15114802480750412646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9246667481595509398.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,64512,0.01605,4116,2,89,5,619,5,0,193,498,0


Converting to forward existential form...Done !
original formula: A((p230==0) U !(EF((p161==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (p161==1))))))) * !(E(!(!(E(TRUE U (p161==1)))) U (!((p230==0)) * !(!(E(TRUE U (p161...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.17899,8228,1,0,30,23814,21,40,954,26132,48
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 163 transition count 348
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 163 transition count 348
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 74 place count 149 transition count 300
Iterating global reduction 0 with 14 rules applied. Total rules applied 88 place count 149 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 143 transition count 213
Ensure Unique test removed 1 places
Iterating global reduction 0 with 7 rules applied. Total rules applied 101 place count 142 transition count 213
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 105 place count 138 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 109 place count 138 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 110 place count 137 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 111 place count 137 transition count 181
Applied a total of 111 rules in 16 ms. Remains 137 /193 variables (removed 56) and now considering 181/387 (removed 206) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8195993318993718581.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-534138010604231323.kers'
[2026-06-02 03:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8195993318993718581.kers, --Pflows, --basisKERS=/tmp/petrispot-output-534138010604231323.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 181 rows 137 cols 616 entries
Finished phase 1 with 121 SingleSign rule and 2 generalized
[2026-06-02 03:59:26] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-534138010604231323.kers
Total runtime 2 ms.
[2026-06-02 03:59:26] [INFO ] Implicit Places using invariants in 113 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/193 places, 181/387 transitions.
Applied a total of 0 rules in 3 ms. Remains 136 /136 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 135 ms. Remains : 136/193 places, 181/387 transitions.
[2026-06-02 03:59:26] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:59:26] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:59:26] [INFO ] Input system was already deterministic with 181 transitions.
[2026-06-02 03:59:26] [INFO ] Flatten gal took : 7 ms
[2026-06-02 03:59:26] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:59:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality11207823713549985158.gal : 2 ms
[2026-06-02 03:59:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11077861858596318255.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/CTLCardinality11207823713549985158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11077861858596318255.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,5.5553e+09,0.589794,15300,2,4539,5,44210,6,0,727,44141,0


Converting to forward existential form...Done !
original formula: (EX((EX(EF(((p136==0)&&(p33==1)))) * EF(EX(AG((p99==1)))))) + AX(EG(AX(((p192==1)&&((p58==0)||(p215==1)))))))
=> equivalent forward existential formula: [(EY((Init * !(EX((EX(E(TRUE U ((p136==0)&&(p33==1)))) * E(TRUE U EX(!(E(TRUE U !((p99==1))))))))))) * !(EG(!(EX...207
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t19, t23, t31, t74, t77, t84, t94, t96, t98, t101, t102, t104, t106, t107, t109, t1...307
(forward)formula 0,0,2.90364,72172,1,0,321,355904,394,162,5104,292207,405
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Graph (trivial) has 169 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 185 transition count 330
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 63 rules applied. Total rules applied 112 place count 137 transition count 315
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 129 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 128 transition count 314
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 122 place count 128 transition count 304
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 142 place count 118 transition count 304
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 161 place count 99 transition count 259
Iterating global reduction 4 with 19 rules applied. Total rules applied 180 place count 99 transition count 259
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 180 place count 99 transition count 256
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 186 place count 96 transition count 256
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 197 place count 85 transition count 169
Ensure Unique test removed 4 places
Iterating global reduction 4 with 15 rules applied. Total rules applied 212 place count 81 transition count 169
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 218 place count 75 transition count 99
Iterating global reduction 4 with 6 rules applied. Total rules applied 224 place count 75 transition count 99
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 274 place count 50 transition count 74
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 278 place count 46 transition count 67
Iterating global reduction 4 with 4 rules applied. Total rules applied 282 place count 46 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 289 place count 46 transition count 60
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 297 place count 42 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 298 place count 41 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 300 place count 39 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 304 place count 39 transition count 51
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 306 place count 39 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 308 place count 37 transition count 49
Applied a total of 308 rules in 44 ms. Remains 37 /193 variables (removed 156) and now considering 49/387 (removed 338) transitions.
[2026-06-02 03:59:29] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12989983524406090365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16564498859762239575.kers'
[2026-06-02 03:59:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12989983524406090365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16564498859762239575.kers]
Normalized transition count is 42 out of 43 initially.
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 42 rows 33 cols 103 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-06-02 03:59:29] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16564498859762239575.kers
Total runtime 0 ms.
[2026-06-02 03:59:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-06-02 03:59:29] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
[2026-06-02 03:59:29] [INFO ] Invariant cache hit.
[2026-06-02 03:59:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2026-06-02 03:59:29] [INFO ] Redundant transitions in 0 ms returned []
Running 37 sub problems to find dead transitions.
[2026-06-02 03:59:29] [INFO ] Flow matrix only has 43 transitions (discarded 6 similar events)
[2026-06-02 03:59:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 4/37 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 42/79 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 0/79 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 4/37 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 42/79 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 37/83 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 0/79 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/80 variables, and 84 constraints, problems are : Problem set: 0 solved, 37 unsolved in 1323 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 2330ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/193 places, 49/387 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2475 ms. Remains : 37/193 places, 49/387 transitions.
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 1 ms
[2026-06-02 03:59:31] [INFO ] Input system was already deterministic with 49 transitions.
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 1 ms
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 1 ms
[2026-06-02 03:59:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality2168189398513643443.gal : 0 ms
[2026-06-02 03:59:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13093974798512226447.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/CTLCardinality2168189398513643443.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13093974798512226447.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,79968,0.018781,4128,2,115,5,713,5,0,197,551,0


Converting to forward existential form...Done !
original formula: EF(EG(AG((((p110==1)||(p224==0))||(p196==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(TRUE U !((((p110==1)||(p224==0))||(p196==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.058765,4900,1,0,8,5362,19,2,936,3377,11
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 162 transition count 338
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 162 transition count 338
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 78 place count 146 transition count 265
Iterating global reduction 0 with 16 rules applied. Total rules applied 94 place count 146 transition count 265
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 138 transition count 195
Ensure Unique test removed 2 places
Iterating global reduction 0 with 10 rules applied. Total rules applied 112 place count 136 transition count 195
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 118 place count 130 transition count 166
Iterating global reduction 0 with 6 rules applied. Total rules applied 124 place count 130 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 126 place count 128 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 128 place count 128 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 127 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 127 transition count 162
Applied a total of 130 rules in 15 ms. Remains 127 /193 variables (removed 66) and now considering 162/387 (removed 225) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11695617864198015194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17576949233553349810.kers'
[2026-06-02 03:59:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11695617864198015194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17576949233553349810.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 127 cols 492 entries
Finished phase 1 with 112 SingleSign rule and 2 generalized
[2026-06-02 03:59:31] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17576949233553349810.kers
Total runtime 2 ms.
[2026-06-02 03:59:31] [INFO ] Implicit Places using invariants in 91 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 126/193 places, 162/387 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 126/193 places, 162/387 transitions.
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:59:31] [INFO ] Input system was already deterministic with 162 transitions.
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:59:31] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:59:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality17987166049406793206.gal : 2 ms
[2026-06-02 03:59:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality2826491738077511170.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/CTLCardinality17987166049406793206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2826491738077511170.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,2.99167e+09,0.246353,11080,2,3356,5,31038,6,0,668,26476,0


Converting to forward existential form...Done !
original formula: E(AF(!(AX((p14==1)))) U EG(!(((p184==0)||(p160==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,!(EG(!(!(!(EX(!((p14==1))))))))),!(((p184==0)||(p160==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t17, t20, t28, t70, t80, t89, t91, t93, t95, t96, t97, t99, t101, t103, t104, t107, t108...275
Hit Full ! (commute/partial/dont) 155/7/7
(forward)formula 0,1,2.21988,54528,1,0,273,251003,358,139,4500,224500,364
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Graph (trivial) has 172 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 185 transition count 328
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 68 rules applied. Total rules applied 119 place count 135 transition count 310
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 128 place count 126 transition count 310
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 128 place count 126 transition count 300
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 148 place count 116 transition count 300
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 167 place count 97 transition count 255
Iterating global reduction 3 with 19 rules applied. Total rules applied 186 place count 97 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 186 place count 97 transition count 252
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 192 place count 94 transition count 252
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 202 place count 84 transition count 166
Ensure Unique test removed 3 places
Iterating global reduction 3 with 13 rules applied. Total rules applied 215 place count 81 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 220 place count 76 transition count 98
Iterating global reduction 3 with 5 rules applied. Total rules applied 225 place count 76 transition count 98
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 273 place count 52 transition count 74
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 276 place count 49 transition count 69
Iterating global reduction 3 with 3 rules applied. Total rules applied 279 place count 49 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 286 place count 49 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 294 place count 45 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 44 transition count 57
Applied a total of 295 rules in 31 ms. Remains 44 /193 variables (removed 149) and now considering 57/387 (removed 330) transitions.
[2026-06-02 03:59:34] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9095327280781836194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17648084972035341639.kers'
[2026-06-02 03:59:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9095327280781836194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17648084972035341639.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 47 rows 42 cols 142 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-06-02 03:59:34] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17648084972035341639.kers
Total runtime 0 ms.
[2026-06-02 03:59:34] [INFO ] Implicit Places using invariants in 49 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/193 places, 57/387 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 39 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 39 transition count 51
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 39 transition count 49
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 37 transition count 49
Applied a total of 14 rules in 4 ms. Remains 37 /43 variables (removed 6) and now considering 49/57 (removed 8) transitions.
[2026-06-02 03:59:34] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1803491768227209261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2697349302931101577.kers'
[2026-06-02 03:59:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1803491768227209261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2697349302931101577.kers]
Normalized transition count is 43 out of 44 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 43 rows 34 cols 119 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-06-02 03:59:34] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2697349302931101577.kers
Total runtime 1 ms.
[2026-06-02 03:59:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-06-02 03:59:34] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
[2026-06-02 03:59:34] [INFO ] Invariant cache hit.
[2026-06-02 03:59:34] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 37/193 places, 49/387 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 194 ms. Remains : 37/193 places, 49/387 transitions.
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:34] [INFO ] Input system was already deterministic with 49 transitions.
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 1 ms
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 2 ms
[2026-06-02 03:59:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality2779566173012020361.gal : 0 ms
[2026-06-02 03:59:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6095687964586112789.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/CTLCardinality2779566173012020361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6095687964586112789.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,124416,0.01676,4248,2,133,5,1572,5,0,198,1458,0


Converting to forward existential form...Done !
original formula: AG(EF(AG((p44==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !((p44==0)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.075078,6148,1,0,8,14050,13,1,913,8662,7
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 163 transition count 331
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 163 transition count 331
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 77 place count 146 transition count 257
Iterating global reduction 0 with 17 rules applied. Total rules applied 94 place count 146 transition count 257
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 137 transition count 212
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 115 place count 134 transition count 212
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 121 place count 128 transition count 163
Iterating global reduction 0 with 6 rules applied. Total rules applied 127 place count 128 transition count 163
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 130 place count 125 transition count 159
Iterating global reduction 0 with 3 rules applied. Total rules applied 133 place count 125 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 134 place count 124 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 135 place count 124 transition count 158
Applied a total of 135 rules in 12 ms. Remains 124 /193 variables (removed 69) and now considering 158/387 (removed 229) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15072385050480466037.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15644859931543482229.kers'
[2026-06-02 03:59:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15072385050480466037.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15644859931543482229.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 124 cols 456 entries
Finished phase 1 with 111 SingleSign rule and 1 generalized
[2026-06-02 03:59:34] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15644859931543482229.kers
Total runtime 1 ms.
[2026-06-02 03:59:34] [INFO ] Implicit Places using invariants in 71 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/193 places, 158/387 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 123/193 places, 158/387 transitions.
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 6 ms
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:59:34] [INFO ] Input system was already deterministic with 158 transitions.
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 9 ms
[2026-06-02 03:59:34] [INFO ] Flatten gal took : 4 ms
[2026-06-02 03:59:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality1430865722903434834.gal : 1 ms
[2026-06-02 03:59:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality8095715461846178162.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/CTLCardinality1430865722903434834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8095715461846178162.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(((AF(!(E((p11==1) U EG((p197==0))))) + EX(((p118==0)&&(p153==1)))) + (AG((((p74==1)||(p208==0))||(p202==1))) + ((p70==1)&&((p143==1)||...168
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E((p11==1) U EG((p197==0))))))) + EX(((p118==0)&&(p153==1)))) + (!(E(TRUE U !((((p74==1)...231
Reverse transition relation is NOT exact ! Due to transitions t12, t16, t19, t24, t28, t34, t51, t55, t69, t72, t75, t79, t81, t87, t89, t91, t93, t94, t95...344
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-06-02 04:00:04] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:00:04] [INFO ] Applying decomposition
[2026-06-02 04:00:04] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3101078179570639259.txt' '-o' '/tmp/graph3101078179570639259.bin' '-w' '/tmp/graph3101078179570639259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3101078179570639259.bin' '-l' '-1' '-v' '-w' '/tmp/graph3101078179570639259.weights' '-q' '0' '-e' '0.001'
[2026-06-02 04:00:04] [INFO ] Decomposing Gal with order
[2026-06-02 04:00:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-02 04:00:04] [INFO ] Removed a total of 105 redundant transitions.
[2026-06-02 04:00:04] [INFO ] Flatten gal took : 14 ms
[2026-06-02 04:00:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2026-06-02 04:00:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality2150749409744288897.gal : 3 ms
[2026-06-02 04:00:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality291466863467349064.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/CTLCardinality2150749409744288897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality291466863467349064.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.11025e+09,0.061815,5700,320,50,3134,419,389,4135,87,1048,0


Converting to forward existential form...Done !
original formula: AF(((AF(!(E((i2.i1.u3.p11==1) U EG((i7.i0.u32.p197==0))))) + EX(((i5.u19.p118==0)&&(i6.i1.u26.p153==1)))) + (AG((((i3.u10.p74==1)||(i10.u...253
=> equivalent forward existential formula: [FwdG(Init,!(((!(EG(!(!(E((i2.i1.u3.p11==1) U EG((i7.i0.u32.p197==0))))))) + EX(((i5.u19.p118==0)&&(i6.i1.u26.p1...316
Reverse transition relation is NOT exact ! Due to transitions t28, t89, t94, t108, t110, t112, u8.t95, u8.t97, u8.t144, i2.t98, i2.i0.t104, i2.i0.t143, i2....495
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,10.4849,245024,1,0,464584,1978,2574,674144,451,5079,630291
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 161 transition count 329
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 161 transition count 329
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 79 place count 146 transition count 268
Iterating global reduction 0 with 15 rules applied. Total rules applied 94 place count 146 transition count 268
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 139 transition count 218
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 139 transition count 218
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 134 transition count 179
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 134 transition count 179
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 121 place count 131 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 124 place count 131 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 130 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 130 transition count 174
Applied a total of 126 rules in 11 ms. Remains 130 /193 variables (removed 63) and now considering 174/387 (removed 213) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13573688110497238568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10626059200624723331.kers'
[2026-06-02 04:00:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13573688110497238568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10626059200624723331.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 130 cols 698 entries
Finished phase 1 with 113 SingleSign rule and 2 generalized
[2026-06-02 04:00:15] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10626059200624723331.kers
Total runtime 2 ms.
[2026-06-02 04:00:15] [INFO ] Implicit Places using invariants in 96 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/193 places, 174/387 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 129/193 places, 174/387 transitions.
[2026-06-02 04:00:15] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:00:15] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:00:15] [INFO ] Input system was already deterministic with 174 transitions.
[2026-06-02 04:00:15] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:00:15] [INFO ] Flatten gal took : 4 ms
[2026-06-02 04:00:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality14743430325566864255.gal : 1 ms
[2026-06-02 04:00:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality1032294305364162517.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/CTLCardinality14743430325566864255.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1032294305364162517.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,4.49619e+09,0.314429,12464,2,4243,5,36654,6,0,692,31098,0


Converting to forward existential form...Done !
original formula: EX((AG((p52==0)) * (AF(EG((p72==0))) + EX((p15==0)))))
=> equivalent forward existential formula: ([((EY(Init) * !(E(TRUE U !((p52==0))))) * !(EG(!(EG((p72==0))))))] != FALSE + [(EY((EY(Init) * !(E(TRUE U !((p5...188
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t6, t15, t19, t22, t30, t70, t80, t91, t94, t96, t97, t98, t100, t103, t104, t107...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,13.0613,283184,1,0,496,1.89149e+06,384,236,5523,1.18955e+06,630
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 387/387 transitions.
Graph (trivial) has 159 edges and 193 vertex of which 12 / 193 are part of one of the 5 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 185 transition count 335
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 59 rules applied. Total rules applied 103 place count 142 transition count 319
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 113 place count 134 transition count 317
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 132 transition count 317
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 115 place count 132 transition count 305
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 139 place count 120 transition count 305
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 155 place count 104 transition count 263
Iterating global reduction 4 with 16 rules applied. Total rules applied 171 place count 104 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 171 place count 104 transition count 261
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 102 transition count 261
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 180 place count 97 transition count 189
Ensure Unique test removed 2 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 187 place count 95 transition count 189
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 190 place count 92 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 193 place count 92 transition count 129
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 239 place count 69 transition count 106
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 243 place count 65 transition count 94
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 65 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 249 place count 65 transition count 92
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 4 with 2 rules applied. Total rules applied 251 place count 64 transition count 91
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 252 place count 64 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 63 transition count 90
Applied a total of 253 rules in 38 ms. Remains 63 /193 variables (removed 130) and now considering 90/387 (removed 297) transitions.
[2026-06-02 04:00:28] [INFO ] Flow matrix only has 86 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6204980810264969691.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9043019377577223269.kers'
[2026-06-02 04:00:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6204980810264969691.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9043019377577223269.kers]
Normalized transition count is 85 out of 86 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 85 rows 61 cols 331 entries
Finished phase 1 with 47 SingleSign rule and 3 generalized
[2026-06-02 04:00:28] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9043019377577223269.kers
Total runtime 2 ms.
[2026-06-02 04:00:28] [INFO ] Implicit Places using invariants in 72 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/193 places, 90/387 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 114 ms. Remains : 62/193 places, 90/387 transitions.
[2026-06-02 04:00:28] [INFO ] Flatten gal took : 3 ms
[2026-06-02 04:00:28] [INFO ] Flatten gal took : 2 ms
[2026-06-02 04:00:28] [INFO ] Input system was already deterministic with 90 transitions.
[2026-06-02 04:00:28] [INFO ] Flatten gal took : 3 ms
[2026-06-02 04:00:28] [INFO ] Flatten gal took : 3 ms
[2026-06-02 04:00:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality16494493398498949718.gal : 0 ms
[2026-06-02 04:00:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality4574992388872141130.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/CTLCardinality16494493398498949718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4574992388872141130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.53088e+06,0.049177,5340,2,466,5,5391,6,0,335,5074,0


Converting to forward existential form...Done !
original formula: EF(!(E(((p87==1) + A((((p173==0)||(p72==1))||(p35==0)) U (((p208==0)||(p13==1))||((p83==0)||(p196==1))))) U (p203==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((p87==1) + !((E(!((((p208==0)||(p13==1))||((p83==0)||(p196==1)))) U (!((((p173==0)||(p7...311
Reverse transition relation is NOT exact ! Due to transitions t19, t62, t63, t70, t71, t72, t73, t74, t75, Intersection with reachable at each step enable...204
(forward)formula 0,1,0.193958,9288,1,0,155,30805,207,84,2670,21900,201
FORMULA ErlangenMainframeV2-PT-bP04C04-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-06-02 04:00:28] [INFO ] Flatten gal took : 18 ms
[2026-06-02 04:00:28] [INFO ] Flatten gal took : 18 ms
Total runtime 176124 ms.

BK_STOP 1780372829020

--------------------
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="ErlangenMainframeV2-PT-bP04C04"
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 ErlangenMainframeV2-PT-bP04C04, 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 r338-smll-178021499200233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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